Open Access   Article Go Back

Minimizing Page Fault Using Queueing Theory

S. Biswas1 , D.Sengupta 2 , R. Bhattacharjee3 , M. Handique4

Section:Research Paper, Product Type: Conference Paper
Volume-03 , Issue-01 , Page no. 97-101, Feb-2015

Online published on Feb 18, 2015

Copyright © S. Biswas, D.Sengupta, R. Bhattacharjee , M. Handique . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

View this paper at   Google Scholar | DPI Digital Library

XML View
PDF Download

How to Cite this Paper

  • IEEE Citation
  • MLA Citation
  • APA Citation
  • BibTex Citation
  • RIS Citation

IEEE Style Citation: S. Biswas, D.Sengupta, R. Bhattacharjee , M. Handique, “Minimizing Page Fault Using Queueing Theory,” International Journal of Computer Sciences and Engineering, Vol.03, Issue.01, pp.97-101, 2015.

MLA Style Citation: S. Biswas, D.Sengupta, R. Bhattacharjee , M. Handique "Minimizing Page Fault Using Queueing Theory." International Journal of Computer Sciences and Engineering 03.01 (2015): 97-101.

APA Style Citation: S. Biswas, D.Sengupta, R. Bhattacharjee , M. Handique, (2015). Minimizing Page Fault Using Queueing Theory. International Journal of Computer Sciences and Engineering, 03(01), 97-101.

BibTex Style Citation:
@article{Biswas_2015,
author = {S. Biswas, D.Sengupta, R. Bhattacharjee , M. Handique},
title = {Minimizing Page Fault Using Queueing Theory},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {2 2015},
volume = {03},
Issue = {01},
month = {2},
year = {2015},
issn = {2347-2693},
pages = {97-101},
url = {https://www.ijcseonline.org/full_spl_paper_view.php?paper_id=14},
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
UR - https://www.ijcseonline.org/full_spl_paper_view.php?paper_id=14
TI - Minimizing Page Fault Using Queueing Theory
T2 - International Journal of Computer Sciences and Engineering
AU - S. Biswas, D.Sengupta, R. Bhattacharjee , M. Handique
PY - 2015
DA - 2015/02/18
PB - IJCSE, Indore, INDIA
SP - 97-101
IS - 01
VL - 03
SN - 2347-2693
ER -

           

Abstract

In this paper we recommend a compelling approach to minimize page fault rate utilizing the hypothesis of waiting lines, i.e. Queuing Theory. The Queuing Theory has wide applications such as making business decision, hospital management, traffic regulation etc. but in this paper we are simply using it to reduce the number of page faults. Hence for the said purpose a comparative analysis is made in this paper between the typical performance from ordinary execution of page replacement algorithm and the performance after actualizing these conventional algorithms on the queuing models. Therefore the performance is measured on the basis of page fault rate and the result from this comparative dissection helps us determine conclusion on the effective way of page fault reduction.

Key-Words / Index Term

Memory Management, Page Fault, Queueing Theory, FIFO, LRU, OPT, M/M/1, M/M/s, M/D/1

References

[1] G. K. Vijay Srivastava, “A new approach to minimize page fault,” International Conferrence on Information and Computer Networks, vol. IPCSIT 27, p. 99, 2012.
[2] Wikipedia, “Page fault — wikipedia, the free encyclopedia,” 2014, [Online; accessed 21-December-2014]. [Online]. Available: http://en.wikipedia.org/w/index.php?title=Page fault&oldid=638911887
[3] ——, “Queueing theory — wikipedia, the free encyclopedia,” 2014,[Online; accessed 21-December-2014]. [Online]. Available: http://en.wikipedia.org/w/index.php?title=Queueing theory&oldid=635735110
[4] G. G. Abraham S., Peter B. Galvin, “Operating systems: Design and implementation,” vol. 8th Edition, pp. 365–376, 2010.
[5] R. Berry, “Queueing theory,” Senior Project Archive, p. 1, 2006. [Online]. Available: https://www.whitman.edu/mathematics/SeniorProjectArchive/2006/berryrm.pdf
[6] “The m/m/1 queueing system,” 2000, [Online; accessed 22-December-2014]. [Online]. Available: http://staff.um.edu.mt/jskl1/simweb/mm1.htm
[7] J. Y. Wang, “Operation reasearch ii,” pp. 17–9, Spring 2009.
[8] R. L. Fink, “M/d/1 waiting line,” 2000, [Online; accessed 22-December-2014]. [Online]. Available: http://bradley.bradley.edu/∼rf/wait-md1.htm