Abstract
A great deal of research indicates that the shared disks (SD) cluster is suitable to high performance transaction processing. However, the aggregation of SD cluster with real-time processing has not been investigated. By adopting cluster technology, the real-time services will be highly available and can exploit internode parallelism. In this paper, we consider buffer management issues in a real-time SD cluster. We first propose a real-time buffer coherency algorithm that exploits inherent characteristics of real-time applications and SD cluster. Then we extend traditional buffer replacement algorithms to the real-time SD cluster. They emphasize specific attributes of buffer pages to capitalize locality of references, transaction deadline, and affinity-based routing. We evaluate the performance of the proposed algorithms under a wide variety of transaction workloads and system configurations.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Carey M, Jauhari R, Livny M (1989) Priority in DBMS resource scheduling. In: Proc VLDB, pp 397–410
Datta A, Mukherjee S, Viguier I (1998) Buffer management in real-time active database systems. J Syst Softw 42:227–246
DB2 (2007) DB2 version 9.1 for z/OS—data sharing: planning and administration. IBM SC18-9845-01
Goh C, Shu Y, Huang Z, Ooi B (2006) Dynamic buffer management with extensible replacement policies. VLDB J 15:99–120
Harita J, Carey M, Livny M (1994) Data access scheduling in firm real-time database systems. J Real-Time Syst 4:203–241
Huang J, Stankovic J (1990) Buffer management in real-time databases. COINS technical report 90-65, University of Massachusetts-Amherst
Kanitkar V, Delis A (2005) Efficient processing of client transactions in real-time. Distrib Parallel Databases 17:39–74
Lam K, Kuo T, Kao B, Lee T, Cheng R (2002) Evaluation of concurrency control strategies for mixed soft real-time database systems. Inf Syst 27:123–149
Lee S, Ohn K, Cho H (2005) Feasibility and performance study of a shared disks cluster for real-time processing. Lecture notes in computer science, vol. 3397. Springer, Berlin, pp 518–527
Lee I, Leung J, Son S (2008) Handbook of real-time and embedded systems. Chapman & Hall/CRC, London/Boca Raton
Mohan C, Narang I (1991) Recovery and coherency control protocols for fast intersystem page transfer and fine-granularity locking in a shared disks transaction environment. In: Proc VLDB, pp 193–207
Ohn K, Cho H (2006) Dynamic affinity cluster allocation in a shared disks cluster. J Supercomput 37:47–69
Ohn K, Cho H (2007) Path conscious caching of B+ tree indexes in a shared disks cluster. J Parallel Distrib Comput 67:286–301
Ramamritham K, Son S, Dipippo L (2004) Real-time databases and data services. Real-time Syst 28:179–215
Ranade D (2002) Shared data clusters. Wiley, New York
Schwetmann H (1996) User’s guide of CSIM18 simulation engine. Mesquite Software, Inc
Vallath M (2004) Oracle real application clusters. Elsevier, Amsterdam
Yousif M (1999) Shared-storage clusters. Cluster Comput 2:249–257
Yu P, Dan A (1994) Performance analysis of affinity clustering on transaction processing coupling architecture. IEEE Trans Knowl Data Eng 6:764–786
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Cho, H., Yoo, Ky. Buffer management in a real-time shared disks cluster. J Supercomput 53, 313–328 (2010). https://doi.org/10.1007/s11227-009-0295-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11227-009-0295-4