Shifting Garbage Collection Overhead to Compile Time

Communications of the ACM

Volumn 20, Issue 7, 1977, Pages 513-518

  Barth, Jeffrey M ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

garbage collection; global flow analysis; list processing; optimization; reference counts; storage management

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES - LIST PROCESSING; OPTIMIZATION;

COMPUTER OPERATING SYSTEMS;

EID: 0017517772     PISSN: 00010782     EISSN: 15577317     Source Type: Journal    
DOI: 10.1145/359636.359713     Document Type: Article

References (7)

1. Boom, H. Experience with the use of ALGOL W as SIL. Algol Bulletin. 37 (July 1974), 63-67.
2. Clark, D., and Green, C.C. An empirical study of list structure in LISP. Comm. ACM 20, 2 (Feb. 1977), 78-87.
3. Deutsch, L.P., and Bobrow, D.G. An efficient incremental automatic garbage collector. Tech. Rep., Xerox Palo Alto Res. Ctr., Palo Alto, Calif., Jan. 1975; also, Comm. ACM 19, 9 (Sept. 1976), 522-526.
4. Jenson, K., and Wirth, N. Pascal User Manual and Report. Springer-Verlag, New York (1974).
5. Knuth, D.E. The Art of Computer Programming, Vol. 1: Fundamental Algorithms. Addison-Wesley, Reading, Mass., 1969.
6. Rosen, B.K. Data flow analysis for recursive PL/1 programs. IBM Res. Rep., IBM, Yorktown Heights, N.Y., Jan. 1975.
7. Tarjan, R.E. Depth first search and linear graph algorithms. SIAM J. Comptng. 1, 2 (1972), 146-160.