Transition Scheduling in Multiclass Real Time Database Systems
Conference Proceeding Article
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.
Computer Sciences | Databases and Information Systems
Data Management and Analytics
Real Time Systems Symposium RTSS 1992: Proceedings, Phoenix, Arizona, December 2-4
IEEE Computer Society
City or Country
Los Alamitos, CA
Hwee Hwa PANG; LIVNY, Miron; and CAREY, Michael J..
Transition Scheduling in Multiclass Real Time Database Systems. (1992). Real Time Systems Symposium RTSS 1992: Proceedings, Phoenix, Arizona, December 2-4. 23-34. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/2874