Compare contiguous-memory allocation with pure paging in the following aspects:

1. In support of dynamic memory allocation: most systems allow programs to allocate more memory to its address space during execution. Heap and stack are examples of such allocated memory.

2. External fragmentation and internal fragmentation.

3. Ability to share code across processes.

Posted Date: 4/2/2013 4:06:05 AM | Location : United States

Ask an Expert

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

Write discussion on Contiguous-memory allocation
Your posts are moderated

Write your message here..

Related Questions

Explain the tlsgetvalue (tlsindex) function, Explain the TlsGetValue (TLSin... Explain the TlsGetValue (TLSindex) Function Executing this function will return the thread local storage data associated with this thread. The pointer returned will be the one

Explain components of conflict phase of dispatch latency, Explain Component... Explain Components of conflict phase of dispatch latency The conflict phase of dispatch latency has two components 1. Preemption of any process running in the kernel. 2.

What are the various disk-scheduling algorithms, What are the various disk-... What are the various disk-scheduling algorithms? The several disk-scheduling algorithms are a. First Come First Served Scheduling b. Shortest Seek Time First Scheduling

Ipc, Explain in detail about ipc in linux Explain in detail about ipc in linux

Quantum settings denoted by q, Determining the time quantum for a job is a ... Determining the time quantum for a job is a critical task. Given the assumptions that the average switching time between processes is s, and the average amount of time an I/O bo

Software Support (Introducing Operating Systems), The questions ask List fo... The questions ask List four major functions of an OS. My answer: Function 1: Provide a user interface Function 2: Manage files Function 3: Manage hardware Function 4: Manage appli

CRITICAL SECTION, MDEFINE CRITICAL SECTION MDEFINE CRITICAL SECTION

Explain general graph directory, General graph directory The serious pr... General graph directory The serious problem with using an acyclic-graph structure is ensuring that there are no cycles. When we insert links to an existing tree-structured dire

How memory utilization factor shall be computed, How Memory utilization fac... How Memory utilization factor shall be computed  Memory utilization factor shall be defined as Memory in use/total memory connected

Structures for a file''s data, Q. Likewise some systems support many types ... Q. Likewise some systems support many types of structures for a file's data while others simply support a stream of bytes. What are the merits in addition to demerits? Answer: