Live briefing
Everything about Mark–compact algorithm
Type of garbage collection algorithm
In computer science, a mark–compact algorithm is a type of garbage collection algorithm used to reclaim unreachable memory. Mark–compact algorithms can be regarded as a combination of the mark–sweep algorithm and Cheney's copying algorithm. First, reachable objects are marked, then a compacting step relocates the reachable (marked) objects towards the beginning of the heap area. Compacting garbage collection is used by modern JVMs, Microsoft's Common Language Runtime and by the Glasgow Haskell Compiler. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Mark–compact algorithmA 5-minute orientation
- Skim a recent paper: Runtime Analysis of the Compact Genetic Algorithm on the LeadingOnes BenchmarkInfluential work since 2022
- Pick up a classic book: Proceedings of the Twenty-Second Annual ACM Symposium on Principles of Distributed ComputingThe most-reprinted book on the subject
- Go sideways: Cheney's algorithmA closely related topic
- Go sideways: Garbage collection (computer science)A closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
- No matching papers found.
🆕 Influential since 2022
đź“š Books worth reading
- 📕Proceedings of the Twenty-Second Annual ACM Symposium on Principles of Distributed ComputingMass.) ACM Symposium on Principles of Distributed Computing (22nd 2003 Boston · 2003
ICSSCCET 2017 · 2017
Introduction to making very big booksUnited States. Congress. Senate. Committee on Pensions · 2011
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Cheney's 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…
- 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…
- 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…
- Integer sorting In computer science, integer sorting is the algorithmic problem of sorting a collection of data values by integer keys. Algorithms designed for integer…
- 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…
- Priority queue In computer science, a priority queue is an abstract data type similar to a regular queue where each element has an associated priority determining its…
- In-place algorithm In computer science, an in-place algorithm is an algorithm that operates directly on the input data structure without requiring extra space proportional…
- Persistent data structure In computing, a persistent data structure or not ephemeral data structure is a data structure that always preserves the previous version of itself when…