Coalescing (computer science): Difference between revisions

Revision as of 18:24, 1 December 2011

Latest revision as of 19:49, 2 October 2023

(29 intermediate revisions by 19 users not shown)

Line 1:

{{Multiple issues|

<!-- Please do not remove or change this AfD message until the issue is settled -->

{{more citations needed|date=October 2023}}

{{Article for deletion/dated|page=Coalescing (computer science)|timestamp=20111121235227|year=2011|month=November|day=21|substed=yes}}

{{Update|date=March 2017 | inaccurate=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 -->

{{OrphanUse dmy dates|date=FebruaryMarch 20092023}}

In [[computer science]], '''coalescing''' is a part of [[memory management]] in which two adjacent free blocks of [[computer memory]] are merged.

{{Rescue}}

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.

When a [[Computer program|program]] no longer requires certain blocks of memory, these blocks of memory can be [[Free a memory ___location|freed]]. Without coalescing, these blocks of memory stay separate from each other in their original requested size, even if they are next to each other. If a subsequent request for memory specifies a size of memory that cannot be met with an integer number of these (potentially unequally-sized) freed blocks, these neighboring blocks of freed memory cannot be allocated for this request. Coalescing alleviates this issue by setting the neighboring blocks of freed memory to be contiguous without boundaries, such that part or all of it can be allocated for the request.

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

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.

Coalescence and related techniques like heap compaction, can be used in [[Garbage collection (computer science)|garbage collection]].<ref>{{cite web |last1=Megida |first1=Dillion |title=What is the Nullish Coalescing Operator in JavaScript, and how is it useful |url=https://www.freecodecamp.org/news/what-is-the-nullish-coalescing-operator-in-javascript-and-how-is-it-useful/ |website=Freecodecamp}}</ref>

== See also ==

* [[Timer coalescing]]

==References==

{{reflist}}

==External links==

* [http://www.memorymanagement.org/articles/alloc.html The Memory Management Reference, Beginner's Guide Allocation]

[[Category:Automatic memory management]]

{{comp-sci-stub}}