Scheduling Jobs with Multiple Feasible Intervals

  • Chi-sheng Shih
  • Jane W. S. Liu
  • Infan Kuok Cheong
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2968)


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.


Completion Rate Feasible Schedule Schedulability Analysis System Workload Feasible Interval 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 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. 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. 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
  4. 4.
    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)CrossRefGoogle Scholar
  5. 5.
    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)MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Liu, C.L., Layland, J.: Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of the ACM 20(1), 46–61 (1973)MATHCrossRefMathSciNetGoogle Scholar
  7. 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. 8.
    Sprunt, B., Sha, L., Lehoczky, J.: Aperiodic task scheduling for hard-real-time systems. Real-time Systems Journal (July 1989)Google Scholar
  9. 9.
    Garey, M.R., Johnson, D.S.: Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman, New York (1979)MATHGoogle Scholar
  10. 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. 11.
    Liu, J.W.-S.: Real-Time Systems. Prentice Hall Inc., Englewood Cliffs (2000)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Chi-sheng Shih
    • 1
  • Jane W. S. Liu
    • 2
  • Infan Kuok Cheong
    • 3
  1. 1.University of IllinoisUrbanaUSA
  2. 2.Microsoft CorporationRedmondUSA
  3. 3.BMC Software, Inc.AustinUSA

Personalised recommendations