Which page replacement strategy incurse more execution overhead?

Answer 1

The page replacement strategy that incurs more execution overhead is typically the Least Recently Used (LRU) algorithm. LRU requires keeping track of the order of page accesses, which can involve additional data structures and frequent updates, leading to increased overhead compared to simpler strategies like FIFO (First-In-First-Out). The complexity of maintaining this order can result in slower performance, especially in systems with a high number of page faults.