By Topic

A transaction scheduling algorithm with temporal constraints in real-time 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
$31 $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)
Jian-Jun Han ; Sch. of Comput. Sci. & Technol., Huzhong Univ. of Sci. & Technol., Wuhan, China ; Qing-Hua Li

Temporal data object accessed by transactions of real-time database systems have been applied in diverse domains. However, almost all of the current transaction scheduling algorithms so far only take logic consistency of object into account, while ignoring temporal consistency. This paper presents the concept of temporary deadline, and proves the feasibility of low-cost predictive algorithm in the form of theorem in order to abort or postpone those transactions that cannot satisfy temporal consistency as soon as possible, therefore, computation resources are saved to accommodate for other transactions. A new transaction scheduling algorithm with temporal constraints, called TDDBPA (temporary data deadline-based predictive algorithm) is proposed based on strategies mentioned above in this paper. The simulation results show that performance of our algorithm significantly outperforms that of well-known algorithms so far.

Published in:

Computer and Information Technology, 2004. CIT '04. The Fourth International Conference on

Date of Conference:

14-16 Sept. 2004