• Home
  • Search
  • Bounding space usage of conservative garbage collectors
  • Cite Icon53
  • https://doi.org/10.1145/503272.503282Copy DOI Icon

Bounding space usage of conservative garbage collectors

  • Jan 1, 2002
  • Hans-J Boehm
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Conservative garbage collectors can automatically reclaim unused memory in the absence of precise pointer location information. If a location can possibly contain a pointer, it is treated by the collector as though it contained a pointer. Although it is commonly assumed that this can lead to unbounded space use due to misidentified pointers, such extreme space use is rarely observed in practice, and then generally only if the number of misidentified pointers is itself unbounded.We show that if the program manipulates only data structures satisfying a simple GC-robustness criterion, then a bounded number of misidentified pointers can at most result in increasing space usage by a constant factor. We argue that nearly all common data structures are already GC-robust, and it is typically easy to identify and replace those that are not. Thus it becomes feasible to prove space bounds on programs collected by mildly conservative garbage collectors, such as the one in [2]. The worst-case space overhead introduced by such mild conservatism is comparable to the worst-case fragmentation overhead for inherent in any non-moving storage allocator.The same GC-robustness criterion also ensures the absence of temporary space leaks of the kind discussed in [13] for generational garbage collectors.

Similar Papers
  • Research Article
  • Citations12

Bounding space usage of conservative garbage collectors

  • Jan 01, 2002
  • ACM SIGPLAN Notices
  • Hans-J Boehm
  • Research Article
  • Citations28

Controlling garbage collection and heap growth to reduce the execution time of Java applications

  • Sep 01, 2006
  • ACM Transactions on Programming Languages and Systems
  • Tim Brecht +3
  • Conference Article
  • Citations11

Garbage collection in the next C++ standard

  • Jun 19, 2009
  • Hans-J Boehm +1
  • Research Article
  • Citations1

Conservative garbage collection for general memory allocators

  • Oct 16, 2000
  • ACM SIGPLAN Notices
  • Gustavo Rodriguez-Rivera
  • Research Article
  • Citations10

Space efficient conservative garbage collection

  • Apr 01, 2004
  • ACM SIGPLAN Notices
  • Hans J Boehm
  • Conference Article
  • Citations11

Foundational Typed Assembly Language with Certified Garbage Collection

  • Jan 01, 2007
  • Chunxiao Lin +4
  • Conference Article
  • Citations38

Controlling garbage collection and heap growth to reduce the execution time of Java applications

  • Oct 01, 2001
  • Tim Brecht +3
  • PDF
  • Research Article
  • Citations21

Certifying graph-manipulating C programs via localizations within data structures

  • Oct 10, 2019
  • Proceedings of the ACM on Programming Languages
  • Shengyi Wang +3
  • Conference Article
  • Citations2

Cache performance of chronological garbage collection

  • May 24, 1998
  • Yuping Ding +1
  • Research Article
  • Citations7

Dynamic adaptive pre-tenuring

  • Oct 16, 2000
  • ACM SIGPLAN Notices
  • Timothy L Harris
  • Research Article
  • Citations5

A hybrid method in combining treatment effects from matched and unmatched studies

  • Jul 09, 2013
  • Statistics in Medicine
  • Jinyoung Byun +5
  • Research Article
  • Citations28

RUMA has it

  • Jun 01, 2016
  • Proceedings of the VLDB Endowment
  • Felix Martin Schuhknecht +2
  • Conference Article
  • Citations2

Garbage collection software integrated with the system swapper in a virtual memory system

  • May 17, 1993
  • J.D Katzberg +1
  • Conference Article
  • Citations30

The future(s) of shared data structures

  • Jul 15, 2014
  • Alex Kogan +1
  • PDF
  • Abstract

Towards a Scottish Safe Haven Federation.

  • Aug 25, 2022
  • International Journal of Population Data Science
  • Chuang Gao +5
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.