Difference between Static Allocation and Heap Allocation
Static Allocation: Static allocation is an allocation procedure that is used for the allocation of all the data objects at compile time. In this type of allocation, allocation of data objects is done at compile time only. As in static allocation, the compiler decides the extent of storage which cannot be changed with time, hence it is easy for the compiler to know the addresses of these data objects in the activation records at a later stage. Static allocation is implemented in FORTRAN.
Heap Allocation: Heap allocation is an allocation procedure in which the heap is used to manage the allocation of memory. Heap helps in managing dynamic memory allocation. In heap allocation, the creation of dynamic data objects and data structures is also possible as same as stack allocation. Heap allocation overcomes the limitation of stack allocation. It is possible to retain the value of variables even after the activation record in heap allocation strategy which is not possible in stack allocation. It maintains a linked list for the free blocks and reuses the deallocated space using the best fit.
The difference between Static Allocation and Heap Allocation is as follows:
|S.No.||Static Allocation||Heap Allocation|
|1.||Static allocation allocates memory on the basis of the size of data objects.||Heap allocation makes use of heap for managing the allocation of memory at run time.|
|2.||In static allocation, there is no possibility of the creation of dynamic data structures and objects.||In heap allocation, dynamic data structures and objects are created.|
|3.||In static allocation, the names of the data objects are fixed with storage for addressing.||Heap allocation allocates a contiguous block of memory to data objects.|
|4.||Static allocation is a simple, but not efficient memory management technique.||Heap allocation does memory management inefficiently way.|
|5.||The static allocation strategy is faster in accessing data as compared to heap allocation.||While heap allocation is slow in accessing as there is a chance of creation of holes in reusing the free space.|
|6.||Static allocation is inexpensive, it is easy to implement.||While heap allocation is comparatively expensive.|
|7.||Static memory allocation is preferred in an array.`||Heap memory allocation is preferred in the linked list.|