DocumentCode :
1989225
Title :
Performance of hard real-time transaction scheduling policies in parallel database systems
Author :
Takkar, Sonia ; Dandamudi, Sivarama P.
Author_Institution :
Sch. of Comput. Sci., Carleton Univ., Ottawa, Ont., Canada
fYear :
1998
fDate :
19-24 Jul 1998
Firstpage :
176
Lastpage :
184
Abstract :
Real-time transactions, in addition to preserving consistency of the database as in traditional transactions, have to meet the deadlines. Scheduling real-time transactions in parallel database systems has not received much attention. This paper focuses on real-time transaction scheduling in shared-nothing parallel database systems. We evaluate the performance of a new priority-based scheduling policy, in which all scheduling decisions are made locally by each node. In contrast, several other algorithms, proposed for the distributed systems, require communication among the nodes to globally synchronize their local block and abort decisions. Such synchronization can deteriorate performance as real-time transactions will have to meet deadlines. We use miss ratio as the performance metric and show that, in general, the new policy provides a superior performance for the workload and system parameters considered in this study
Keywords :
parallel databases; performance evaluation; transaction processing; distributed systems; miss ratio; parallel database systems; performance; performance metric; real-time transactions; transaction scheduling; Computer science; Database systems; Distributed computing; Distributed databases; Measurement; Processor scheduling; Real time systems; System recovery; Timing; Transaction databases;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Modeling, Analysis and Simulation of Computer and Telecommunication Systems, 1998. Proceedings. Sixth International Symposium on
Conference_Location :
Montreal, Que.
Print_ISBN :
0-8186-8566-2
Type :
conf
DOI :
10.1109/MASCOT.1998.693692
Filename :
693692
Link To Document :
بازگشت