Generation Scavenging¶
Ungar, D. (1984). Generation Scavenging: A Non-Disruptive High Performance Storage Reclamation Algorithm. ACM SIGPLAN Notices, 19(5), 157-167.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Garbage Collection
- The generational hypothesis (most allocations die young) generalizes to recency-biased reclamation: wherever new resources are likelier than old to become unreachable, collect young regions more often.
This sourceIntroduces generational collection on the hypothesis that most objects die young, collecting young regions more frequently.
Supported in partVerified against the publisher's abstract
Ungar's abstract names Generation Scavenging and its treatment of transient objects, backing the generational frame but stating neither the 'most allocations die young' hypothesis nor the cross-domain recency-biased generalization.
“Generation Scavenging is a reclamation algorithm that has no noticeable pauses, eliminates page faults for transient objects, compacts objects without resorting to indirection, and reclaims circular structures, in one third the time of traditional approaches.”
- The generational hypothesis (most allocations die young) generalizes to recency-biased reclamation: wherever new resources are likelier than old to become unreachable, collect young regions more often.
Verification¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
Does it back the claim? Read against the text for 1 of 1 citation: 1 supported in part. Each verdict is shown under its citation below, with what in the work backs the sentence.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:8c60eb9e40c5 · see in the full table