What are local and global page replacements?
Answer Posted / hari iitkgp
Replacement algorithm can be local or global : when a
process incurs a page fault, local page replacement
algorithm selects for replacement some page that belongs to
that process (or a group of processes sharing memory
partition), whereas global replacement algorithm is free to
select any page in memory.
Local page replacement assumes some form of memory
partitioning that determines how many pages are to be
assigned to a given process of a group of processes. Most
popular forms of partitioning are fixed partitioning and
balance set algorithm based on the working set model.
Advantage of local page replacement is its scalability: each
process can handle its page faults independently without
contending for some shared global data structure.
| Is This Answer Correct ? | 21 Yes | 3 No |
Post New Answer View All Answers
Does chkdsk work for ssd?
What is the most used operating system in the world?
Explain the Functionality of Operating System?
What are the deadlock avoidance schemes?
How long should a chkdsk r take?
What is the cause of thrashing?
Can my processor run 64 bit?
How do I enable macros?
How long does chkdsk take to run?
Under what circumstances do page faults occur?
What is run level 1?
Can a laptop have 32gb of ram?
What are the different ram standards/versions?
How much ram can a 64 bit os use?
Differentiate between the user mode and monitor mode.