Skip to main content
SpringerLink
Log in

The Non-preemptive Scheduling of Periodic Tasks upon Multiprocessors

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

Abstract

The non-preemptive scheduling of periodic task systems upon processing platforms comprised of several identical processors is considered. The exact problem has previously been proven intractable even upon single processors; sufficient conditions are presented here for determining whether a given periodic task system will meet all deadlines if scheduled non-preemptively upon a multiprocessor platform using the earliest-deadline first scheduling algorithm.

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

  • Abdelzaher, T., Andersson, B., Jonsson, J., Sharma, V. and Nguyen, M. 2002. The aperiodic multiprocessor utilization bound for liquid tasks. In Proceedings of the Eighth IEEE Real-Time and Embedded Technology and Applications Symposium, San Jose, California, IEEE Computer Society Press.

    Google Scholar 

  • Anderson, J. and Srinivasan, A. 2002a. Early release fair scheduling. In Proceedings of the EuroMicro Conference on Real-Time Systems, Stockholm, Sweden, IEEE Computer Society Press, pp. 35–43.

    Google Scholar 

  • Anderson, J. and Srinivasan, A. 2002b. Pfair scheduling: Beyond periodic task systems. In Proceedings of the International Conference on Real-Time Computing Systems and Applications, Cheju Island, South Korea, IEEE Computer Society Press.

    Google Scholar 

  • Anderson, J. and Srinivasan, A. 2001. Mixed Pfair/ERfair scheduling of asynchronous periodic tasks. In Proceedings of the EuroMicro Conference on Real-Time Systems, Delft, The Netherlands, IEEE Computer Society Press.

    Google Scholar 

  • Baruah, S., Cohen, N., Plaxton, G. and Varvel, D. 1996. Proportionate progress: A notion of fairness in resource allocation. Algorithmica 15(6):600–625.

    MathSciNet  Google Scholar 

  • Baruah, S. and Lin, S.-S. 1998. Pfair scheduling of generalized pinwheel task systems. IEEE Transactions on Computers, 47(7).

  • Cai, Y. and Kong, M. C. 1996. Nonpreemptive scheduling of periodic tasks in uni- and multiprocessor systems. Algorithmica, 15(6):572–599.

    MathSciNet  Google Scholar 

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

  • Goossens, J., Funk, S. and Baruah, S. 2003. Priority-driven scheduling of periodic task systems on multiprocessors. Real Time Systems 25(2–3):187–205.

    Google Scholar 

  • Howell, R. and Venkatrao, M. 1995. On non-preemptive scheduling of recurring tasks using inserted idle times. Information and Computation, 117:50–62.

    Article  Google Scholar 

  • Jeffay, K., Stanat, D. and Martel, C. 1991. On non-preemptive scheduling of periodic and sporadic tasks. In Proceedings of the 12th Real-Time Systems Symposium, San Antonio, Texas, IEEE Computer Society Press, pp. 129–139.

    Google Scholar 

  • Liu, C. L. 1969. Scheduling algorithms for multiprocessors in a hard real-time environment. JPL Space Programs Summary 37-60 II:28–31.

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  • Moir, M. and Ramamurthy, S. 1999. Pfair scheduling of fixed and migrating tasks on multiple resources. In Proceedings of the Real-Time Systems Symposium, Phoenix, AZ, IEEE Computer Society Press.

    Google Scholar 

  • Phillips, C. A., Stein, C., Torng, E. and Wein, J. 1997. Optimal time-critical scheduling via resource augmentation. In Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, El Paso, Texas, pp. 140–149.

Download references

Author information

Authors and Affiliations

  1. The University of North Carolina, North Carolina

    Sanjoy K. Baruah

Authors
  1. Sanjoy K. Baruah
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Supported in part by the National Science Foundation (Grant Nos. CCR-9988327 and ITR-0082866).

Sanjoy Baruah is a professor of Computer Science at the University of North Carolina at Chapel Hill. He received his Ph.D. from the University of Texas at Austin in 1993. His research and teaching interests are in scheduling theory, real-time and safety-critical system design, and resource-allocation and sharing in distributed computing environments.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Baruah, S.K. The Non-preemptive Scheduling of Periodic Tasks upon Multiprocessors. Real-Time Syst 32, 9–20 (2006). https://doi.org/10.1007/s11241-006-4961-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11241-006-4961-9

Keywords

Search

Navigation