Skip to main content
SpringerLink
Log in

Aperiodic task scheduling for Hard-Real-Time systems

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

Abstract

A real-time system consists of both aperiodic and periodic tasks. Periodic tasks have regular arrival times and hard deadlines. Aperiodic tasks have irregular arrival times and either soft or hard deadlines. In this article, we present a new algorithm, the Sporadic Server algorithm, which greatly improves response times for soft deadline aperiodic tasks and can guarantee hard deadlines for both periodic and aperiodic tasks. The operation of the Sporadic Server algorithm, its performance, and schedulability analysis are discussed and compared with previously published aperiodic service algorithms.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

  • BorgerM. W. 1987.VAXELN Experimentation: Programming a Real-Time Periodic Task Dispatcher using VAXELN Ada 1.1 Software Engineering Institute, Carnegie Mellon University, Pittsburgh, PA 15213.

    Google Scholar 

  • LehoczkyJ. P., L.Sha, and Y.Ding. 1987.The Rate Monotonic Scheduling Algorithm: Exact Characterization and Average Case Behavior. Department of Statistics, Carnegie Mellon University, Pittsburgh, PA 15213.

    Google Scholar 

  • Lehoczky, J. P., L. Sha, and J. K. Strosnider. 1987. Enhanced Aperiodic Responsiveness in Hard-Real-Time Environments.Proc. IEEE Real-Time Systems Symposium, San Jose, CA, pp. 261–270.

  • LeungJ. Y.-T., and J.Whitehead. 1982. On the Complexity of Fixed-Priority Scheduling of Periodic Real-Time Tasks.Performance Evaluation 2: 237–250.

    Article  MathSciNet  Google Scholar 

  • LiuC. L., and J. W.Layland. 1973. Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment.JACM 20 (January): 46–61.

    Article  MathSciNet  Google Scholar 

  • Mok, A. K.-L. 1983. Fundamental Design Problems of Distributed Systems for the Hard-Real-Time Environment. Ph.D. Dissertation, M.I.T., Cambridge, MA 02139.

  • Sha, L., and J. Goodenough. 1988.Real-Time Scheduling Theory in Ada. Software Engineering Institute, Carnegie Mellon University.

  • Sha, L., J. P. Lehoczky, and R. Rajkumar. 1986. Solutions for Some Practical Problems in Prioritized Preemptive Scheduling.Proc. IEEE Real-Time Systems Symposium, New Orleans, LA, pp. 181–191.

  • ShaL., R.Rajkumar, and J. P.Lehoczky. 1987.Priority Inheritance Protocols: An Approach to Real-Time Synchronization. Technical Report CMU-CS-87-181, Computer Science Department, Carnegie Mellon University, Pittsburgh, PA 15213.

    Google Scholar 

  • Sprunt, B., Sha L., and Lehoczky, J. P. 1988.Scheduling Sporadic and Aperiodic Events in a Hard Real-Time System. Software Engineering Institute, Carnegie Mellon University. Submitted for publication.

  • Sprunt, B., J. P. Lehoczky, and L. Sha. 1988. Exploiting Unused Periodic Time for Aperiodic Service using the Extended Priority Exchange Algorith.Proc. IEEE Real-Time Systems Symposium, Huntsville, AL.

  • Strosnider, J. K. 1988. Highly Responsive Real-Time Token Rings. Ph. D. Dissertation, Carnegie Mellon University, Pittsburgh, PA 15213.

Download references

Author information

Authors and Affiliations

  1. Department of Electrical and Computer Engineering, Carnegie Mellon University, 15213, Pittsburgh, PA, USA

    Brinkley Sprunt

  2. Department of Computer Science, Carnegie Mellon University, 15213, Pittsburgh, PA, USA

    Lui Sha

  3. Software Engineering Institute, Carnegie Mellon University, 15213, Pittsburgh, PA, USA

    Lui Sha

  4. Department of Statistics, Carnegie Mellon University, 15213, Pittsburgh, PA, USA

    John Lehoczky

Authors
  1. Brinkley Sprunt
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lui Sha
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. John Lehoczky
    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

Sprunt, B., Sha, L. & Lehoczky, J. Aperiodic task scheduling for Hard-Real-Time systems. Real-Time Syst 1, 27–60 (1989). https://doi.org/10.1007/BF02341920

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02341920

Keywords

Search

Navigation