Transition scheduling in (multiclass real-time database systems
- 1 December 1992
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
The issue of priority assignment is addressed, in firm multiclass real-time database systems (RTDBSs) where classes are distinguished by their mean sizes. It is shown that the earliest deadline scheduling principle, upon which a number of existing priority assignment policies are based, discriminates significantly against longer transactions. This observation has motivated the development of a novel dynamic priority assignment scheme that improves the chances for long transactions to meet their time constraints, thereby providing a fairer mechanism for use in multiclass RTDBS transaction scheduling.Keywords
This publication has 11 references indexed in Scilit:
- Enhancing real-time DBMS performance with multiversion data and priority based disk schedulingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Earliest deadline scheduling for real-time database systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Scheduling real-time transactionsACM Transactions on Database Systems, 1992
- On being optimistic about real-time constraintsPublished by Association for Computing Machinery (ACM) ,1990
- Load control for lockingPublished by Association for Computing Machinery (ACM) ,1990
- Virtual Time CSMA Protocols for Hard Real-Time CommunicationIEEE Transactions on Software Engineering, 1987
- Optimistic versus pessimistic concurrency control mechanisms in database management systemsInformation Systems, 1982
- On optimistic methods for concurrency controlACM Transactions on Database Systems, 1981
- The notions of consistency and predicate locks in a database systemCommunications of the ACM, 1976
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973