What are local and global page replacements?
- 4 Answers
- 33543 Views
- TCS, Wipro, I also Faced
- E-Mail Answers
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
What is belady's anomaly?
What is the maximum ram for a 64 bit operating system?
What is the use of chkdsk f?
Which os is best for coding?
What factors determine whether a detection-algorithm must be utilized in a deadlock avoidance system?
What is bounded-buffer problem?
How do I clean up program files?
How do I copy a path to a shared drive?
How much ram can you have on a 64 bit system?
What is Throughput, Turnaround time, waiting time and Response time?
What is the cause of thrashing?
Can I move programs from c drive to d?
What are overlays?
How do I get to the root directory?
How do I remove prime os from my pc?
