This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Optimal Reward-Based Scheduling for Periodic Real-Time Tasks
February 2001 (vol. 50 no. 2)
pp. 111-130

Abstract—Reward-based scheduling refers to the problem in which there is a reward associated with the execution of a task. In our framework, each real-time task comprises a mandatory and an optional part. The mandatory part must complete before the task's deadline, while a nondecreasing reward function is associated with the execution of the optional part, which can be interrupted at any time. Imprecise computation and Increased-Reward-with-Increased-Service models fall within the scope of this framework. In this paper, we address the reward-based scheduling problem for periodic tasks. An optimal schedule is one where mandatory parts complete in a timely manner and the weighted average reward is maximized. For linear and concave reward functions, which are most common, we 1) show the existence of an optimal schedule where the optional service time of a task is constant at every instance and 2) show how to efficiently compute this service time. We also prove the optimality of Rate Monotonic Scheduling (with harmonic periods), Earliest Deadline First, and Least Laxity First policies for the case of uniprocessors when used with the optimal service times we computed. Moreover, we extend our result by showing that any policy which can fully utilize all the processors is also optimal for the multiprocessor periodic reward-based scheduling. To show that our optimal solution is pushing the limits of reward-based scheduling, we further prove that, when the reward functions are convex, the problem becomes NP-Hard. Our static optimal solution, besides providing considerable reward improvements over the previous suboptimal strategies, also has a major practical benefit: Run-time overhead is eliminated and existing scheduling disciplines may be used without modification with the computed optimal service times.

[1] S. Baruah, "Fairness in Periodic Real-Time Scheduling," Proc. 16th Real-Time Systems Symp., pp. 200-209,Pisa, Italy, 1995.
[2] G. Bernat and A. Burns, "Combining (n, m)-Hard Deadlines and Dual Priority Scheduling," Proc. IEEE Real-Time Systems Symp.,San Francisco, pp. 46-57, Dec. 1997.
[3] A. Bertossi and L.V. Mancini, “Scheduling Algorithms for Fault-Tolerance in Hard-Real-Time Systems,” Real-Time Systems, vol. 7, no. 3, pp. 229-245, 1994.
[4] M. Boddy and T. Dean, “Solving Time-Dependent Planning Problems,” Proc. 11th Int'l Joint Conf. Artificial Intelligence (IJCAI-89), pp. 979-984, Aug. 1989.
[5] 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, pp. 574-577, July 1993.
[6] E. Chang and A. Zakhor, “Scalable Video Data Placement on Parallel Disk Data Arrays,” Proc. ISIT/SPIE Symp. Electronic Imaging Science and Technology, pp. 208-223, Feb. 1994.
[7] J.Y. Chung,J.W.S. Liu,, and K.J. Lin,“Scheduling Periodic Jobs That Allows Imprecise Results,” IEEE Transactions on Computers, vol.19, no. 9, pp. 1156-1173, September 1990.
[8] W. Feng and J. Liu, “Algorithms for Scheduling Real-Time Tasks with Input Error and End-to-End Deadlines,” IEEE Trans. Software Eng., vol. 23, no. 2, Feb. 1997.
[9] W. Feng and J.W.-S. Liu, “An Extended Imprecise Computation Model for Time-Constrained Speech Processing and Generation,” Proc. IEEE Workshop Real-Time Applications, pp. 76-80, May 1993.
[10] J. Grass and S. Zilberstein, “A Value-Driven System for Autonomous Information Gathering,” J. Intelligent Information Systems, vol. 14, pp. 5-27, Mar. 2000.
[11] M. Hamdaoui and P. Ramanathan, "A Dynamic Priority Assignment Technique for Streams with (m, k)-Firm Deadlines," IEEE Trans. Computers, vol. 44, no. 12, pp. 1,443-1,451, Dec. 1995.
[12] ——,“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.
[13] E.J. Horvitz, “Reasoning under Varying and Uncertain Resource Constraints,” Proc. Seventh Nat'l Conf. Artificial Intelligence (AAAI-88), pp. 111-116, Aug. 1988.
[14] 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.
[15] J.K. Dey, J. Kurose, and D. Towsley, On-Line Scheduling Policies for a Class of IRIS (Increasing Reward with Increasing Service) Real-Time Tasks IEEE Trans. Computers, vol. 45, no. 7, pp. 802-813, July 1996.
[16] G. Koren and D. Shasha, "Skip-Over: Algorithms and Complexity for Overloaded Systems that Allow Skips," Proc. IEEE Real-Time System Symp., pp. 110-117,Pisa, Italy, Dec. 1995.
[17] R.E. Korf,“Real-time heuristic search,” Artificial Intelligence, vol. 42, nos. 2-3, pp. 189-211, Mar. 1990.
[18] C.M. Krishna and K.G. Shin, Real-Time Systems. New York: McGraw-Hill, 1997.
[19] K.-J. Lin, S. Natarajan, and J.W.-S. Liu, “Imprecise Results: Utilizing Partial Computations in Real-Time Systems,” Proc. Eighth IEEE Real-Time Systems Symp., pp. 210-217, Dec. 1987.
[20] 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.
[21] 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.
[22] D. Luenberger, Linear and Nonlinear Programming. Reading Mass.: Addison-Wesley, 1984.
[23] A.K. Mok, “Fundamental Design Problems of Distributed systems for the Hard Real-Time Environment,” PhD dissertation, Massachusetts Inst. of Tech nology, 1983.
[24] M.J. Panik, Classical Optimization: Foundations and Extensions. Amsterdam: North-Holland, 1976.
[25] R. Rajkumar, C. Lee, J. Lehoczky, and D. Siewiorek, A Resource Allocation Model for QoS Management Proc. 19th IEEE Real-Time Systems Symp. (RTSS), pp. 298-307, 1997.
[26] 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.
[27] 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.
[28] S.V. Vrbsky and J.W.S. Liu, "APPROXIMATE: A Query Processor that Produces Monotonically Improving Approximate Answers," IEEE Trans. Knowledge and Data Eng., vol. 5, no. 6, pp. 1,056-1,068, Dec. 1993.
[29] S. Zilberstein and S.J. Russell, “Anytime Sensing, Planning and Action: A Practical Model for Robot Control,” Proc. 13th Int'l Joint Confs. Artificial Intelligence, pp. 1402-1407, 1993.

Index Terms:
Real-time systems, imprecise computation, periodic task scheduling, deadline scheduling, reward maximization.
Citation:
Hakan Aydin, Rami Melhem, Daniel Mossé, Pedro Mejía-Alvarez, "Optimal Reward-Based Scheduling for Periodic Real-Time Tasks," IEEE Transactions on Computers, vol. 50, no. 2, pp. 111-130, Feb. 2001, doi:10.1109/12.908988
Usage of this product signifies your acceptance of the Terms of Use.