| Title: | Comparing Mostly-copying and Mark-sweep Conservative Collection |
| Author: |
Smith, Frederick; Morrisett, John Gregory
Note: Order does not necessarily reflect citation order of authors. |
| Citation: | Smith, Frederick and Greg Morrisett. 1998. Comparing mostly-copying and mark-sweep conservative collection. In ISMM 98: Proceedings of the 1st International Symposium on Memory Management, Vancouver, British Columbia, Canada, October 17-19, 1998, ed. ISMM 98, 68-78. New York, N.Y.: ACM Press. |
| Full Text & Related Files: |
Morrisett_CopyingMarkSweep.pdf (244.7Kb; PDF)
|
| Abstract: | Many high-level language compilers generate C code and then invoke a C compiler for code generation. To date, most, of these compilers link the resulting code against a conservative mark-sweep garbage collector in order to reclaim unused memory. We introduce a new collector, MCC, based on an extension of mostly-copying collection.We analyze the various design decisions made in MCC and provide a performance comparison to the most widely used conservative mark-sweep collector (the Boehm-Demers-Weiser collector). Our results show that a good mostly-copying collector can outperform a mature highly-optimized mark-sweep collector when physical memory is large relative to the live data. A surprising result of our analysis is that cache behavior can have a greater impact on overall performance than either collector time or allocation time. |
| Published Version: | http://doi.acm.org/10.1145/286860.286868 |
| Terms of Use: | This article is made available under the terms and conditions applicable to Other Posted Material, as set forth at http://nrs.harvard.edu/urn-3:HUL.InstRepos:dash.current.terms-of-use#LAA |
| Citable link to this page: | http://nrs.harvard.edu/urn-3:HUL.InstRepos:3307722 |
Contact administrator regarding this item (to report mistakes or request changes)