Browse > Article

Performance Evaluation of Disk Replacement Algorithms in a Shared Cluster  

Cho, Haeng-Rae (영남대학교 전자정보공학부)
Publication Information
Journal of KIISE:Databases / v.35, no.6, 2008 , pp. 469-480 More about this Journal
Abstract
A shared disk (SD) cluster couples multiple nodes for high performance transaction processing, and all the coupled nodes share a common database at the disk level. To reduce the number of disk accesses, each node caches database pages in its memory buffer. Since a particular page may be cached simultaneously in different nodes, cache consistency should be maintained to ensure that nodes can always access the most recent version of database pages. Most cache consistency schemes proposed in the SD cluster adopted LRU as a buffer replacement algorithm. In this paper, we first present four buffer replacement algorithms that consider the characteristics of the SD cluster. Then we compare the performance of the buffer replacement algorithms. We perform the experiments on a variety of cluster configurations and database workloads. The experiment results show that the proposed algorithms achieve performance improvement up to 5 times of LRU algorithm.
Keywords
transaction processing; cluster; shared disks; buffer replacement; cache consistency;
Citations & Related Records
연도 인용수 순위
  • Reference
1 A. Dan and P. Yu, "Performance Analysis of Buffer Coherency Policies in a Multisystem Data Sharing Environment," IEEE Trans. Parallel and Distributed Syst., Vol.4, No.5, pp.289-305, 1993   DOI   ScienceOn
2 K. Ohn and H. Cho, "Path Conscious Caching of B+ Tree Indexes in a Shared Disks Cluster," J. Parallel and Distributed Computing, Vol.67, No.3, pp.286-301, 2007   DOI   ScienceOn
3 H. Schwetman, CSIM User's Guide for use with CSIM Revision 18, MCC., 1996
4 M. Vilayannur, A. Sivasubramaniam, M. Kandemir, R. Thakur, and R. Ross, "Discretionary Caching for I/O on Clusters," Cluster Computing, Vol.9, No.1, pp.29-44, 2006   DOI   ScienceOn
5 C. Goh, Y. Shu, Z. Huang and B. Ooi, "Dynamic Buffer Management with Extensible Replacement Policies," VLDB J., Vol.15, No.2, pp.99-120, 2006   DOI   ScienceOn
6 P. Yu and A. Dan, "Performance Analysis of Affinity Clustering on Transaction Processing Coupling Architecture," IEEE Trans. Knowledge and Data Eng., Vol.6, No.5, pp.764-786, 1994   DOI   ScienceOn
7 T. Johnson and D. Shasha, "2Q: A Low Overhead High Performance Buffer Management Replacement Algorithm," Proc. VLDB, pp.439-450, 1994
8 DB2 Version 9.1 for z/OS - Data Sharing: Planning and Administration, IBM SC18-9845-01, 2007
9 A. Leff, J. Wolf, and P. Yu, "Efficient LRU-Based Buffering in a LAN Remote Caching Atchitecture," IEEE Trans. Parallel and Distributed Syst., Vol.7, No.2, pp.191-206, 1996   DOI   ScienceOn
10 E. O'Neil, P. O'Neil, and G. Weikum, "The LRU-K Page Replacement Algorithm for Database Disk Buffering," Proc. ACM SIGMOD, pp.297-306, 1993
11 K. Ohn and H. Cho, "Dynamic Affinity Cluster Allocation in a Shared Disks Cluster," J. Supercomputing, Vol.37, No.1, pp.47-69, 2006   DOI   ScienceOn
12 T. Wong and J. Wilkes, "My Cache or Yours? Making Storage More Exclusive," Proc. 2002 Ann. USENIX Technical Conf., 2002
13 M. Sinnwell and G. Weikum, "A Cost-Model-Based Online Method for Distributed Caching," Proc. ICDE, pp.532-541, 1997
14 S. Jiang and X. Zhang, "LIRS: An Efficient Low Inter-reference Recency Set Replacement Policy to Improve Buffer Cache Performance," Proc. SIGMETRICS, pp.31-42, 2002   DOI
15 C. Mohan and I. Narang, "Recovery and Coherency Control Protocols for Fast Intersystem Page Transfer and Fine-Granularity Locking in a Shared Disks Transaction Environment," Proc. VLDB, pp.193-207, 1991
16 S. Jiang, K. Davis, and X. Zhang, "Coordinated Multilevel Buffer Cache Management with Consistent Access Locality Quantification," IEEE Trans. Computers, Vol.56, No.1, pp.95-108, 2007   DOI   ScienceOn
17 M. Vallath, Oracle Real Application Clusters, Elsevier Digital Press, 2004
18 M. Yousif, "Shared-Storage Clusters," Cluster Computing, Vol.2, No.4, pp.249-257, 1999   DOI   ScienceOn