A Comparison of Page Replacement Algorithms in Linux Memory Management

The speed and competence of a processor depends on the time it takes in handling instructions. The speed of a processing device not only depends on its architectural features like chipset, transport buses and cache but also on the memory mapping scheme. A virtual memory system needs a page replacement algorithm to decide which pages should be evicted first as of the memory in case if a page fault occurs. Many page replacement algorithms have been designed and implemented where each algorithm attempts to reduce the page fault time while endure least amount of overhead.

Provided by: International Journal of Computer and Information Technology (IJCIT) Topic: Data Centers Date Added: May 2014 Format: PDF

Find By Topic