Coalescing (computer science)
- Coalescing (computer science)
-
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.
External links
http://www.memorymanagement.org/articles/alloc.html
Categories:
- Automatic memory management
Wikimedia Foundation.
2010.
Look at other dictionaries:
Coalescence (computer science) — 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 that application uses. Among other techniques, coalescing is used to reduce… … Wikipedia
Cybernetics — For other uses, see Cybernetics (disambiguation). Cybernetics is the interdisciplinary study of the structure of regulatory systems. Cybernetics is closely related to information theory, control theory and systems theory, at least in its first… … Wikipedia
ARPANET — For the producer, see Gerald Donald. ARPANET logical map, March 1977 The Advanced Research Projects Agency Network (ARPANET), was the world s first operational packet switching network and the core network of a set that came to compose the global … Wikipedia
Pointer (computing) — This article is about the programming data type. For the input interface (for example a computer mouse), see Pointing device. Pointer a pointing to the memory address associated with variable b. Note that in this particular diagram, the computing … Wikipedia
Number theory — A Lehmer sieve an analog computer once used for finding primes and solving simple diophantine equations. Number theory is a branch of pure mathematics devoted primarily to the study of the integers. Number theorists study prime numbers (the… … Wikipedia
Reference counting — In computer science, reference counting is a technique of storing the number of references, pointers, or handles to a resource such as an object or block of memory. It is typically used as a means of deallocating objects which are no longer… … Wikipedia
Virginia Polytechnic Institute and State University — Virginia Tech Virginia Tech Seal Motto Ut Prosim (Latin) Motto in English … Wikipedia
Empty string — In computer science and formal language theory, the empty string (or null string)[1] is the unique string of length zero. It is denoted with λ or sometimes Λ or ε. The empty string is distinct from a null reference in that in an object oriented… … Wikipedia
Null function — Not to be confused with identity function or empty function. In computer science, a null function (or null operator) is subroutine that returns no data values and leaves the program state unchanged. When it is part of the instruction set of… … Wikipedia
Giant impact hypothesis — Big splash redirects here. For other uses, see Big Splash (disambiguation). Artist s depiction of the giant impact that is hypothesized to have formed the Moon The giant impact hypothesis proposes that the Moon was created out of the debris left… … Wikipedia
