LMRU: An Efficient Buffer Management Scheme for Large Sequential and Looping Reference Pattern Applications

Jun Young Cho, Gyeong Hun Kim, Hong Kyu Kang, Myong Soon Park, Jin Young Choi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

On the way of implementing MRU, for sequential and looping applications, on Linux we observed that MRU shows lower response time by up to 100% compared to LRU. Indirect blocks, which are used in the file structure of Unix family operating systems for large-size file, are the main reason of decreasing performance. Indirect blocks are fetched but immediately replaced by MRU replacement policy, even those will be soon and frequently needed again. Based on this observation, we propose a buffer replacement policy named 'LMRU'. LMRU. maintains frequently-used blocks such as indirect blocks in the cache, even it manages all other blocks on buffer cache with MRU. We have designed and implemented it in a Linux kernel. LMRU improves the response time by up to 70% compared to LRU and 163% compared to MRU.

Original languageEnglish
Title of host publicationProceedings of the Joint Conference on Information Sciences
EditorsP.P. Wang, P.P. Wang
Pages504-507
Number of pages4
Volume5
Edition1
Publication statusPublished - 2000 Dec 1
EventProceedings of the Fifth Joint Conference on Information Sciences, JCIS 2000 - Atlantic City, NJ, United States
Duration: 2000 Feb 272000 Mar 3

Other

OtherProceedings of the Fifth Joint Conference on Information Sciences, JCIS 2000
CountryUnited States
CityAtlantic City, NJ
Period00/2/2700/3/3

    Fingerprint

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Cho, J. Y., Kim, G. H., Kang, H. K., Park, M. S., & Choi, J. Y. (2000). LMRU: An Efficient Buffer Management Scheme for Large Sequential and Looping Reference Pattern Applications. In P. P. Wang, & P. P. Wang (Eds.), Proceedings of the Joint Conference on Information Sciences (1 ed., Vol. 5, pp. 504-507)