COMPUTER ARCHITECTURE
MEMORY SYSTEMS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Random
|
|
|
LFU
|
|
|
LRU
|
|
|
FIFO
|
Detailed explanation-1: -LRU is the most widely used algorithm because it provides fewer page faults than the other methods.
Detailed explanation-2: -Sleator and Tarjan proved that the competitive ratio of LRU and FIFO is k. In practice, however, LRU is known to perform much better than FIFO. It is believed that the superiority of LRU can be attributed to locality of reference exhibited in request sequences.
Detailed explanation-3: -LRU is, in general, more efficient, because there are generally memory items that are added once and never used again, and there are items that are added and used frequently. LRU is much more likely to keep the frequently-used items in memory.
Detailed explanation-4: -Least Recently Used (LRU) algorithm is a page replacement technique used for memory management. According to this method, the page which is least recently used is replaced. Therefore, in memory, any page that has been unused for a longer period of time than the others is replaced.