This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Design, Implementation, and Performance Evaluation of a Detection-Based Adaptive Block Replacement Scheme
July 2002 (vol. 51 no. 7)
pp. 793-800

A new buffer replacement scheme, called DEAR (DEtection-based Adaptive Replacement), is presented for effective caching of disk blocks in the operating system. The proposed DEAR scheme automatically detects block reference patterns of applications and applies different replacement policies to different applications depending on the detected reference pattern. The detection is made by a periodic process and is based on the relationship between block attribute values, such as backward distance and frequency gathered in a period, and the forward distance observed in the next period. This paper also describes an implementation and performance measurement of the DEAR scheme in FreeBSD. The results from performance measurements of several real applications show that, compared with the LRU scheme, the proposed scheme reduces the number of disk I/Os by up to 51 percent (with an average of 23 percent) and the response time by up to 35 percent (with an average of 12 percent) in the case of single application executions. For multiple application executions, the results show that the proposed scheme reduces the number of disk I/Os by up to 20 percent (with an average of 12 percent) and the overall response time by up to 18 percent (with an average of 8 percent).

[1] M.J. Bach, The Design of the UNIX Operating System. Prentice Hall, 1990.
[2] J.T. Robinson and M.V. Devarakonda, "Data Cache Management Using Frequency-Based Replacement," Proc. 1990 ACM SIGMETRICS Conf. Measurement&Modeling of Computer Systems, May 1990.
[3] E.J. O'Neil, P.E. O'Neil, and G. Weikum, "The LRU-k Page Replacement Algorithm for Database Disk Buffering," Proc. 1993 ACM Sigmod Int'l Conf. Management of Data, ACM Press, New York, 1993, pp. 297-306.
[4] D. Lee, J. Choi, J.-H. Kim, S. H. Noh, S.L. Min, Y. Cho, and C.S. Kim, “On the Existence of a Spectrum of Policies that Subsumes the Least Recently Used (LRU) and Least Frequently Used (LFU) Policies,” Proc. 1999 ACM SIGMETRICS Conf., pp. 134-143, 1999.
[5] V. Phalke and B. Gopinath, "An Inter-Reference Gap Model for Temporal Locality in Program Behavior," Proc. ACM SIGMETRICS 1995 Conf. Measurement&Modeling of Computer Systems, May 1995.
[6] A. Dan and D. Sitaram, “A Generalized Interval Caching Policy for Mixed Interactive and Long Video Workloads,” Multimedia Computing and Networking, Jan. 1996.
[7] C. Faloutsos, R. Ng, and T. Sellis, “Flexible and Adaptable Buffer Management Techniques for Database Management Systems,” IEEE Trans. Computers, vol. 44, no. 4, pp. 546-560, Apr. 1995.
[8] P. Cao, E.W. Felten, and K. Li, “Application-Controlled File Caching Policies,” Proc. USENIX Summer 1994 Technical Conf., pp. 171-182, 1994.
[9] R.H. Patterson, G. Gibson, E. Ginting, D. Stodolsky, and J. Zelenka, "Informed Prefetching and Caching," Proc. 15th ACM Symp. Operating Systems Principles, pp. 79-95, Dec. 1995.
[10] G. Glass and P. Cao, “Adaptive Page Replacement Based on Memory Reference Behavior,” Proc. 1997 ACM SIGMETRICS Conf., pp. 115-126, 1997
[11] B.K. Pasquale and G.C. Polyzos, “A Static Analysis of I/O Characteristics of Scientific Applications in a Production Workload,” Proc. Supercomputing '93, pp. 388–397, 1993.
[12] A. Dan, P.S. Yu, and J. -Y. Chung, “Characterization of Database Access Pattern for Analytic Prediction of Buffer Hit Probability,” Very Large Database (VLDB) J., vol. 4, pp. 127-154, Jan. 1995.
[13] M. Baker, J.H. Hartman, M.D. Kupfer, K.W. Shirriff, and J. Ousterhout, "Measurements of a Distributed File System," Proc. 13th ACM Symp. Operating Systems Principles, pp. 198-211, Oct. 1991.
[14] P.J. Shenoy, P. Goyal, S.S. Rao, and H.M. Vin, “Design and Implementation of Symphony: An Integrated Multimedia File System,” Proc. ACM/SPIE Multimedia Computing and Networking (MMCN) Conf., pp. 124-138, 1998.
[15] E.G. Coffman and P.J. Denning,Operating Systems Theory, Prentice-Hall Inc., Englewood Cliffs, N.J., 1973.
[16] J. Choi, S.H. Noh, S.L. Min, and Y. Cho, “Towards Application/File-Level Characterization of Block References: A Case for Fine-Grained Buffer Management,” Proc. 2000 ACM SIGMETRICS Conf., pp. 286-295, 2000.
[17] U. Vahalia, UNIX Internals—The New Frontiers. Prentice Hall, 1996.
[18] J. Choi, S.H. Noh, S.L. Min, and Y. Cho, “Design, Implementation, and Performance Evaluation of a Detection-Based Adaptive Block Replacement Scheme,” technical report, School of Computer Science and Eng., Seoul Nat'l Univ.,http://archi.snu.ac.kr/symindear-tr.ps. 2001.

Index Terms:
Buffer cache, FreeBSD, reference pattern, replacement policy, performance evaluation.
Citation:
Jongmoo Choi, Sam H. Noh, Sang Lyul Min, Eun-Yong Ha, Yookun Cho, "Design, Implementation, and Performance Evaluation of a Detection-Based Adaptive Block Replacement Scheme," IEEE Transactions on Computers, vol. 51, no. 7, pp. 793-800, July 2002, doi:10.1109/TC.2002.1017699
Usage of this product signifies your acceptance of the Terms of Use.