Analysis of affinity based routing in multi-system data sharing

Abstract

The rapid growth in the transaction rate requirement of high volume database systems has forced users and vendors to (a) couple multiple database systems to run against a common database, and (b) to implement each single system with faster processors. Multiple system coupling incurs performance degradation due to inter-system interference: inter-system (global) lock contention and database buffer invalidation. At high transaction rates, the level of inter-system interference can have a severe impact on performance. In this paper, we exploit transaction routing as a means of reducing inter-system interference and quantify its effect. A methodology, employing an integer linear programming technique, is developed to classify incoming transactions into affinity groups based on their database call reference pattern. The key idea of affinity based routing is to determine affinity groups and route transactions in the same affinity group to the same system. Based on traces from two of IBM's high volume single system customers, we find that, at high transaction rates, affinity based routing significantly reduces lock contention probability and leads to a substantial reduction in transaction response time. Improvement in hierarchical locking by taking advantage of affinity based routing is demonstrated. Further, the reduction in inter-system data contention produces a large impact on the performance of an optimistic type concurrency control strategy. © 1987.