This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On-Line Scheduling Policies for a Class of IRIS (Increasing Reward with Increasing Service) Real-Time Tasks
July 1996 (vol. 45 no. 7)
pp. 802-813

Abstract—We consider a real-time task model where a task receives a "reward" that depends on the amount of service received prior to its deadline. The reward of the task is assumed to be an increasing function of the amount of service that it receives, i.e., the task has the property that it receives increasing reward with increasing service (IRIS). We focus on the problem of on-line scheduling of a random arrival sequence of IRIS tasks on a single processor with the goal of maximizing the average reward accrued per task and per unit time. We describe and evaluate several policies for this system through simulation and through a comparison with an unachievable upper bound. We observe that the best performance is exhibited by a two-level policy where the top-level algorithm is responsible for allocating the amount of service to tasks and the bottom-level algorithm, using the earliest deadline first (EDF) rule, is responsible for determining the order in which tasks are executed. Furthermore, the performance of this policy approaches the theoretical upper bound in many cases. We also show that the average number of preemptions of a task under this two-level policy is very small.

[1] J.A. Stankovic and K. Ramamritham, Tutorial Hard Real-Time Systems. IEEE CS Press, 1986.
[2] M. Boddy and T. Dean, "Solving Time-Dependent Planning Problems," Proc. 11th Int'l Joint Conf. Artificial Intelligence (IJCAI-89), pp. 979-984,Detroit, Aug. 1989.
[3] M. Boddy and T. Dean, "Deliberation Scheduling for Problem Solving in Time-Constrained Environments," Artificial Intelligence, vol. 67, no. 2, pp. 245-285, June 1994.
[4] T. Dean and M. Boddy, "An Analysis of Time-Dependent Planning," Proc. Seventh Nat'l Conf. Artificial Intelligence (AAAI-88), pp. 49-54,St. Paul, Minn., Aug. 1988.
[5] K.S. Decker, V.R. Lesser, and R.C. Whitehair, "Extending a Blackboard Architecture for Approximate Processing," J. Real-Time Systems, vol. 2, pp. 47-79, 1990.
[6] J. Liu, "Timing Constraints and Algorithms," Report on the Embedded AI Languages Workshop, pp. 9-11, Univ. of Michigan, Nov. 1988.
[7] E. Chang and A. Zakhor, "Scalable Video Coding Using 3-D Subband Velocity Coding and Multi-Rate Quantization," Proc. IEEE Int'l Conf. Acoustics, Speech, and Signal Processing,Minneapolis, July 1993.
[8] E. Chang and A. Zakhor, "Scalable Video Data Placement on Parallel Disk Arrays," Proc. IS&T/SPIE Symp. Electronic Imaging Science and Technology, pp. 208-221,San Jose, Calif., Feb. 1994.
[9] International Organization for Standardization, "ISO/IEC JTC1/SC29/WG11 MPEG93/457, Coding of Moving Pictures and Associated Audio, MPEG-2 Systems Working Draft," Nov. 1993.
[10] C.J. Turner and L.L. Peterson, "Image Transfer: An End-to-End Design," Proc. SIGCOMM Symp. Comm. Architectures and Protocols, pp. 258-268,Baltimore, Aug. 1992.
[11] ——,“Architectural foundations for real-time performance in intelligent agents,”Real-Time Systems: The International Journal of Time-Critical Computing Systems,vol. 2, pp. 99–125, 1990.
[12] R.E. Korf, "Depth-Limited Search for Real-Time Problem Solving," J. Real-Time Systems, vol. 2, pp. 7-24, 1990.
[13] R.E. Korf,“Real-time heuristic search,” Artificial Intelligence, vol. 42, nos. 2-3, pp. 189-211, Mar. 1990.
[14] K.P. Smith and J.W.S. Liu, "Monotonically Improving Approximate Answers to Relational Algebra Queries," Proc. Compsac, Sept. 1989.
[15] S.V. Vrbsky and J.W.S. Liu, "Producing Monotonically Improving Approximate Answers to Database Queries," Proc. IEEE Workshop Imprecise and Approximate Computation, pp. 72-76,Phoenix, Ariz., Dec. 1992.
[16] E.J. Horvitz, "Reasoning under Varying and Uncertain Resource Constraints," Proc. Seventh Nat'l Conf. Artificial Intelligence (AAAI-88), pp. 111-116,St. Paul,Minn., Aug. 1988.
[17] P. Maragos and F.K. Sun, "Measuring the Fractal Dimension of Signals: Morphological Covers and Iterative Optimization," IEEE Trans. Signal Processing, vol. 41, no. 1, pp. 108-121, Jan. 1993.
[18] E.G. Coffman, A. Lenstra, and Z. Liu, Scheduling Theory and Its Applications.New York: Wiley, 1995.
[19] E.G. Coffman et al., Computer and Job-Shop Scheduling Theory.New York: Wiley, 1976.
[20] A. Van Tilborg, Foundations of Real-Time Computing: Scheduling and Resource Management. Kluwer, 1991.
[21] J.A. Stankovic, M. Spuri, M. Di Natale, and G. Buttazzo, “Implications of Classical Scheduling Results for Real-Time Systems,” IEEE Computer, vol. 28, no. 6, June 1995.
[22] D. Towsley, "Applications of Sample Path Analysis Techniques to Communication Networks," Proc. Fourth Conf. Data Comm. Systems and Their Performance,Barcelona, June 1990.
[23] J.W.S. Liu,K.J. Lin,W.K. Shih,J.Y. Chung,A. Yu,, and W. Zhao,“Algorithms for Scheduling Imprecise Computations,” IEEE Computer, pp. 58-68, May 1991.
[24] W.K. Shih,J.W.S. Liu,, and J.Y. Chung,“Fast Algorithms for Scheduling Imprecise Computations,” SIAM J. on Computing, vol. 20, no. 3, July 1991.
[25] W. Shih and J. Liu, "On-Line Scheduling of Imprecise Computations to Minimize Error," Proc. Real-Time Systems Symp., Dec. 1992.
[26] B.G. Kim and D. Towsley, "Dynamic Flow Control Protocols for Packet-Switching Multiplexers Serving Real-Time Multipacket Messages," IEEE Trans. Comm., vol. 4, pp. 348-356, Apr. 1986.
[27] E.K.P. Chong and W. Zhao, "Performance Evaluation of Scheduling Algorithms for Imprecise Computer Systems," J. Systems and Software, vol. 15, no. 3, pp. 261-277, July 1991.
[28] W. Zhao, S. Vrbsky, and J.W.S. Liu, "Performance of Scheduling Algorithms for Multi-Server Imprecise Systems," Proc. Fifth Int'l Conf. Parallel and Distributed Computing and Systems, Oct. 1992.
[29] S.A. Lippman, "Applying a New Device in the Optimization of Exponential Queueing Systems," Operations Research, vol. 23, no. 4, pp. 687-710, 1975.
[30] S.B. Gershwin, "Hierarchical Flow Control: A Framework for Scheduling and Planning Discrete Events in Manufacturing Systems," Proc. IEEE, vol. 77, no. 1, pp. 195-209, Jan. 1989.
[31] K.M. Mjelde, Methods of the Allocation of Limited Resources.New York: John Wiley&Sons, 1983.
[32] D.G. Luenberger, Linear and Nonlinear Programming.Reading, Mass.: Addison-Wesley, 1984.
[33] J. Dey, J. Kurose, D. Towsley, C. Krishna, and M. Girkar, "Efficient On-Line Processor Scheduling for a Class of IRIS Real-Time Tasks," Proc. 13th ACM SIGMETRICS Conf., pp. 217-228,Santa Clara, Calif., May 1993.
[34] 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.
[35] S. Ross, Stochastic Processes.New York: Wiley, 1983.

Index Terms:
Real-time systems, on-line scheduling, deadline based scheduling, priority scheduling, reward functions for tasks, maximizing reward rates.
Citation:
Jayanta K. Dey, James Kurose, Don Towsley, "On-Line Scheduling Policies for a Class of IRIS (Increasing Reward with Increasing Service) Real-Time Tasks," IEEE Transactions on Computers, vol. 45, no. 7, pp. 802-813, July 1996, doi:10.1109/12.508319
Usage of this product signifies your acceptance of the Terms of Use.