Question

After reading each problem provide the answer using at least two sources such as an academic journal or a book chapter (not your text book). While providing answer, you must use information from your sources to answer the question. At the end of each answer, provide a conclusion. Put all your answers in one Word file and submit below.

Q. Most systems allow a program to allocate more memory to its address space during execution. Allocation of data in the heap segments of programs is and example of such allocated memory. What is required to support dynamic memor allocation in the following schemes?

a. Contiguous memory allocation

b. Pure segmentation

c. Pure paging

Answer 1

Contiguous-memory allocation:

• This schema requires relocation of the entire program,
• Explanation: Since there is no enough required space for the program to grow beyond it's allocated memory space, it may require relocation of entire program.

Pure segmentation:

• This schema requires relocation of the segment that needs to be extended,
• Explanation: Since there is no enough required space for the segment to grow beyond it's allocated memory space, it may require relocation of segment.

Pure paging:

• This schema requires incremental allocation of new pages
• Explanation: It is possible in this scheme without requiring relocation of the program's address space.