Coalescing (computer science)
 | This article was nominated for deletion. The discussion was closed on 04 December 2011 with a consensus to merge the content into the article Memory management. If you find that such action has not been taken promptly, please consider assisting in the merger instead of re-nominating the article for deletion. To discuss the merger, please use the destination article's talk page. (December 2011) |
In computer science, coalescing is the act of merging two adjacent free 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 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.
References
External links
 | This computer science article is a stub. You can help Wikipedia by expanding it. |