Coalescing (computer science): Difference between revisions

Revision as of 00:44, 16 December 2013

Revision as of 06:22, 5 January 2014

Line 1:

{{unreferenced|date=December 2013}}

{{Use dmy dates|date=August 2012}}

In [[computer science]], '''coalescing''' is the act of merging two adjacent free [[Block (data storage)|blocks]] of memory. When an application frees memory, gaps can fall in the [[memory segment]] that the application uses. Among other techniques, coalescing is used to reduce [[Fragmentation (computer)|external fragmentation]], but is not totally effective. Coalescing can be done as soon as blocks are freed, or it can be deferred until some time later (known as deferred coalescing), or it might not be done at all.

Coalescence and related techniques like heap compaction, can be used in [[Garbage collection (computer science)|garbage collection]].