An effective scheduling algorithm for parallel transaction processing systems

Author

Li, Jie ; Wang, Jiahong ; Kameda, Hisao ; Li, Keqin

Author_Institution

Inst. of Inf. Sci. & Electron., Tsukuba Univ., Ibaraki, Japan

Volume

1

fYear

1997

Firstpage

181

Abstract

We study the scheduling problem in shared-nothing parallel transaction processing (TP) systems with two-phase locking concurrency control. A transaction scheduling algorithm called SCST (Synchronizing Completion of Sub-Transactions) is proposed to reduce the data contention and thus to improve the system performance in the shared-nothing parallel TP systems. Furthermore, a comprehensive simulator for shared-nothing parallel TP systems is developed for studying the performance behavior of the SCST algorithm. Using this simulator, we compare the SCST algorithm with the conventional FCFS (First-Come-First-Served) scheduling algorithm. We show that the SCST algorithm outperforms the FCFS algorithm significantly in terms of the transaction throughput, the 95th percentile of the response time, and the restart ratio

Keywords

concurrency control; parallel algorithms; performance evaluation; processor scheduling; transaction processing; SCST; response time; restart ratio; scheduling algorithm; shared-nothing parallel transaction processing; synchronizing completion of subtransactions; transaction throughput; two-phase locking concurrency control; Cities and towns; Computational modeling; Computer science; Computer simulation; Concurrency control; Mathematics; Processor scheduling; Scheduling algorithm; System performance; Throughput;

fLanguage

English

Publisher

ieee

Conference_Titel

Aerospace and Electronics Conference, 1997. NAECON 1997., Proceedings of the IEEE 1997 National

Conference_Location

Dayton, OH

Print_ISBN

0-7803-3725-5

Type

conf

DOI

10.1109/NAECON.1997.617778

Filename

617778