Scheduling Jobs with Multiple Feasible Intervals
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.
Unable to display preview. Download preview PDF.
- 1.Cheong, I.K.: Scheduling Imprecise Hard Real-Time Jobs with Cumulative Error. PhD thesis, University of Illinois at Urbana-Champaign (1992)Google Scholar
- 2.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)Google Scholar
- 3.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)Google Scholar
- 7.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)Google Scholar
- 8.Sprunt, B., Sha, L., Lehoczky, J.: Aperiodic task scheduling for hard-real-time systems. Real-time Systems Journal (July 1989)Google Scholar
- 10.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)Google Scholar
- 11.Liu, J.W.-S.: Real-Time Systems. Prentice Hall Inc., Englewood Cliffs (2000)Google Scholar