Minimizing Page Fault Using Queueing Theory

Authors

  • S Biswas Department of Information Technology, School of Technology Assam University, Silchar-788011, India
  • D Sengupta Department of Information Technology, School of Technology Assam University, Silchar-788011, India
  • R Bhattacharjee Department of Information Technology, School of Technology Assam University, Silchar-788011, India
  • M Handique Department of Information Technology, School of Technology Assam University, Silchar-788011, India

Keywords:

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

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.

References

G. K. Vijay Srivastava, “A new approach to minimize page fault,” International Conferrence on Information and Computer Networks, vol. IPCSIT 27, p. 99, 2012.

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

——, “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

G. G. Abraham S., Peter B. Galvin, “Operating systems: Design and implementation,” vol. 8th Edition, pp. 365–376, 2010.

R. Berry, “Queueing theory,” Senior Project Archive, p. 1, 2006. [Online]. Available: https://www.whitman.edu/mathematics/SeniorProjectArchive/2006/berryrm.pdf

“The m/m/1 queueing system,” 2000, [Online; accessed 22-December-2014]. [Online]. Available: http://staff.um.edu.mt/jskl1/simweb/mm1.htm

J. Y. Wang, “Operation reasearch ii,” pp. 17–9, Spring 2009.

R. L. Fink, “M/d/1 waiting line,” 2000, [Online; accessed 22-December-2014]. [Online]. Available: http://bradley.bradley.edu/∼rf/wait-md1.htm

Downloads

Published

2015-02-28

How to Cite

[1]
S. Biswas, D. Sengupta, R. Bhattacharjee, and M. Handique, “Minimizing Page Fault Using Queueing Theory”, Int. J. Comp. Sci. Eng., vol. 3, no. 1, pp. 97–101, Feb. 2015.

Issue

Vol. 3 No. 1 (2015): IJCSE Special Issue February Edition

Section

Research Article

License

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.