Browse > Article
http://dx.doi.org/10.3745/KIPSTD.2003.10D.7.1067

A Dynamic Transaction Routing Algorithm with Primary Copy Authority  

Kim, Ki-Hyung (영남대학교 전자정보공학부)
Cho, Hang-Rae (영남대학교 전자정보공학부)
Nam, Young-Hwan (쌍용정보통신 IT 솔루션센터 시스템통합 컨설턴트)
Abstract
Database sharing system (DSS) refers to a system for high performance transaction processing. In DSS, the processing nodes are locally coupled via a high speed network and share a common database at the disk level. Each node has a local memory and a separate copy of operating system. To reduce the number of disk accesses, the node caches database pages in its local memory buffer. In this paper, we propose a dynamic transaction routing algorithm to balance the load of each node in the DSS. The proposed algorithm is novel in the sense that it can support node-specific locality of reference by utilizing the primary copy authority assigned to each node; hence, it can achieve better cache hit ratios and thus fewer disk I/Os. Furthermore, the proposed algorithm avoids a specific node being overloaded by considering the current workload of each node. To evaluate the performance of the proposed algorithm, we develop a simulation model of the DSS, and then analyze the simulation results. The results show that the proposed algorithm outperforms the existing algorithms in the transaction processing rate. Especially the proposed algorithm shows better performance when the number of concurrently executed transactions is high and the data page access patterns of the transactions are not equally distributed.
Keywords
Database; Database Sharing System; Transaction Routing; Primary Copy Authority; Affinity; Dynamic Transaction Routing;
Citations & Related Records
연도 인용수 순위
  • Reference
1 M. Abdlguerfi and K. Wong (ed.), 'Parallel Databse Techniques,' IEEE Computer Society Press, 1998
2 L. Miller, A. Hurson andS. Pakzad (ed), 'Parallel Architectures for Data/Knowledge-Based Systems,' IEEE Computer Society Press, 1995
3 E. Rahm, 'Primary Copy Synchronization for DB-Sharing,' Info. Syst., Vol.11, No.4, pp.275-286, 1986   DOI   ScienceOn
4 C. Mohan, I. Narang, 'Recovery and Coherency control Protocols for Fast Intersystem Page Transfer and Fine-Granularity Locking in a Shared Disks Transaction Environment,' Proc. Int. Conf. on VLDB pp. 193-207, 1991
5 A. Dan and P. Yu, 'Performance analysis of Buffer Coherency ,' IEEE Trans. on Parallel and Distributed Syst., Vol.4, No.3, pp.289-305, 1993   DOI   ScienceOn
6 S. Haldar and D. K. Subramanian, 'An Affinity-based Dynamic Load Balancing Protocol for Distributed Transaction,' Performance Evaluation, Vol.17, No.1, pp.53-71, 1993   DOI   ScienceOn
7 F. Howell and R. Mcnab, 'Simjava Package,' http://www.dcs.ed.ac.uk/home/simjava, April, 1999
8 M. Zaharioudakis, M. Carey and M. Franklin, 'Adaptive, Fine-Grained Sharing in a Client-Server OODBMS : A Callback-Based Approach,' ACM Trans. on Database Syst., Vol.22, No.4, pp.570-627, 1997   DOI   ScienceOn
9 A. Reuter, 'Load Control and Load Balancing in a Shared Database Management System,' Proc. of 2nd Int. Conf. on Data Eng., pp.188-197, 1986
10 K. Ohn, R. Hwang and H. Cho, 'Prototyping PHLOX, A High Performance Transaction Processing System on a Workstation Cluster with Shared Disks,' Proc. 8th IEEE Computer Workshop on FTDCS, pp.67-73, 2001   DOI
11 E. Rahm, 'A Framework for Workload Allocation in Distributed Transaction System,' Syst. Soft. Journal, Vol.18, No.3, pp.171-190, 1992   DOI   ScienceOn
12 P. Yu and A. Dan, 'Performance Evaluation of Trans,' IEEE Trans. on Parallel and Distributed Syst., Vol.5, No.2, pp.139-153, 1994   DOI   ScienceOn
13 E. Rahm, 'Empirical Performance Evaluation of Concurrency and Cohereny control Protocols for Database Sharing Systems,' ACM Trans. on Database Syst., Vol. 18, No. 2, pp.333-377, 1993   DOI   ScienceOn
14 P. Yu and A. Dan, 'Performance Analysis of Affinity Clustering on Transaction Processing Coupling Architecture,' IEEE Trans. on Knowledge and Data Eng., Vol.6, No.5, pp.764-786, 1994   DOI   ScienceOn