Item Details

Using Dynamic Priority in Real-Time Database Systems

Son, Sang; Wagle, Prasad
Format
Report
Author
Son, Sang
Wagle, Prasad
Abstract
A real-time database system has timing constraints associated with transactions and the database. To ensure that such a system completes as many transactions as possible without violating their timing constraints, its scheduling strategy should be dynamic and use information about the timing constraints associated with transactions and the database. Ideally, to enhance the predictability of the system; such a scheduling strategy should be used in all situations where there is resource contention. This paper describes an intelligent dynamic scheduling strategy for scheduling transactions in real - time database systems. The scheduling strategy uses timing information about transactions and the database to enhance the system‘s ability to meet transaction deadlines. The performance of the scheduling strategy is tested by using it in a simulated pulse detection system. Note: Abstract extracted from PDF file via OCR
Language
English
Date Received
20121029
Published
University of Virginia, Department of Computer Science, 1990
Published Date
1990
Collection
Libra Open Repository
Logo for In CopyrightIn Copyright

Availability

Access Online