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
Explain the trda?
What is the difference between 32 bit and 64 bit os?
What is the difference between soft and hard links?
What is the difference between shared memory and message passing?
How do I scan a usb drive for errors?
How long does chkdsk last?
Do 64 bit applications use more memory?
What are the pros and cons of using circuit switching?
Explain compaction.
Can I upgrade my cpu from 32 to 64 bit?
Can you move program files from c to d?
What is the ie tab in google chrome?
Differentiate between swapping and paging.
Describe all the processes of the OS.
Is 64gb ram enough for gaming?