Live briefing
Everything about Cheney's algorithm
Computer software algorithm
Cheney's algorithm, first described in a 1970 ACM paper by C.J. Cheney, is a stop and copy method of tracing garbage collection in computer software systems. In this scheme, the heap is divided into two equal halves, only one of which is in use at any one time. Garbage collection is performed by copying live objects from one semispace to the other, which then becomes the new heap. The entire old heap is then discarded in one piece. It is an improvement on the previous stop-and-copy technique. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Cheney's algorithmA 5-minute orientation
- Go sideways: Mark–compact algorithmA closely related topic
- Go sideways: Tracing garbage collectionA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
- No matching papers found.
đź“š Books worth reading
Open Library didn't respond; try again in a moment.
đź”— Related topics
- Mark–compact algorithm In computer science, a mark–compact algorithm is a type of garbage collection algorithm used to reclaim unreachable memory. Mark–compact algorithms can…
- Tracing garbage collection In computer programming, tracing garbage collection is a form of automatic memory management that consists of determining which objects should be deallocated…
- Garbage collection (computer science) In computer science, garbage collection (GC) is a form of automatic memory management. The garbage collector attempts to reclaim memory that was allocated…
- Reference counting In computer science, reference counting is a programming technique of storing the number of references, pointers, or handles to a resource, such as an…
- Dynamic variable In computer programming, a dynamic variable is a local variable that is created to reside in manually allocated memory that can be allocated and deallocated…
- Memory safety Memory safety is the state of being protected from various software bugs and security vulnerabilities when dealing with memory access, such as buffer overflows…
- Region-based memory management In computer science, region-based memory management is a type of memory management in which each allocated object is assigned to a region. A region, also…
- Escape analysis In compiler optimization, escape analysis is a method for determining the dynamic scope of pointers – where in the program a pointer can be accessed. It…