In recent years, a demand for real-time systems that can manipulate large amounts of shared data has led to the emergence of real-time database systems (RTDBS) as a research area. This paper focuses on the problem of scheduling queries in RTDBSs. We introduce and evaluate a new algorithm called Priority Adaptation Query Resource Scheduling (PAQRS) for handling both single class and multiclass query workloads. The performance objective of the algorithm is to minimize the number of missed deadlines, while at the same time ensuring that any deadline misses are scattered across the different classes according to an administratively-defined miss distribution. This objective is achieved by dynamically adapting the system's admission, memory allocation, and priority assignment policies according to its current resource configuration and workload characteristics. A series of experiments confirms that PAQRS is very effective for real-time query scheduling
Memory management, Priority scheduling, Query processing, Real-time database systems
Databases and Information Systems | Numerical Analysis and Scientific Computing
Data Management and Analytics
IEEE Transactions on Knowledge and Data Engineering
PANG, Hwee Hwa; CAREY, Michael J.; and LIVNY, Miron.
Multiclass Query Scheduling in Real-Time Database Systems. (1995). IEEE Transactions on Knowledge and Data Engineering. 7, (4), 533-551. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/110
Copyright Owner and License
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.