This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Multiclass Query Scheduling in Real-Time Database Systems
August 1995 (vol. 7 no. 4)
pp. 533-551

Abstract—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.

[1] R. Abbott and H. Garcia-Molina,“Scheduling real-time transactions: A performance evaluation,” Proc. 14th Int’l Conf. Very Large Data Bases, Aug. 1988.
[2] R. Abbott and H. Garcia-Molina,“Scheduling real-time transactions with disk resident data,” Proc. 15th Int’l Conf. Very Large Data Bases, Aug. 1989.
[3] R. Abbott and H. Garcia-Molina, "Scheduling I/O Requests with Deadlines: A Performance Evaluation," Proc. IEEE Real-Time Systems Symp., pp. 113-124, 1990.
[4] D. Bitton and J. Gray, “Disk Shadowing,” Very Large Data Bases, pp. 331–338, 1988.
[5] K.P. Brown,M.J. Carey,, and M. Livny,“Managing memory to meet multiclass workload response time goals,” Proc. 19th Int’l. Conf. Very Large Data Bases, Aug. 1993.
[6] K.P. Brown,M. Mehta,M.J. Carey,, and M. Livny,“Towards automated performance tuning for complex workloads,” Proc. 20th Int’l Conf. Very Large Data Bases, Sept. 1994.
[7] S. Chen,J.A. Stankovic,J.F. Kurose,, and D. Towsley,“Performance evaluation of two new disk scheduling algorithms for real-time systems,” J. Real-Time Systems, vol. 3, no. 3, Sept. 1991.
[8] D. Cornell and P. Yu,“Integration of buffer management and query optimization in a relational database environment,” Proc. 15th Int’l Conf. Very Large Data Bases, Aug. 1989.
[9] D.L. Davison and G. Graefe,“Memory-contention responsive hash joins,” Proc. 20th Int’l Conf. Very Large Data Bases, Sept. 1994.
[10] J.L. Devore,Probability and Statistics for Engineering and the Sciences. Brooks/Cole Publishing Co., pp. 283-301, 326-335, 1991.
[11] N.R. Draper and H. Smith,Applied Regression Analysis. John Wiley&Sons, pp. 70-136, 1981,.
[12] J. Haritsa, M. Livny, and M. Carey, “On Being Optimistic about Real-Time Constraints,” Proc. Ninth ACM Symp. Principles of Database Systems, 1990.
[13] J.R. Haritsa,M. Livny,, and M.J. Carey,“Earliest deadline scheduling for real-time database systems,” Proc. 12th IEEE Real-Time Systems Symposium (RTSS), Dec. 1991.
[14] J. Huang,J.A. Stankovic,D. Towsley,, and K. Ramamritham,“Experimental evaluation of real-time transaction processing,” Proc. 10th IEEE Real-Time Systems Symp. (RTSS), Dec. 1989.
[15] W. Kim and J. Srivastava,“Enhancing real-time DBMS performance with multiversion data and priority based disk scheduling,” Proc. 12th IEEE Real-Time Systems Symp. (RTSS), Dec. 1991.
[16] C.L. Liu and J.W. Layland, “Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment,” J. ACM, vol. 20, no. 1, pp. 40-61, 1973.
[17] M. Livny,“DeNet User’s Guide, Version 1.5,” Computer Sciences Dept., Univ. of Wisconsin, Madison, 1990.
[18] M. Nakayama,M. Kitsuregawa,, and M. Takagi,“Hash-partitioned join method using dynamic destaging strategy,” Proc. 14th Int’l Conf. Very Large Data Bases, Aug. 1988.
[19] H. Pang,M. Livny,, and M.J. Carey,“Transaction scheduling in multiclass real-time database systems,” Proc. 13th IEEE Real-Time Systems Symp. (RTSS), Dec. 1992.
[20] H. Pang,M.J. Carey,, and M. Livny,“Partially preemptible hash joins,” Proc. ACM SIGMOD Conf., May 1993.
[21] H. Pang,M.J. Carey,, and M. Livny,“Memory-adaptive external sorting,” Proc. 19th Int’l Conf. Very Large Data Bases, Aug. 1993.
[22] H. Pang,M.J. Carey,, and M. Livny,“Managing memory for real-time queries,” Proc. ACM SIGMOD Conf., May 1994.
[23] K. Ramamritham,“Real-time databases,” Distributed and Parallel Databases, vol. 1, no. 2, Apr. 1993.
[24] R. Sargent, “Statistical Analysis of Simulation Output Data,” Proc. Sump. Simulation of Computer Systems, 1976.
[25] L. Shapiro, "Join Processing in Database Systems with Large Main Memories," ACM Trans. Database Systems, vol. 11, no. 3, Sept. 1986.
[26] J.A. Stankovic and W. Zhao,“On real-time transactions,” ACM SIGMOD Record, vol. 17, no. 1, Mar. 1988.
[27] P.S. Yu and D.W. Cornell,“Buffer management based on return on consumption in a multiquery environment,” VLDB J., vol. 2, no. 1, Jan. 1993.
[28] H. Zeller and J. Gray,“An adaptive hash join algorithm for multiuser environments,” Proc. 16th Int’l Conf. Very Large Data Bases, Aug. 1990.

Index Terms:
Query processing, real-time database systems, memory management, priority scheduling.
Citation:
HweeHwa Pang, Michael J. Carey, Miron Livny, "Multiclass Query Scheduling in Real-Time Database Systems," IEEE Transactions on Knowledge and Data Engineering, vol. 7, no. 4, pp. 533-551, Aug. 1995, doi:10.1109/69.404028
Usage of this product signifies your acceptance of the Terms of Use.