By Topic

Performance of hard real-time transaction scheduling policies in parallel database systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
S. Takkar ; Sch. of Comput. Sci., Carleton Univ., Ottawa, Ont., Canada ; S. P. Dandamudi

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

Published in:

Modeling, Analysis and Simulation of Computer and Telecommunication Systems, 1998. Proceedings. Sixth International Symposium on

Date of Conference:

19-24 Jul 1998