MEMORY MANAGEMENT

• Objective
• To provide a detailed description of various ways of organizing
memory hardware.
• To discuss various memory-management techniques, including paging
and segmentation.
• To provide a detailed description of the Intel Pentium, which supports
both pure segmentation and segmentation with paging.
 Memory Management
• Memory is central to the operation of a modern computer system.
• Memory is a large array of words or bytes, each with its own address.
 Memory Management
• The binding of instructions and data to memory addresses can be
done at any step along the way:
• Compile time: If it is known at compile time where the process will
reside in memory, then absolute code can be generated.
• Load time: If it is not known at compile time where the process will
reside in memory, then the compiler must generate re-locatable
code.
• Execution time: If the process can be moved during its execution
from one memory segment to another, then binding must be delayed
until run time.
 Dynamic Loading
• Better memory-space utilization can be done by dynamic loading.
With dynamic loading, a routine is not loaded until it is called.
• The main program is loaded into memory and is executed.
• The advantage of dynamic loading is that an unused routine is never
loaded.
Dynamic Linking
• Linking is the process of collecting and combining various pieces of
code and data into a single file that can be loaded into memory and
executed.
• The concept of dynamic linking is similar to that of dynamic loading.
Rather than loading being postponed until execution time, linking is
postponed.
Logical versus Physical Address Space