A Comparison of Three Page Replacement Algorithms: FIFO, LRU and Optimal

Genta Rexha, Erand Elmazi and Igli Tafa

Academic Journal of Interdisciplinary Studies, 2015, vol. 4

Abstract: The speed at which the process will be executed doesn’t depend only on the implementation of the architecture of the computer, the frequency of the clock, but also regard to the politics the algorithm follows and the data structure the algorithm is implemented. The usage of efficient page replacement algorithms, that choose which page in memory will be swapped if a page fault, are required to implement in a virtual memory system. A lot of algorithms are developed during the years for page replacement. Each algorithm has the aim to have less number of page faults. With less page faults we have an improvement in performance and the speed of the process is increased. In this paper three algorithms (FIFO, LRU and Optimal page replacement algorithms) will be tested and will be shown the one that has the best performance.

Date: 2015
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.richtmann.org/journal/index.php/ajis/article/view/7405 (text/html)
https://www.richtmann.org/journal/index.php/ajis/article/view/7405/7089 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:bjz:ajisjr:1221

DOI: 10.5901/ajis.2015.v4n2s2p56

Access Statistics for this article

More articles in Academic Journal of Interdisciplinary Studies from Richtmann Publishing Ltd
Bibliographic data for series maintained by Richtmann Publishing Ltd ().