Garbage collection can be faster than stack allocation

Andrew W. Appel

doi:10.1016/0020-0190(87)90175-X

Garbage collection can be faster than stack allocation

Andrew W. Appel

Research output: Contribution to journal › Article › peer-review

76 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 language	English (US)
Pages (from-to)	275-279
Number of pages	5
Journal	Information Processing Letters
Volume	25
Issue number	4
DOIs	https://doi.org/10.1016/0020-0190(87)90175-X
State	Published - 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

Access to Document

10.1016/0020-0190(87)90175-X

Cite this

@article{f9814568b5994cfb84397621f2f44407,

title = "Garbage collection can be faster than stack allocation",

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.",

keywords = "Garbage collection, amortized analysis, massive memory, storage management",

author = "Appel, {Andrew W.}",

year = "1987",

month = jun,

day = "17",

doi = "10.1016/0020-0190(87)90175-X",

language = "English (US)",

volume = "25",

pages = "275--279",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier",

number = "4",

}

TY - JOUR

T1 - Garbage collection can be faster than stack allocation

AU - Appel, Andrew W.

PY - 1987/6/17

Y1 - 1987/6/17

N2 - 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.

AB - 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.

KW - Garbage collection

KW - amortized analysis

KW - massive memory

KW - storage management

UR - http://www.scopus.com/inward/record.url?scp=0023367454&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0023367454&partnerID=8YFLogxK

U2 - 10.1016/0020-0190(87)90175-X

DO - 10.1016/0020-0190(87)90175-X

M3 - Article

AN - SCOPUS:0023367454

SN - 0020-0190

VL - 25

SP - 275

EP - 279

JO - Information Processing Letters

JF - Information Processing Letters

IS - 4

ER -

Garbage collection can be faster than stack allocation

Abstract

All Science Journal Classification (ASJC) codes

Keywords

Access to Document

Other files and links

Fingerprint

Cite this