Scribd
Upload
83 views5 pages

Allocation of Frames Name

The document discusses global versus local allocation for replacing pages in memory when a new page needs to be loaded from secondary storage. Global replacement allows any process to use any free frame, which maximizes throughput but does not allow processes to control their own page fault ratio. Local replacement restricts each process to only use frames allocated to it, which allows better control of page faults but could impact higher priority processes if low priority processes do not free frames.

Uploaded by

srushti hulyalad
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
83 views5 pages

Allocation of Frames Name

The document discusses global versus local allocation for replacing pages in memory when a new page needs to be loaded from secondary storage. Global replacement allows any process to use any free frame, which maximizes throughput but does not allow processes to control their own page fault ratio. Local replacement restricts each process to only use frames allocated to it, which allows better control of page faults but could impact higher priority processes if low priority processes do not free frames.

Uploaded by

srushti hulyalad
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

ALLOCATION OF FRAMES

S R U S H T I S H U LYA L AD

4 GM 2 1 AI0 5 2
GLOBAL VERSUS LOCAL ALLOCATION

Replacement:
 It means whenever the CPU needs to execute the page it cheeks whether that page is present in
the main memory or not if the page is present in the main memory then CPU executes that page.
Suppose the page is not present then it is called as page fault.
If page fault occurs then operating system loads that page from secondary memory to the primary
memory.
If the main memory is completely full, in order to store the new page from secondary memory we
use Global replacement allocation or Local replacement allocation.
GLOBAL REPLACEMENT ALLOCATION:

When a process needs a page which is not in the memory, it can bring in the new page and
allocate it to a frame from the set of all frames, even if that frame is currently allocated to some
other process that is, one process can take a frame from another.
Advantage:
Does not hinder the performance of processes and hence results in greater system throughput.
Disadvantage:
The page fault ratio of a process can not be controlled by the process itself.
LOCAL REPLACEMENT ALLOCATION:

•When a process needs a page which is not in the memory, it can bring the new page and allocate it
to a frame from its own set of allocated frames only.
•Advantage:
•The pages in memory for a particular process and the page fault ratio is affected by the paging
behavior of only that process.
•Disadvantage:
• A low priority process may hinder a high priority process by not making its frames available to
the high priority process.

You might also like