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 inter-node parallelism. In this paper, we propose a priority conscious transaction routing algorithm for a real-time SD cluster, which allocates real-time transactions to a node in the SD cluster. Unlike traditional routing algorithms that consider transaction affinity and load balancing only, our algorithm also considers transaction priorities inherent to real-time applications. We evaluate the performance of our algorithm under a wide variety of real-time workloads. The experiment results show that our algorithm outperforms both pure priority-based algorithms and pure affinity-based algorithms.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Cho, H.: Cache Coherency and Concurrency Control in a Multisystem Data Sharing Environment. IEICE Trans. Information and Syst. E82-D, 1042–1050 (1999)
Cho, H., Park, J.: Maintaining Cache Coherency in a Multisystem Data Sharing Environment. J. Syst. Architecture 45, 285–303 (1998)
DB2 Universal Database for OS/390 and z/OS - Data Sharing: Planning and Administration. IBM SC26-9935-01 (2001)
Harita, J., Carey, M., Livny, M.: Data Access Scheduling in Firm Real-Time Database Systems. J. Real-Time Syst. 4, 203–241 (1994)
Kanitkar, V., Delis, A.: Real-Time Processing in Client-Server Databases. IEEE Trans. on Computers 51, 269–288 (2002)
Lam, K.-Y., Kuo, T.-W. (eds.): Real-Time Database Systems: Architecture and Techniques. Kluwer Academic Publishers, Dordrecht (2000)
Lam, K.-Y., Kuo, T.-W., Lee, T.: Strategies for resolving inter-class data conflicts in mixed real-time database systems. Journal of Syst. and Soft. 61, 1–14 (2002)
Lee, S., Ohn, K., Cho, H.: Feasibility and Performance Study of a Shared Disks Cluster for Real-Time Processing. In: Kim, T.G. (ed.) AIS 2004. LNCS (LNAI), vol. 3397, pp. 518–527. Springer, Heidelberg (2005)
Mohan, C., Narang, I.: Recovery and Coherency Control Protocols for Fast Intersystem Page Transfer and Fine-Granularity Locking in a Shared Disks Transaction Environment. In: Proc. 17th Int. Conf. VLDB, pp. 193–207 (1991)
Ohn, K., Cho, H.: Cache Conscious Dynamic Transaction Routing in a Shared Disks Cluster. In: Laganá, A., Gavrilova, M.L., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds.) ICCSA 2004. LNCS, vol. 3045, pp. 548–557. Springer, Heidelberg (2004)
Vallath, M.: Oracle Real Application Clusters. Elsevier Digital Press, Amsterdam (2004)
Schwetmann, H.: User’s Guide of CSIM18 Simulation Engine. Mesquite Software, Inc. (1996)
Yousif, M.: Shared-Storage Clusters. Cluster Comp 2, 249–257 (1999)
Yu, P., Dan, A.: Performance Analysis Clustering on Transaction Processing Coupling Architecture. IEEE Trans. Knowledge and Data Eng. 6, 764–786 (1994)
Yu, P., Dan, A.: Performance Evaluation of Transaction Processing Coupling Architectures for Handling System Dynamics. IEEE Trans. Parallel and Distributed Syst. 5, 139–153 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ohn, K., Lee, S., Cho, H. (2005). Priority Conscious Transaction Routing in a Real-Time Shared Disks Cluster. In: Cao, J., Nejdl, W., Xu, M. (eds) Advanced Parallel Processing Technologies. APPT 2005. Lecture Notes in Computer Science, vol 3756. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11573937_52
Download citation
DOI: https://doi.org/10.1007/11573937_52
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29639-3
Online ISBN: 978-3-540-32107-1
eBook Packages: Computer ScienceComputer Science (R0)