Re: fast compilers [Re: Thompson's 2c vs. gcc]

psu@cs.duke.edu (Peter Su) writes:
> There was an SP&E paper on an incremental linker a while back that said it
> increased UNIX compile cycles by huge factors.


I think you meant the following TOPLAS article. (I just had the reference
handy :)


@article{comp:quong:incremental-linking,
  author = {Russel W. Quong and Mark A. Linton},
  title = {Linking Programs Incrementally},
  journal = toplas,
  volume = 13,
  number = 1,
  month = jan,
  year = 1991,
  pages = {1-20},
  annote = {Describes an in-place incremental linking done by a
daemon in the background. Needs {\it lots\/} of main memory. Linking
times are proportional to the size of the changed modules, not to the
size of the executable (as usual).}
}


Joachim
--
Joachim Schrod Email: schrod@iti.informatik.th-darmstadt.de
Computer Science Department
Technical University of Darmstadt, Germany
[This came up in compilers a few years ago. Apparently it works great but
never made it into the Unix mainstream. -John]
--

Return to the comp.compilers page.
Search the comp.compilers archives again.