skip to main content
10.1145/362422.362438acmconferencesArticle/Chapter ViewAbstractPublication PagesismmConference Proceedingsconference-collections
Article
Free access

Reducing garbage collector cache misses

Published: 16 October 2000 Publication History

Abstract

Cache misses are currently a major factor in the cost of garbage collection, and we expect them to dominate in the future. Traditional garbage collection algorithms exhibit relatively little temporal locality; each live object in the heap is likely to be touched exactly once during each garbage collection. We measure two techniques for dealing with this issue: prefetch-on-grey, and lazy sweeping. The first of these is new in this context. Lazy sweeping has been in common use for a decade. It was introduced as a mechanism for reducing paging and pause times; we argue that it is also crucial for eliminating cache misses during the sweep phase.
Our measurements are obtained in the context of a non-moving garbage collector. Fully copying garbage collection inherently requires more traffic through the cache, and thus probably also stands to benefit substantially from something like the prefetch-on-grey technique. Generational garbage collection may reduce the benefit of these techniques for some applications, but experiments with a non-moving generational collector suggest that they remain quite useful.

Cited By

View all
  • (2024)The One Pass (OP) Compactor: An Intellectual AbstractProceedings of the 2024 ACM SIGPLAN International Symposium on Memory Management10.1145/3652024.3665513(108-120)Online publication date: 20-Jun-2024
  • (2015)A survey on object cache locality in automated memory management systems2015 IEEE 28th Canadian Conference on Electrical and Computer Engineering (CCECE)10.1109/CCECE.2015.7129301(349-354)Online publication date: May-2015
  • (2013)Towards hinted collectionACM SIGPLAN Notices10.1145/2555670.246415848:11(3-14)Online publication date: 20-Jun-2013
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
ISMM '00: Proceedings of the 2nd international symposium on Memory management
October 2000
178 pages
ISBN:1581132638
DOI:10.1145/362422
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 16 October 2000

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Conference

ISMM00
Sponsor:
ISMM00: International Symposium on Memory Management
October 15 - 16, 2000
Minnesota, Minneapolis, USA

Acceptance Rates

ISMM '00 Paper Acceptance Rate 18 of 39 submissions, 46%;
Overall Acceptance Rate 72 of 156 submissions, 46%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)57
  • Downloads (Last 6 weeks)8
Reflects downloads up to 10 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2024)The One Pass (OP) Compactor: An Intellectual AbstractProceedings of the 2024 ACM SIGPLAN International Symposium on Memory Management10.1145/3652024.3665513(108-120)Online publication date: 20-Jun-2024
  • (2015)A survey on object cache locality in automated memory management systems2015 IEEE 28th Canadian Conference on Electrical and Computer Engineering (CCECE)10.1109/CCECE.2015.7129301(349-354)Online publication date: May-2015
  • (2013)Towards hinted collectionACM SIGPLAN Notices10.1145/2555670.246415848:11(3-14)Online publication date: 20-Jun-2013
  • (2013)Towards hinted collectionProceedings of the 2013 international symposium on memory management10.1145/2491894.2464158(3-14)Online publication date: 20-Jun-2013
  • (2013)Towards hinted collectionProceedings of the 2013 international symposium on memory management10.1145/2464157.2464158(3-14)Online publication date: 20-Jun-2013
  • (2012)Scalable concurrent and parallel markACM SIGPLAN Notices10.1145/2426642.225900647:11(61-72)Online publication date: 15-Jun-2012
  • (2012)Scalable concurrent and parallel markProceedings of the 2012 international symposium on Memory Management10.1145/2258996.2259006(61-72)Online publication date: 15-Jun-2012
  • (2011)An efficient non-moving garbage collector for functional languagesProceedings of the 16th ACM SIGPLAN international conference on Functional programming10.1145/2034773.2034802(196-208)Online publication date: 19-Sep-2011
  • (2011)An efficient non-moving garbage collector for functional languagesACM SIGPLAN Notices10.1145/2034574.203480246:9(196-208)Online publication date: 19-Sep-2011
  • (2010)The locality of concurrent write barriersACM SIGPLAN Notices10.1145/1837855.180666645:8(83-92)Online publication date: 5-Jun-2010
  • Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media