Explain (i) an advantage and (ii) a disadvantage that a global page replacement
ID: 3819901 • Letter: E
Question
Explain (i) an advantage and (ii) a disadvantage that a global page replacement algorithm has over a local page replacement algorithm. Consider a system that adjusts the degree of multiprogramming by monitoring the mean time between page faults (i.e. T_ pf) and the mean time to service a page fault (i.e. T_ fs). Describe the performance of the paging system in terms of the degree of multiprogramming when (i) T_ pf is greater than T_ fs, (ii) T_ pf is less than T_ fs and (iii) T_ pf is equal to T_ fs.Explanation / Answer
when the process incurs any page fault the global page replacement algorithm replaces the page from any address space where as local page replacement algorithm replaces the faulted page by its own partition or address space of the process that incurs page fault.thus we can can that global page replacemnet algorith is more flexible as compared to the local page replacement algorithm this can be one of the advantages of global page replacement over local page replacement. local page replacement is confined to the fixed partitioning where as global is free to select page from anywhere.
disadvantage can be in case of global pagereplacement we need to share the some global shared datastructure ,each process can not independently replace the page or cannot handle the page fault without contending the global share datastructure.
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.