Performance Comparison of IO Shipping and Database Call Shipping: Schemes in Multisystem Partitioned Databases

Abstract In a multi-system partioned database, the database is split between the multiple systems and a facility is provided to support the shipping of function requests among the systems. Two alternate levels of function requests, called IO request shipping and database call shipping, are analyzed and compared. The analysis is based on traces from large mainframe systems running IBM's IMS database management systems. A methodology is presented for deriving optimal database partitions and transaction assignment so as to minimize the average system response time. The methodology decomposes the optimization problem into an integer linear programming problem for partitioning the databases and a simplex reflection method for probabilistic transaction routing. The issues addressed include the effectiveness of routing and the limits of partitioning. The IO request shipping approach is preferable when high communications bandwidth is available as in a machine room. Furthermore, IO request shipping can take advantage of probabilistic routing to enhance its performance, while database call shipping gains little from probabilistic routing as compared to fixed routing. However, IO request shipping is more susceptible to lock contention which may become a problem for an environment with a high transaction rate. For systems with lower communications bandwidth spread beyond the machine room, the database call shipping approach is the method of choice.

[1]  Philip S. Yu,et al.  Tradeoffs Between Coupling Small and Large Processors for Transaction Processing , 1988, IEEE Trans. Computers.

[2]  Stephen S. Lavenberg.  A simple analysis of exclusive and shared lock contention in a database system , 1984, SIGMETRICS '84.

[3]  Philip S. Yu,et al.  Analysis of Affinity Based Routing in Multi-System Data Sharing , 1987, Perform. Evaluation.

[4]  Debasis Mitra,et al.  Probabilistic Models of Database Locking: Solutions, Computational Algorithms, and Asymptotics , 1984, JACM.

[5]  Philip S. Yu,et al.  Distributed Concurrency Control Analysis for Data Sharing , 1985, Int. CMG Conference.

[6]  Domenico Ferrari,et al.  Performance analysis of several back-end database architectures , 1986, TODS.

[7]  Peter P. Uhrowczik,et al.  IMS/VS: An Evolving System , 1982, IBM Syst. J..

[8]  Philip S. Yu,et al.  On multisystem coupling through function request shipping , 1986, IEEE Transactions on Software Engineering.

[9]  Y. C. Tay,et al.  A mean value performance model for locking in databases: the no-waiting case , 1985, JACM.

[10]  Lawrence J. Watters.  Letter to the Editor - Reduction of Integer Polynomial Programming Problems to Zero-One Linear Programming Problems , 1967, Oper. Res..

[11]  Philip S. Yu,et al.  Modelling of centralized concurrency control in a multi-system environment , 1985, SIGMETRICS '85.

[12]  Kazuo Goto,et al.  The DCS: a new approach to multisystem data-sharing , 1984, AFIPS '84.

[13]  Philip S. Yu,et al.  Design and Analysis of Integrated Concurrency-Coherence Controls , 1987, VLDB.

[14]  Asser N. Tantawi,et al.  Optimal static load balancing in distributed computer systems , 1985, JACM.

[15]  John A. Nelder,et al.  A Simplex Method for Function Minimization , 1965, Comput. J..

[16]  Lawrence W. Dowdy,et al.  Comparative Models of the File Assignment Problem , 1982, CSUR.