Coalescing (computer science): Difference between revisions

Revision as of 00:19, 4 December 2011

Latest revision as of 19:49, 2 October 2023

(26 intermediate revisions by 19 users not shown)

Line 1:

{{Multiple issues|

{{afd-mergeto|Memory management|Coalescing (computer science)|04 December 2011}}

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

{{Update|date=March 2017 | inaccurate=yes}}

}}

{{Use dmy dates|date=March 2023}}

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

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.

{{Orphan|date=February 2009}}

{{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.

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]].

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==

Line 14 ⟶ 22:

[[Category:Automatic memory management]]

{{comp-sci-stub}}