Quantifying the performance of garbage collection vs. explicit memory management (2005)
Cached
Download Links
- [www.cs.umass.edu]
- [www.cs.umass.edu]
- [www.cs.ucsb.edu]
- [www-cs.canisius.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | in: Proc. ACM Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA |
| Citations: | 31 - 5 self |
BibTeX
@INPROCEEDINGS{Hertz05quantifyingthe,
author = {Matthew Hertz},
title = {Quantifying the performance of garbage collection vs. explicit memory management},
booktitle = {in: Proc. ACM Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA},
year = {2005},
pages = {313--326},
publisher = {ACM Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Garbage collection yields numerous software engineering benefits, but its quantitative impact on performance remains elusive. One can compare the cost of conservative garbage collection to explicit memory management in C/C++ programs by linking in an appropriate collector. This kind of direct comparison is not possible for languages designed for garbage collection (e.g., Java), because programs in these languages naturally do not contain calls to free. Thus, the actual gap between the time and space performance of explicit memory management and precise, copying garbage collection remains unknown. We introduce a novel experimental methodology that lets us quantify the performance of precise garbage collection versus explicit memory management. Our system allows us to treat unaltered Java programs as if they used explicit memory management by relying
