Q. Explain the various memory allocation strategies.                                                          

Ans.

Memory Allocation Strategies are given as follows

If it is not required to move blocks of allocated storage from one area of memory to the other area of memory,  it may be possible to relocate memory blocks that have been freed dynamically. Each time a request is made for storage or saving, the free area large enough to accommodate the size needed must be allocated. The most obvious methods for keeping track of the free blocks is to make use of linear linked list. Each free block contains a field comprising the size of the blocks and a field containing a pointer to be next free block. A global P for free block points to the 1st free block on this list. There are several methods or techniques of selecting the free block to use at when requesting storage.

The First - Fit Method:-       The free list is traversed sequentially or in order  to find the 1st free block whose size is greater than or equal to the amount requested. Once the block is found it is removed from the list (if it is greater than the amount requested). The 1st of these portions remains on the list and the 2nd is allocated.

The Best - Fit Method:- This method obtains the smallest free block whose size is greater than or equal to obtain such a block by traversing the full free list follows.
The Worst Fit method:- In this the system every time allocate a portion of the largest free block in memory. The philosophy at the back of this method is that by using small number of a very big block repeatedly to satisfy the majority of requested, many moderately sized blocks would be left un-fragmented.

The Free Storage List

 

The First fit method is as follows

 

Best Fit method is as follows

 

 Worst Fit Strategy is as follows

Posted Date: 7/12/2012 8:56:27 AM | Location : United States

Ask an Expert

Related Discussions:- Memory allocation strategies, Assignment Help, Ask Question on Memory allocation strategies, Get Answer, Expert's Help, Memory allocation strategies Discussions

Write discussion on Memory allocation strategies
Your posts are moderated

Write your message here..

Related Questions

Present the algorithm of binary search. , B i n a ry Search Alg... B i n a ry Search Algorithm is given as follows 1. if (low > high) 2.     return (-1) 3. mid = (low +high)/2; 4. if ( X = = a [mid]) 5.      return (mid); 6.

Explain the term - branching, Explain the term - Branching There are t... Explain the term - Branching There are two common ways of branching: case of ..... otherwise ...... endcase  if ..... then ..... else ..... endif   case of

What is an unreachable code assertion, What is an unreachable code assertio... What is an unreachable code assertion An unreachable code assertion can be placed at the default case; if it's every executed, then program is in an erroneous state. A loop in

What are the languages which support assertions, What are the languages whi... What are the languages which support assertions Languages which support assertions often provide different levels of support. For instance, Java has an assert statement which t

Computer arhitecture, The controversy of RISC versus CISC never ends. Suppo... The controversy of RISC versus CISC never ends. Suppose that you represent an advocate for the RISC approach; write at least a one-page critic of the CISC approach showing its disa

Expression trees, What are the expression trees? Represent the below writte... What are the expression trees? Represent the below written expression using a tree. Give a relevant comment on the result that you get when this tree is traversed in Preorder,

Declaring a two dimensional array, Declaring a two dimensional array   A... Declaring a two dimensional array   A two dimensional array is declared same to the way we declare a one-dimensional array except that we state the number of elements in both di

Linear array - numerical, Q. A linear array A is given with lower bound as ... Q. A linear array A is given with lower bound as 1. If address of A[25] is 375 and A[30] is 390, then find address of A[16].

Sorting, compare and contrast the bubble sort,quick sort,merge sort and rad... compare and contrast the bubble sort,quick sort,merge sort and radix sort

Small program on Algorithms , Objective The goal of this project is to ext... Objective The goal of this project is to extend and implement an algorithm presented in the course and to apply notions introduced by the course to this program/algorithm. The ass