Seminartopics.in

Computer Seminar Topics >> Dynamic Memory Allocation
 

 

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 is a way of distributing ownership of limited memory resources among many pieces of data and code. A dynamically allocated object remains allocated until it is deallocated explicitly, either by the programmer or by a garbage collector this is notably different from automatic and static memory allocation. It is said that such an object has dynamic lifetime.The problem of fulfilling an allocation request, which involves finding a block of unused memory of a certain size in the heap, is a difficult problem. A wide variety of solutions have been proposed, including:

1)Free lists
2)Paging
3)Buddy memory allocation

The main problem for most dynamic memory allocation algorithms is to avoid both internal and external fragmentation while keeping both allocation and deallocation efficient. Also, most algorithms in use have the problem that a large number of small allocations can cause wasted space due to collecting metadata; thus most programmers avoid this, sometimes by using a strategy called chunking.


|

|

|

|

|

|

|

|

|

|

|

|

|

|

|

 

 

You may also like this :

Brain Gate
Brain Fingerprinting
Brain Chips
Blue Brain
5 Pen PC Technology
4G Broadband
3D Television
3D password
3D Searching
4G Wireless Systems
64-Bit Computing
Access gateways
Adding Intelligence to Internet
Ambiophonics
Aspect-oriented programming (Aop)
Autonomic Computing
Bio-Molecular Computing
Blade Servers
Blu Ray Disc
Blue Eyes
Blue Gene
Blue Tooth
Bluetooth Based Smart Sensor Networks
Brain-Computer Interface
Buffer overflow attack : A potential problem and its Implications
C#
Cable Modems
Cellular Neural Network
CGI Programming
Clockless Chip

 

 
<< Back to Topics Page
Copyright © 2012 www.seminartopics.in      Contact us: seminar990@gmail.com