Scheduling Algorithms for Parallel Transaction Processing Systems
by Jiahong Wang, Jie Li, Hisao Kameda
Abstract:
Shared-nothing parallel transaction processing (TP) systems have great potential to serve the ever-increasing demands for high transaction processing rate. This potential, however, may not be reached due to the negative effect of the widely used two-phase locking (2PL) concurrency control method. We observed that for the shared-nothing parallel TP system, this negative effect of 2PL can be alleviated significantly by scheduling transactions judiciously. In this paper, a new transaction scheduling algorithm called FCFSP (FCFS with Priority) is proposed thereby. In order to study the performance of transaction scheduling algorithms, a comprehensive simulator for shared-nothing parallel TP systems is developed. Using the developed simulator, the performance of FCFSP is compared with that of the conventional FCFS and the previously proposed SOST (Synchronizing Completion of SubTransactions) transaction scheduling algorithms. Simulation results demonstrate the effectiveness of FCFSP. Simulation results also show that FCFSP outperforms FCFS greatly, and overcomes the drawback of SCST.
J. Wang, J. Li, H. Kameda, Scheduling Algorithms for Parallel Transaction Processing Systems. In V. Malyshkin (ed.),
Parallel Computing Technologies: Proceedings of the 4th International Conference,
Lect. Notes in Comp. Sci., Vol. 1277, Springer, 1997, pp. 283-297
