Content deleted Content added
m Robot - Moving category Garbage collection (computer science) to Category:Automatic memory management per CFD at Wikipedia:Categories for discussion/Log/2011 March 13. |
AfD: Nominated for deletion; see Wikipedia:Articles for deletion/Coalescing (computer science) |
||
Line 1:
<!-- Please do not remove or change this AfD message until the issue is settled -->
{{Article for deletion/dated|page=Coalescing (computer science)|timestamp=20111121235227|year=2011|month=November|day=21|substed=yes}}
<!-- For administrator use only: {{Old AfD multi|page=Coalescing (computer science)|date=21 November 2011|result='''keep'''}} -->
<!-- End of AfD message, feel free to edit beyond this point -->
{{Orphan|date=February 2009}}
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 [[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.
Line 6 ⟶ 10:
==External links==
http://www.memorymanagement.org/articles/alloc.html
[[Category:Automatic memory management]]
| |||