Abstract

this paper, I evaluate the costs of different dynamic storage management algorithms, including domain-specific allocators, widelyused general-purpose allocators, and a publicly available conservative garbage collection algorithm. Surprisingly, I find that programmer enhancements often have little effect on program performance. I also find that the true cost of conservative garbage collection is not the CPU overhead, but the memory system overhead of the algorithm. I conclude that conservative garbage collection is a promising alternative to explicit storage management and that the performance of conservative collection is likely to improve in the future. C programmers should now seriously consider using conservative garbage collection instead of explicitly calling free in programs they write

Citations

316	Generation Scavenging: A Non-disruptive High Performance Storage Reclamation Algorithm - Ungar - 1984
234	A Real-Time Garbage Collector Based on the Lifetime of Objects - Lieberman, Hewitt - 1983
170	Simple generational garbage collection and fast allocation. Software Practice and Experience - Appel - 1989
149	Aspects of Cache Memory and Instruction Buffer Performance - Hill - 1987
136	Garbage collection in a large LISP system - Moon - 1984
98	Compacting garbage collection with ambiguous roots - Bartlett - 1988
92	Abstract Execution: A Technique for Efficiently Tracing Programs - Larus - 1990
83	A unifying look at data structures - Vuillemin - 1980
83	Garbage collection in an uncooperative environment. Software—Practice and experience - Boehm, Weiser - 1988
82	Garbage collection of linked data structures - Cohen - 1981
57	Mostly-Copying garbage collection picks up generations and C - Bartlett - 1989
57	Comparative Performance Evaluation of Garbage Collection Algorithms - Zorn - 1989
51	Combining generational and conservative garbage collection: framework and implementations - Demers, Weiser, et al. - 1990
45	On adding garbage collection and runtime types to a strongly-typed, statically checked, concurrent language - Rovner - 1985
38	CustoMalloc: Efficient Synthesized Memory Allocators - Grunwald, Zorn - 1993
36	The effect of garbage collection on cache performance - Zorn - 1991
25	Fast fits: New methods for dynamic storage allocation - Stephenson - 1983
20	Fundamental Algorithms. Vol.1 of The Art of Computer Programming - Knuth - 1968
14	Fundamental Algorithms, volume 1 of The Art of - Knuth - 1973
11	Efficient Implementation of the First-Fit Strategy for Dynamic Storage Allocation - BRENT - 1989
7	A memory allocator with garbage collection for C - Caplinger - 1988
7	Adaptive exact-fit storage management - Oldehoeft, Allan - 1985
7	and Kiem-Phong Vo. In search of a better malloc - Korn - 1985
6	Description of a very fast storage allocator. Documentation of 4.2 BSD Unix malloc implementation - Kingsley - 1982
5	Analysis of free-storage algorithms---revisited - Bozman, Buco, et al. - 1984
2	Description of GNU malloc implementation - Haertel - 1991
2	Unix Manual Page for malloc, SunOS 4.1 edition - Microsystems, View, et al. - 1990
1	In search of a better malloc - Korn, Vo - 1985
1	Combining generational and b. zorn conservative garbage collection: framework and implementations - Demers, Weiser, et al. - 1990
1	Comment on his experiences with software-caused total system failures. Private Communication - Bartlett - 1992
1	Conservative garbage collector implementation documentation. Reference to other implementations of conservative garbage collection. From documentation of version 1.6 of the software - Boehm, Demers - 1989
1	Efficient implemenation of a first-fit strategy for dynamic storage allocation - Brent - 1989
1	Experimental heuristic mark-and-sweep garbage collector for C. Documentation of unpublished implementation - Hilfinger - 1989