Lect08 MemoryOrganization MMU
Lect08 MemoryOrganization MMU
Shobhanjana Kalita,
Dept. of CSE, Tezpur University
Effect of variable
sized partitioning
Paging
Both unequal fixed-size and variable-size partitions are inefficient in the use of
memory
Paging is the approach where –
memory is partitioned into relatively small, equal fixed-size chunks – called
frames
each program is also divided into small fixed-size chunks of some size – called
pages
A page of program occupies a single frame in memory
The entire set of pages of a program may or may not occupy continuous set frames
in memory
OS maintains a page table for each program, that shows the frame location for
each page of the process
Paging – Page table
• In the page table for each
process, frame location for
each page of the process is
given
• Logical address consists
of a page number and a
relative address within the
page (offset)
• Physical address consists
of a frame number and
relative address (offset)
Paging