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 collected") by tracing which objects are reachable by a chain of references from certain "root" objects, and considering the rest as "garbage" and collecting them. Tracing garbage collection is the most common type of garbage collection – so much so that "garbage collection" often refers to tracing garbage collection, rather than other methods such as reference counting – and there are a large number of algorithms used in implementation.
.NET FrameworkBlisk (browser)Boehm garbage collectorCheney's algorithmConcurrent mark sweep collectorConservative garbage collectionConservative garbage collectorDavid A. MoonDavid F. BaconDavid UngarDynamic software updatingEdsger W. DijkstraGarbage (computer science)Garbage collection (computer science)Generational garbage collectionGenerational garbage collectorGoogle ChromeIntel iAPX 432Java performanceList of algorithmsMark-and-sweepMark-compact algorithmMark-sweep algorithmMark and sweepPersistent data structureRacket (programming language)Reference countingRegion-based memory managementResource management (computing)Self (programming language)Stop-and-copyStop-the-worldStop and copyStop the WorldTracing garbage collectorTri-color markingTri-colour markingV8 (JavaScript engine)Virtual machine
Link from a Wikipage to another Wikipage
primaryTopic
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 collected") by tracing which objects are reachable by a chain of references from certain "root" objects, and considering the rest as "garbage" and collecting them. Tracing garbage collection is the most common type of garbage collection – so much so that "garbage collection" often refers to tracing garbage collection, rather than other methods such as reference counting – and there are a large number of algorithms used in implementation.
has abstract
In computer programming, traci ...... rithms used in implementation.
@en
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
1,025,039,176
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
subject
hypernym
comment
In computer programming, traci ...... rithms used in implementation.
@en
label
Tracing garbage collection
@en