Skip to main content
SpringerLink
Log in

Utilization Bounds for EDF Scheduling on Real-Time Multiprocessor Systems

  • Published:
Real-Time Systems Aims and scope Submit manuscript

Abstract

The utilization bound for earliest deadline first (EDF) scheduling is extended from uniprocessors to homogeneous multiprocessor systems with partitioning strategies. First results are provided for a basic task model, which includes periodic and independent tasks with deadlines equal to periods. Since the multiprocessor utilization bounds depend on the allocation algorithm, different allocation algorithms have been considered, ranging from simple heuristics to optimal allocation algorithms. As multiprocessor utilization bounds for EDF scheduling depend strongly on task sizes, all these bounds have been obtained as a function of a parameter which takes task sizes into account. Theoretically, the utilization bounds for multiprocessor EDF scheduling can be considered a partial solution to the bin-packing problem, which is known to be NP-complete. The basic task model is extended to include resource sharing, release jitter, deadlines less than periods, aperiodic tasks, non-preemptive sections, context switches, and mode changes.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Baker, T. 1991. Stack-based scheduling of real-time processes. Real-Time Systems 3(1): 301-324.

    Google Scholar 

  • Bernat, G., and Burns, A. 1999. New results on fixed priority aperiodic servers. In Proceedings of the Real-Time Systems Symposium.

  • Burchard, A., Liebeherr, J., Oh, Y., and Son, S. 1995. New strategies for assigning real-time tasks to multiprocessor systems. IEEE Transactions on Computers 44(12).

  • Buttazzo, G. 1997. Hard Real-Time Computing Systems. Predictable Scheduling Algorithms and Applications. Boston/Dordrecht/London: Kluwer Academic Publishers, Chapter 7.

    Google Scholar 

  • Dall, S., and Liu, C. 1978. On a real-time scheduling problem. Operations Research 6(1): 127-140.

    Google Scholar 

  • Davari, S., and Dhall, S. 1986a. On a periodic real-time task allocation problem. In Annual International Conference on Systems Sciences, pp. 133-141.

  • Davari, S., and Dhall, S. 1986b. An on line algorithm for real time tasks allocation. In Proceedings of the IEEE Real-Time Systems Symposium, pp. 194-200.

  • Dertouzos, M. L. 1974. Control robotics: the procedural control of physical processes. In Proceedings of IFIP Congress, pp. 807-813.

  • Dertouzos, M. L., and Mok, A. K. 1989. Multiprocessor on-line scheduling of hard-real-time tasks. Transactions on Software Engineering 15(12): 1497-1506.

    Google Scholar 

  • Garey, M., and Johnson, D. 1979. Computers and Intractability. New York: W. H. Freman.

    Google Scholar 

  • Lauzac, S., Melhem, R., and Mossé, D. 1998. An efficient rms admission control and its application to multiprocessor scheduling. In Proceedings of the International Parallel Processing Symposium, pp. 511-518.

  • Liu, C., and Layland, J. 1973. Scheduling algorithms for multiprogramming in a hard-real-time environment. Journal of the ACM 20(1): 46-61.

    Google Scholar 

  • López, J. Díaz, J. Garía, M., and García, D. 2003. Utilization bounds for multiprocessor rate-monotonic scheduling. Real-Time Systems 24(1): 5-28.

    Google Scholar 

  • Oh, D., and Baker, T. 1998. Utilization bounds for N-processor rate monotone scheduling with static processor assignment. Real-Time Systems 15(2): 183-193.

    Google Scholar 

  • Oh, Y., and Son, S. 1995. Allocating fixed-priority periodic tasks on multiprocessor systems. Real-Time Systems 9(3): 207-239.

    Google Scholar 

  • Pedro, P., and Burns, A. 1998. Schedulability changes for mode changes in flexible real-time systems. In Proceedings of the Euromicro Workshop on Real Time Systems, pp. 172-179.

  • Sáez, S., Vila, J., and Crespo, A. 1998. Using exact feasibility tests for allocating real-time tasks in multiprocessor systems. In Proceedings of the 10th Euromicro Workshop on Real-Time Systems, pp. 53-60.

  • Tindell, K., Burns, A., and Wellings, A. 1994. An extendible approach for analyzing fixed priority hard real-time tasks. Real-Time Systems 6(2): 133-151.

    Google Scholar 

  • Tindell, K., and Clark, J. 1994. Holistic schedulability analysis for distributed hard real-time systems. Microprocessing and Microprogramming 40: 117-134.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departamento de Informática, Universidad de Oviedo, Gijón, 33204, Spain

    J. M. López, J. L. Díaz & D. F. García

Authors
  1. J. M. López
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. L. Díaz
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. D. F. García
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

López, J.M., Díaz, J.L. & García, D.F. Utilization Bounds for EDF Scheduling on Real-Time Multiprocessor Systems. Real-Time Systems 28, 39–68 (2004). https://doi.org/10.1023/B:TIME.0000033378.56741.14

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:TIME.0000033378.56741.14

Search

Navigation