This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Performance Analysis of Affinity Clustering on Transaction Processing Coupling Architecture
October 1994 (vol. 6 no. 5)
pp. 764-786

Coupling multiple computing nodes for transaction processing has become increasingly attractive for reasons of capacity, cost, and availability. This paper presents a comparison of robustness (in terms of performance) of three different architectures for transaction processing. In the shared nothing (SN) architecture, neither disks nor memories are shared. In the shared disk (SD) architecture, all disks are accessible from all nodes, whereas in the shared intermediate memory (SIM) architecture, a shared intermediate level of memory is introduced. Coupling multiple nodes inevitably introduces certain interferences and overheads, which take on different forms and magnitudes under the different architectures. Affinity clustering, which attempts to partition the transactions into affinity clusters according to their database reference patterns, can be employed to reduce the coupling degradation under the different architectures, though in different ways. However, the workload may not be partitionable into N affinity clusters of equal size, where N is the number of nodes in the coupled system, so that the load can be evenly spread over all nodes. In addition to balancing the load, we need to maintain a large fraction of data references within the database affiliated with the affinity cluster. These become increasingly harder to achieve for large values of N. In this paper, we examine the impact of affinity on the performance of these three different coupling architectures.

[1] S. B. Behman, T. A. DeNatale, and R. W. Shomler, "Limited lock facility in a DASD control unit," Tech. Rep. 02.859, IBM General Products Div., San Jose, CA, Oct. 1979.
[2] B. T. Bennett, P. A. Franaszek, J. T. Robinson, and P. S. Yu, "Check on access via hierarchical block validation,"IBM Tech. Disclosure Bull., vol. 27, pp. 3752-3756, Dec. 1984.
[3] A. Bhide and M. Stonebraker, "A performance comparison of two architectures for fast transaction processing,"4th Int. Conf. on Data Eng., 1988, pp. 536-545.
[4] A. Bhide, "An analysis of three transaction processing architectures,"14th Int. Conf. Very-Large Databases, 1988, pp. 339-350.
[5] H. Boralet al., "Prototyping BUBBA: A highly parallel database system,"IEEE Trans. Knowl. Data Eng., vol. 2, pp. 4-24, Mar. 1990.
[6] A. J. Borr, "Transaction monitoring in encompass: Reliable distributed transaction processing,"7th Int. Conf. Very Large Databases, 1981, pp. 155-165.
[7] R. I. Casas and K. C. Sevcik, "A buffer management model for use in predicting overall database system performance," inFifth Int. Conf. Data Eng., Los Angeles, CA, Feb. 1989, pp. 463-469.
[8] IBM Corp., "Sysplex overview: Introducing data sharing and parallelism in a Sysplex," Tech. Rep. GC28-1208-00, Apr. 1994.
[9] B. Ciciani, D. M. Dias, and P. S. Yu, "Analysis of replication in distributed database systems,"IEEE Trans. Knowl. Data Eng., vol. 2, pp. 247-261, June 1990.
[10] E. I. Cohen, G. M. King, and J. T. Brady, "Storage hierarchies,"IBM Syst. J., vol. 28, pp. 62-76, 1989.
[11] D. W. Cornell, D. M. Dias, and P. S. Yu, "On multisystem coupling through function request shipping,"IEEE Trans. Software Eng., vol. SE-12, no. 10, pp. 1006-1017, Oct. 1986.
[12] A. Dan, "Performance analysis of data sharing environments," inACM Distinguished Dissertation Series. Cambridge, MA: MIT Press, 1992.
[13] A. Dan and D. Towsley, "An approximate analysis of the LRU and FIFO buffer replacement schemes," inACM SIGMETRICS, Denver, CO, May 1990, pp. 143-152.
[14] A. Dan, D. M. Dias, and P. S. Yu, "Buffer analysis for a data sharing environment with skewed data access,"IEEE Trans. Knowl. Data Eng., vol. 6, pp. 331-337, Apr. 1994.
[15] A. Dan, D. M. Dias, and P. S. Yu, "Modelling a hierarchical buffer for the data sharing environment," inACM SIGMETRICS, San Diego, CA, May 1991, pp. 156-167.
[16] A. Dan and P. S. Yu, "Performance analysis of buffer coherency policies in a multisystem data sharing environment,"IEEE Trans. Parallel Distrib. Syst., vol. 4, pp. 289-305, Mar. 1993.
[17] A. Dan and P. S. Yu, "Performance analysis of coherency control policies through lock retention," inProc. ACM SIGMOD, San Diego, June 1992, pp. 114-123.
[18] A. Dan and P. S. Yu, "Analytical modeling and comparison of buffer coherency policies based on lock retention," IBM Res. Rep. RC18664, Jan. 1993.
[19] A. Dan, A. Jhingran, and P. S. Yu, "Recovery analysis of data sharing systems under deferred dirty page propagation policies," IBM Res. Rep. RC18553, Dec. 1992.
[20] C. J. Date,An Introduction to Database Systems, vols. 1 and 2. Reading, MA: Addison-Wesley, vol. 1, 1981, vol. 2, 1983.
[21] "DB2 V2R2 performance report," Tech. Rep. GG24-3461. IBM Int. Tech. Support Center, Santa Teresa, CA, USA, 1989.
[22] D. J. Dewittet al., "The GAMMA database machine project,"IEEE Trans. Knowl. Data Eng., vol. 2, pp. 44-62, Mar. 1990.
[23] D. J. Dewitt and J. Gray, "Parallel database systems: The future of database processing or a passing fad?"SIGMOD Rec., vol. 19, pp. 104-112, Dec. 1990.
[24] D. M. Dias, B. R. Iyer, J. T. Robinson, and P. S. Yu, "Integrated concurrency-coherency controls for multisystem data sharing,"IEEE Trans. Software Eng., vol. 15, pp. 437-448, Apr. 1989.
[25] M. J. Franklin, M. J. Zwilling, C. K. Tan, M. J. Carey, and D. J. DeWitt, "Crash recovery in client-server EXODOUS,"ACM SIGMOD, 1992, pp. 165-174.
[26] J. Gray, "A transaction model," in G. Goos and J. Hartmanis, Eds.,Lecture Notes in Computer Science 85. New York: Springer-Verlag, 1980, pp. 282-298.
[27] P. Heidelberger and M. S. Lakshmi, "A performance comparison of multi-microprocessor and mainframe database architectures,"IEEE Trans. Software Eng., Vol. 14, No. 4, pp. 522-531, April 1987.
[28] J. A. Katzman, "A fault-tolerant computing systems,"11th Int. Conf. Syst. Sci., 1978, pp. 85-102.
[29] M. Kitsuregawa, M. Nakano, L. Harada, and M. Takagi, "Performance evaluation of functional disk system with nonuniform data distribution," inProc. 2nd Int. Symp. Databases Parallel Syst., 1990, pp. 80-89.
[30] N. P. Kronenberg, H. M. Levy, and W. D. Strecker, "VAXcluster: A closely-coupled distributed system,"ACM Trans. Comput. Syst., vol. 4., no. 2, pp. 130-146, May 1986.
[31] A. Leff, J. L. Wolf, and P. S. Yu, "Replication algorithms in a remote caching architecture"IEEE Trans. Parallel Distrib. Syst., vol. 4, pp. 1185-1204, Nov. 1993.
[32] 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," inProc. 17th Int. Conf. Very. Large Data Bases, Barcelona, Spain, Sept. 1991, pp. 193-207.
[33] C. Mohan, I. Narang, and S. Silen, "Solutions to hot spot problems in a shared disks transaction environment,"Proc. 4th Int. Workshop on High Performance Trans. Syst., Asilomar, CA, USA, Sept. 1991.
[34] C. Mohan and I. Narang, "Efficient locking and caching of data in the multi-system shared disks transaction environment,"Proc. Int. Conf. Extending Database Technol., Vienna, Mar. 1992.
[35] E. Rahm, "Design of optimistic methods for concurrency control in database sharing systems,"7th Int. Conf. on Distrib. Computing Syst., Berlin, Germany, Sept. 1987.
[36] E. Rahm, "Use of global extended memory for distributed transaction processing,"4th Int. Workshop on High Performance Trans. Processing, Asilomar, CA, USA, Sept. 1991.
[37] J. T. Robinson, "A fast general purpose hardware synchronization mechanism,"SIGMOD Rec., 1985, pp. 122-130.
[38] J. P. Strickland, P. P. Uhrowczik, and V. L. Watts, "IMS/VS: An evolving system,"IBM Syst. J., vol. 21, pp. 490-510, 1982.
[39] M. Stonebraker, "The case of shared nothing,"IEEE Database Eng., vol. 9, no. 1, 1986.
[40] S.S. Thakkar, "Performance of Parallel Applications on a Shared-Memory Multiprocessor System," inPerformance Instrumentation and Visualization, M. Simmons and R. Koskela, eds., ACM Press, New York, 1990, pp. 233-256.
[41] "DBC/1012 database computer system manual release 2.0" Doc. C10- 0001-02, Teradata Corp., Nov. 1985.
[42] J. L. Wolf, D. M. Dias, B. R. Iyer, and P. S. Yu, "Multi-system coupling by a combination of data sharing and data partitioning,"IEEE Trans. Software Eng., vol. 15, pp. 854-860, 1989.
[43] P. S. Yu, D. M. Dias, J. T. Robinson, B. R. Iyer, and D. W. Cornell, "On coupling multi-systems through data sharing,"Proc. IEEE, vol. 75, no. 5, pp. 573-587, May 1987.
[44] P.S. Yu, H.-U. Heiss, S. Lee, and M.-S. Chen, "On workload characterization of relational database environments,"IEEE Trans. Software Eng., vol. 18, pp. 347-355, Apr. 1992.
[45] K. Barker and M.T. Ozzu, "Reliable Transaction Execution in Multidatabase Systems,"Proc. First Int'l Workshop Interoperability Multidatabase Systems, IEEE CS Press, Los Alamitos, Calif., Order No. 2205, 1991, pp. 344-347.
[46] P. S. Yu and A. Dan, "Performance evaluation of transaction processing coupling architectures for handling system dynamics,"IEEE Trans. Parallel Distrib. Syst., vol. 5, pp. 139-153, Feb. 1994.
[47] P. S. Yu and D. M. Dias, "Analysis of hybrid concurrency control schemes for a high data contention environment,"IEEE Trans. Software Eng., vol. 18, pp. 118-129, 1992.

Index Terms:
transaction processing; performance evaluation; database theory; distributed databases; software reliability; performance analysis; affinity clustering; transaction processing coupling architecture; multiple computing nodes; capacity; cost; availability; shared nothing architecture; disks; memories; shared disk architecture; shared intermediate memory; transaction partitioning; database reference patterns; affinity clusters; load balancing; data references; coupling architecture performance
Citation:
P.S. Yu, A. Dan, "Performance Analysis of Affinity Clustering on Transaction Processing Coupling Architecture," IEEE Transactions on Knowledge and Data Engineering, vol. 6, no. 5, pp. 764-786, Oct. 1994, doi:10.1109/69.317706
Usage of this product signifies your acceptance of the Terms of Use.