By Topic

Scheduling transactions 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
$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

1 Author(s)
A. M. K. Cheng ; Dept. of Comput. Sci., Houston Univ., TX, USA

The author describes an efficient algorithm for determining the feasibility of a transaction with runtime linearly proportional to the number of lock requests in the transaction. The schedulability checker based on the game-board representation determines transaction schedulability one at a time (incrementally), and thus it also has linear runtime complexity once the checker is initialized. Given the current configuration of the database and the characteristics of the newly arrived transaction, the feasibility test can determine a priori whether the new transaction can be completed by its specified deadline. An example is presented which illustrates how the transaction feasibility checker and the runtime monitor work.<>

Published in:

Compcon Spring '93, Digest of Papers.

Date of Conference:

22-26 Feb. 1993