Earliest deadline scheduling for real-time database systems

A new priority assignment algorithm called adaptive earliest deadline (AED) is given that stabilizes the overload performance of the earliest deadline policy in a real-time database system (RTDBS) environment. The AED algorithm uses a feedback control mechanism to achieve this objective and does not...

Full description

Saved in:
Bibliographic Details
Published in[1991] Proceedings Twelfth Real-Time Systems Symposium pp. 232 - 242
Main Authors Haritsa, J.R., Livny, M., Carey, M.J.
Format Conference Proceeding
LanguageEnglish
Published IEEE Comput. Soc. Press 1991
Subjects
Adaptive control
Algorithm design and analysis
Database systems
Degradation
Delay
Feedback control
Processor scheduling
Programmable control
Real time systems
Transaction databases
Online AccessGet full text

Cover

More Information
Summary:A new priority assignment algorithm called adaptive earliest deadline (AED) is given that stabilizes the overload performance of the earliest deadline policy in a real-time database system (RTDBS) environment. The AED algorithm uses a feedback control mechanism to achieve this objective and does not require knowledge of transaction characteristics. Using a detailed simulation model, the authors compare the performance of AED with respect to earliest deadline and other fixed priority schemes. They also present and evaluate an extension of the AED algorithm called hierarchical earliest deadline (HED), which is designed to handle applications that assign different values to transactions and where the goal is to maximize the total value of the in-time transactions.< >
ISBN:9780818624506
0818624507
DOI:10.1109/REAL.1991.160378