An Improved Page Replacement Algorithm Using Block Retrieval of Pages

  • Authors

    • Govind Prasad Arya
    • Devendra Prasad
    • Sandeep Singh Rana
    2018-09-22
    https://doi.org/10.14419/ijet.v7i4.5.20004
  • Page replacement, Page fault, Page hit, Page miss, Hit ratio, Block reading

  • Abstract

    The computer programmer write programming codes of any length without keeping in mind the available primary memory. This is possible if we use the concept of virtual memory. As the name suggests, virtual memory is a concept of executing a programming code of any size even having a primary memory of smaller size than the size of program to be executed. The virtual memory can be implemented using the concept of paging. The operating system allocates a number of memory frames to each program while loading into the memory. The programming code is equally divided into pages of same size as frame size. The size of pages and memory frames are retained equal for the better utilization of the memory. During the execution of program, every process is allocated limited number of memory frames; hence there is  a need of page replacements. To overcome this limitation, a number of page replacement techniques had suggested by the researchers. In this paper, we have proposed an modified page replacement technique, which is based on the concept of block reading of pages from the secondary storage. The disc access is very slow as compared to the access from primary memory. Whenever there is a page fault, the required page is retrived from the secondary storage. The numerous page faults increase the execution time of process. In the proposed methodology, a number of pages, which is equal to the allotted memory frames, are read every time when there is a page fault instead of reading a single page at a time. If a block of pages has fetched from secondary storage, it will definitely increases the possibilities of page hit and as a result, it will improve the hit ratio for the processes.

     

     

  • References

    1. [1] Sanjay Kumar Panda and Saurav Kumar Bhoi, “An Effective Round Robin Algorithm using Min-Max Dispersion Measureâ€, International Journal on Computer Science and Engineering, 4(1), pp. 45-53, January 2012.

      [2] Theodore Johnson and Dennis Shasha. 2q: a lowover head high performance buffer management replacement algorithm In Proceedings of the Twentieth International Conference on. very Large Databases, pp.439-450, Santiago, Chile, 1994.

      [3] G. Glass and P. Cao, Adaptive Page Replacement Basedon Memory Reference Behavior, Proceedings of 1997ACM SIG- METRICS Conference, May 1997, pp. 115-126.

      [4] J. E. O’neil, P. E. O’neil and G. Weikum, “An optimality Proof of the LRU-K Page Replacement Algorithmâ€, Journal of the ACM, pp. 92-112, 1999.

      [5] Nimrod Megiddo and Dharmendra S. Modha ARC: ASelf-tuning, Low Overhead Replacement Cache USENIX File and Storage Technologies Conference(FAST), San Francisco, CA, 2003.

      [6] N. Meigiddo, and D. S. Modha, “ARC: A Self-Tuning, Low overhead Replacement Cacheâ€, IEEE Transactions on Computers, pp. 58-65, 2004.

      [7] S. Bansal, and D. Modha, “CAR: Clock with Adaptive Replacementâ€, FAST-’04 Proceedings of the 3rd USENIX Conference on File and Storage Technologies, pp. 187-200,2004.

      [8] Sorav Bansal and Dharmendra S. Modha CAR: Clockwith Adaptive Replacement FAST’04 - 3rd USENIX Conference on File and Storage Technologies, 2004.

      [9] S. Jiang, and X. Zhang, “LIRS: An Efficient Policy to improve Buffer Cache Performanceâ€, IEEE Transactions on Computers, pp. 939-952, 2005.

      [10] Song Jiang, Feng Chen and Xiaodong Zhang, CLOCK Pro: An Effective Improvement of the CLOCK Replacement, USENIX Annual Technical Conference, 2005.

      [11] Song Jiang and Xiaodong Zhang, Token-ordered LRU: an effective page replacement policy and its implementation in Linux systems, Performance Evaluation 60 5–29, 2005.

      [12] S. Jiang, X. Zhang, and F. Chen, “CLOCK-Pro: An Effective Improvement of the CLOCK Replacementâ€, ATEC ’05 Proceedings of the annual conference on USENIX Anuual Technical Conference, pp. 35, 2005.

      [13] Kaveh Samiee, â€WRP: Weighting Replacement Policy to Improve Cache Performanceâ€, International Journal of Hybrid Information Technology,Vol.2,No.2, April, 2009.

      [14] A. Janapsatya, A. Ignjatovic, J. Peddersen and S. Parameswaran, “Dueling CLOCK: Adaptive cache replacement policy based on the CLOCK algorithmâ€, Design, Automation and Test in Europe Conference and Exhibition, pp. 920-925, 2010.

      [15] Abraham Silberschatz, Peter B. Galvin and Greg Gagne, Operating System Concepts (UK: Wiley, 2010).

      [16] Performance analysis of LRU page replacement algorithm. International Journal of Engineering Research and Applications (IJERA) Vol. 3. Issue 1. pp.2070-2076 Klues K. Rhoden B. Zhu Y. Waterman A. Brewer E. (2010).

      [17] A. S. Sumant, and P. M. Chawan, “Virtual Memory Management Techniques in 2.6 Linux kernel and challengesâ€, IASCIT International Journal of Engineering and Technology, pp. 157-160, 2010.

      [18] A. Janapsatya, A. Ignjatovic, J. Peddersen and S.Parameswaran, “Dueling CLOCK: daptive cache replacement policy based on the CLOCK algorithmâ€, Design, Automation and Test in Europe Conference and Exhibition,pp. 920-925, 2010.

      [19] Amit S. Chavan, Kartik R. Nayak, Keval D. Vora, Manish D.Purohit and Pramila M. Chawan, " A Comparison of PageReplacement Algorithms", IACSIT International Journal ofEngineering and Technology, Vol.3, No.2, April 2011 pp.171-174.

      [20] Ali Khosrozadeh, SanazPashmforoush, Abolfazl Akbari, Maryam Bagheri, NedaBeikmahdavi. , "Presenting a Novel Page Replacement Algorithm Based on LRUâ€, Journal of Basic and Applied Scientific Research, 2(10)10377-10383, 2012.

      [21] Implementation of a page replacement algorithm with temporal filtering for Linux, vashundra rathod, pramia chavan, journal of engineering & applied sciences volume 2, no. 6, june 2013.

      [22] Mr.C.C.Kavar, Mr. S.S.Parmar “Performance Analysis of LRU Page Replacement Algorithm with Reference to different Data Structure" International Journal of Engineering Research and Applications (IJERA) Vol. 3, Issue 1, January –February2013, pp.2070-2076.

      [23] A comparison of page replacement algorithm. IACSIT International Journal of Engineering and Technology. Vol. 3. No. 2 Kavar C. C. Parmar S. S. (2013).

      [24] Pooja khulbe, Shruti pant, “HYBRID LRU Page Replacement Algorithm†, International Journal of Computer Applications (0975 – 8887) Volume 91 – No.16, April 2014.

      [25] Page Replacement, S. Jananee, ISSN 2348-1196 (print) International Journal of Computer Science and Information Technology Research ISSN 2348-120X (online) Vol. 2, Issue 3, pp: (90-99), Month: July - September 2014.

      [26] Jisha.P. Abraham, Sheena Mathew " A novel approach to improve processor performance with page replacement techniques" Proceedings of the International Conference on Information and Communication Technologies, ICICT 2014,3-5 December 2014.

      [27] Hasan M H Owda ,Munam Ali Shah, AbuelgasimIbrahimMusa, ManzoorIlahiTamimy " A Comparison of Page Replacement Algorithms in Linux Memory Management" International Journal of Computer and Information Technology (ISSN: 2279 – 0764) Volume 03 – Issue 03, May2014 pp. 565-569,2015.

      [28] Anvita Saxena, A Study of Page Replacement Algorithms, International Journal of Engineering Research and General Science, 2(4), 2014, 385-388,2015.

      [29] Manisha Koranga and Nisha Koranga, Analysis on Page Replacement Algorithms with Variable Number of Frames, International Journal Of Advanced Research in Computer Science and Software Engineering, 4(7), 2014, 403-411,2015.

      [30] Genta Rexha, Erand Elmazi and Igli Tafa, A Comparison of Three Page Replacement Algorithms: FIFO, LRU and Optimal, Academic Journal of Interdisciplinary Studies, 4(2), 2015, 56-62, 2016.

      [31] Mahesh Kumar M R and Renuka Rajendra B, AN INPUT ENHANCEMENT TECHNIQUE TO MAXIMIZE THE PERFORMANCE OF PAGE REPLACEMENT ALGORITHMS, International Journal of Research in Engineering and Technology, 4(6), 2015, 302-307,2016.

      [32] Shreyank Gowda, “Count based page replacement technique†Proceedings of The IIER International Conference, Los Angeles, USA, 7th April 2016, ISBN: 978-93-85973-57-4, 2016

  • Downloads

  • How to Cite

    Prasad Arya, G., Prasad, D., & Singh Rana, S. (2018). An Improved Page Replacement Algorithm Using Block Retrieval of Pages. International Journal of Engineering & Technology, 7(4.5), 32-35. https://doi.org/10.14419/ijet.v7i4.5.20004

    Received date: 2018-09-21

    Accepted date: 2018-09-21

    Published date: 2018-09-22