Garbage collection can be faster than stack allocation

Research output: Contribution to journalArticle

65 Scopus citations

Abstract

An old and simple algorithm for garbage collection gives very good results when the physical memory is much larger than the number of reachable cells. In fact, the overhead associated with allocating and collecting cells from the heap can be reduced to less than one instruction per cell by increasing the size of physical memory. Special hardware, intricate garbage-collection algorithms, and fancy compiler analysis become unnecessary.

Original languageEnglish (US)
Pages (from-to)275-279
Number of pages5
JournalInformation Processing Letters
Volume25
Issue number4
DOIs
StatePublished - Jun 17 1987

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications

Keywords

  • Garbage collection
  • amortized analysis
  • massive memory
  • storage management

Fingerprint Dive into the research topics of 'Garbage collection can be faster than stack allocation'. Together they form a unique fingerprint.

  • Cite this