Abstract
This paper addresses the problem of scheduling real-time jobs that have multiple feasible intervals. The problem is NP-hard. We present an optimal branch-and-bound algorithm. When there is time to compute the schedule, this algorithm can be used. Otherwise, the simple heuristics presented here can be used. In addition, a priority-boosting EDF algorithm is designed to enhance the timeliness of jobs. Simulation results show that the combined use of the heuristics and the priority boosting EDF algorithm performs nearly as well as the optimal algorithm.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Cheong, I.K.: Scheduling Imprecise Hard Real-Time Jobs with Cumulative Error. PhD thesis, University of Illinois at Urbana-Champaign (1992)
Koren, G., Shasha, D.: Skip-over: Algorithms and complexity for overloaded systems that allow skips. In: Proceedings of the IEEE Real-Time Systems Symposium, pp. 110–117 (1995)
Aydin, H., Mejia-Alvarez, P., Melhem, R.G., Mossè, D.: Optimal reward-based scheduling of periodic real-time tasks. In: Proceedings of the IEEE Real-Time Systems Symposium, pp. 79–89 (1999)
Chung, J.-Y., Liu, J.W.-S., Lin, K.-J.: Scheduling periodic jobs that allow imprecise results. IEEE Transaction on Computers 39(9), 1156–1175 (1990)
Hamdaoui, M., Ramanathan, P.: A dynamic priority assignment technique for streams with (m, k)-firm deadlines. IEEE Transaction on Computers 44(12), 1443–1451 (1995)
Liu, C.L., Layland, J.: Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of the ACM 20(1), 46–61 (1973)
Han, C.-C., Lin, K.-J.: Scheduling distance-constrained real-time tasks. In: Proceedings of the IEEE Real-Time Systems Symposium, pp. 300–308 (December 1992)
Sprunt, B., Sha, L., Lehoczky, J.: Aperiodic task scheduling for hard-real-time systems. Real-time Systems Journal (July 1989)
Garey, M.R., Johnson, D.S.: Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman, New York (1979)
Deng, Z., Liu, J.W.-S., Sun, J.: A scheme for scheduling hard real-time application in open system environment. In: Proceedings of the 9th Euromicro Conference on Real-Time Systems, Toledo, Spain, June 1997, pp. 191–199. IEEE, Los Alamitos (1997)
Liu, J.W.-S.: Real-Time Systems. Prentice Hall Inc., Englewood Cliffs (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shih, Cs., Liu, J.W.S., Cheong, I.K. (2004). Scheduling Jobs with Multiple Feasible Intervals. In: Chen, J., Hong, S. (eds) Real-Time and Embedded Computing Systems and Applications. RTCSA 2003. Lecture Notes in Computer Science, vol 2968. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24686-2_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-24686-2_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21974-3
Online ISBN: 978-3-540-24686-2
eBook Packages: Springer Book Archive