Dynamic memory allocation
From Wikipedia, the free encyclopedia
In computer science, dynamic memory allocation is the allocation of memory storage for use in a computer program during the runtime of that program. It can be seen also as a way of distributing ownership of limited memory resources among many pieces of data and code.
Dynamically allocated memory exists until it is released either explicitly by the programmer, exiting a block, or by the garbage collector. This is in contrast to static memory allocation, which has a fixed duration. It is said that an object so allocated has a dynamic lifetime.
Contents |
[edit] Details
- The task of fulfilling allocation request
- Finding a block of unused memory of sufficient size
- Problems during fulfilling allocation request
- Internal and external fragmentation.
- Reduction needs special care, thus making implementation more complex (see algorithm efficiency).
- Allocator's metadata can inflate the size of (individually) small allocations;
- Chunking attempts to reduce this effect.
- Internal and external fragmentation.
Usually, memory is allocated from a large pool of unused memory area called the heap (also called the free store). Since the precise location of the allocation is not known in advance, the memory is accessed indirectly, usually via a reference. The precise algorithm used to organize the memory area and allocate and deallocate chunks is hidden behind an abstract interface and may use any of the methods described below.
[edit] Implementations
[edit] Fixed-size-blocks allocation
Fixed-size-blocks allocation, also called memory pool allocation, uses a free list of fixed-size blocks of memory (often all of the same size). This works well for simple embedded systems.
[edit] Buddy blocks
In this system, memory is allocated from a large block in memory that is a power of two in size. If the block is more than twice as large as desired, it is broken in two. One of the halves is selected, and the process repeats (checking the size again and splitting if needed) until the block is just large enough.
All the blocks of a particular size are kept in a sorted linked list or tree. When a block is freed, it is compared to its buddy. If they are both free, they are combined and placed in the next-largest size buddy-block list. (When a block is allocated, the allocator will start with the smallest sufficiently large block avoiding needlessly breaking blocks)
[edit] See also
- Automatic memory allocation
- Hazard pointer
- Heap overflow
- Hoard memory allocator
malloc- Memory pool
mmap- obstack
- Slab allocation
- Stack-based memory allocation
- new (C++)
- Java Virtual Machine heap
[edit] References
- Donald Knuth. Fundamental Algorithms, Third Edition. Addison-Wesley, 1997. ISBN 0-201-89683-4. Section 2.5: Dynamic Storage Allocation, pp.435–456.
- Herbert Glarner's visualized Dynamic Storage Allocation, describing efficient techniques
- Simple Memory Allocation Algorithms on OSDEV Community
- Wilson, P.R.; Johnstone, M.S.; Neely, M.; Boles, D. (1995). "Dynamic Storage Allocation: A Survey and Critical Review". Memory Management: International Workshop, Iwmm'95, Kinross, Uk, September 27-29, 1995: Proceedings. http://books.google.com/books?hl=en&lr=&ie=UTF-8&id=m0yZN2bA3TcC&oi=fnd&pg=PA1&dq=paul+wilson&ots=H28axwHr6U&sig=cCCwN72PZFqLtnjRWhIvpbXbc0c. Retrieved on 2008-01-06.
- Berger, E.D.; Zorn, B.G.; McKinley, K.S. (2001). "Composing high-performance memory allocators". ACM SIGPLAN Notices 36 (5): 114–124. doi:. http://portal.acm.org/citation.cfm?id=381694.378821.
- Berger, E.D.; Zorn, B.G.; McKinley, K.S. (2002). "Reconsidering custom memory allocation". Proceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications: 1-12, ACM Press New York, NY, USA.
