Abstract
In this paper we study the problem of scheduling jobs with real-time constraints in single and multiprocessor computer systems. We show the optimality of the minimum laxity (ML) scheduling and earliest deadline (ED) scheduling policies on multiprocessors under general workload assumptions for systems in which jobs need not be served once they miss their deadlines. We also describe a discrete-time model of these policies operating on a single processor when deadlines of all jobs are uniformly bounded. The ML and ED policies described incur an overhead that has computational complexity of O(m) or O (log (m) (depending on the implementation) where m is the queue length. Hence we propose and study several efficient policies (with O (1) overhead) that provide most of the performance of the ML and ED policies. Last, we consider the problem of scheduling jobs with real-time constraints that provide increased reward as a function of execution time. We propose several greedy policies that attempt to equalize the amount of service that all jobs attain and show, through simulation and analysis, that they attain performances close to an unachievable optimistic bound.
The work reported in this paper was supported by the Office of Naval Research under grant N00014-87-K-0796.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
F. Baccelli, Z. Liu, D. Towsley, “Extremal Scheduling of Parallel Processing with and without Real-Time Constraints,” to appear in J. ACM.
P. Bhattacharya and A. Ephremides, “Optimal Scheduling with Strict Deadlines,” IEEE Trans. on Automatic ControlVol. 34, No. 7 (July 1989), pp. 721–728.
M. Boddy and T. Dean, “Solving Time-Dependent Planning Problems,” Proc. Eleventh Int. Joint Conf. on Artificial Intelligence (IJCAI-89)(Aug. 1989), pp. 979–983.
T. Dean and M. Boddy, “An Analysis of Time-Dependent Planning,” Proc. Seventh National Conf on Artificial Intelligence (AAAI-88)(Aug. 1988), pp. 49–54.
K. Decker, V. Lesser, R. Whitehair, “Extending a Blackboard Architecture for Approximate Processing,” The Journal of Real-Time SystemsVol. 2 (1989), pp. 47–79.
H. Goldberg“Analysis of the Earliest Due Date Scheduling Rule in Queueing Systems,” Mathematics of Operations ResearchVol. 2, No. 2 (May 1977), pp 145–154.
P. Goli, J. Kurose, and D. Towsley, “Approximate Minimum Laxity Scheduling Algorithms for Real-Time Systems,” Technical Report 90–88, Department of Computer and Information Science, University of Massachusetts, Amherst, MA.
J. Hong, X. Tan, D. Towsley, “A Performance Analysis of Minimum Laxity and Earliest Deadline Scheduling in a Real-Time System,” IEEE Transactions on ComputersVol. 38, No. 12, (December 1989), 1736–1744.
J. Kurose, “An Exact Analyis of Customer Loss Under Minimum Laxity Scheduling in Discrete Time Queueing Systems,” to appear in Performance Evaluation.
J.F. Kurose, D. Towsley, C.M. Krishna, “On Scheduling Tasks with Increased-Reward-With-Increased-ServicelRlS Characteristics,” Working paper.
C. Liu and J. Layland, “Scheduling Algorithms for Multi-Programming in a Hard-Real-Time Environment,” J. ACM Vol. 20, pp. 46–61, (1973).
J. Liu, in “Report on the Embedded AI Languages Workshop, Ann Arbor, MI 1988” R. Volz, T. Mudge, G. Lindstrom (ed.), University of Michigan, Jan 27, 1990.
A. Mok and M. Dertouzos, “Multiprocessor Scheduling in a Hard Real-Time Environment,” Proc. 7th Texas Conf. on Comp. Syst.(Nov. 1978).
P. Nain, D. Towsley, “Properties of the ML(n) Policy for Scheduling Jobs with Real-Time Constraints,” to appear in Proc. 29-th IEEE Control and Decision Conf.Dec. 1990.
Y. Oie, T. Suda, M. Murata, D. Kolson, M. Miyahara “Survey of Switching Techniques in High-speed Networks and Their Performance,” Proc. IEEE Infocom’90 pp.1242–1252.
S. Panwar, D. Towsley and J. Wolf, “Optimal Scheduling Policies for a Class of Queues with Customer Deadlines to the Beginning of Service,” J. of the ACM Vol.35, No. 4 (Oct.1988 )pp. 832–844.
D. Towsley and S. Panwar, “Comparison of Service and Buffer Overflow Policies for Multiple Server Queues that Serve Customers with Deadlines,” COINS Technical Report 89–72, University of Massachusetts, Amherst MA, (July, 1989).
W. Zhao, J.A. Stankovic, “Performance Evaluation of FCFS and improved FCFS Scheduling for Dynamic Real-Time Computer Systems,” Proc. Real-Time Systems Symposium(Dec. 1989), pp. 156165.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer Science+Business Media New York
About this chapter
Cite this chapter
Kurose, J.F., Towsley, D., Krishna, C.M. (1991). Design and Analysis of Processor Scheduling Policies for Real-Time Systems. In: van Tilborg, A.M., Koob, G.M. (eds) Foundations of Real-Time Computing: Scheduling and Resource Management. The Springer International Series in Engineering and Computer Science, vol 141. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-3956-8_3
Download citation
DOI: https://doi.org/10.1007/978-1-4615-3956-8_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-6766-6
Online ISBN: 978-1-4615-3956-8
eBook Packages: Springer Book Archive