Skip to main content
SpringerLink
Log in

Dynamic priority scheduling of periodic and aperiodic tasks in hard real-time systems

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

Abstract

This paper addresses the problem of scheduling aperiodic tasks in real-time systems. The proposed scheme combines the Earliest-Deadline-First algorithm for scheduling periodic tasks with the Deferrable Server approach for servicing aperiodic tasks. Necessary and sufficient conditions are derived for guaranteeing feasibility of a given periodic task set when a deferrable server is present. An analytic model is proposed for selecting the best feasible period and computation time of the server to minimize the mean response time of aperiodic tasks. An evaluation of the proposed model using a simulator indicates that the server parameters selected by the model result in mean response times that are close to the best mean response time determined by the simulator.

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

  • Chetto, H., Silly, M., and Bouchentoul, T. 1990. Dynamic scheduling of real-time tasks under precedence constraints.Real-Time Systems, 2(3):181–194.

    Google Scholar 

  • Jeffay, K. 1989. Analysis of a synchronization and scheduling discipline for real-time tasks with preemption constraints. InProceedings of Real-Time Systems Symposium, December, pp. 295–305.

  • Kleinrock, L. 1975.Queueing Systems. Vol. I: Theory. New York: John Wiley.

    Google Scholar 

  • Lehoczky, J. P., and Ramos-Thuel, S. 1992. An optimal algorithm for scheduling soft-aperiodic tasks in real-time systems. InProceedings of Real-Time Systems Symposium, December, pp. 110–123.

  • Lehoczky, J. P, Sha, L., and Strosnider, J. K. 1987. Enhanced aperiodic responsiveness in hard real-time environments. InProceedings of Real-Time Systems Symposium, December, pp. 261–270.

  • Lin, T. H., and Tarng, W. 1991. Scheduling periodic and aperiodic tasks in hard real-time computing systems. InProceedings ACM Sigmetrics Conference on Measurement and Modeling of Computer Systems, May, pp. 31–38.

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

    Google Scholar 

  • Molini, J. J., Maimon, S. K., and Watson, P. H. 1990. Real-time system scenarios. InProceedings of Real-Time Systems Symposium, December, pp. 214–225.

  • Sprunt, B., Sha, L., and Lehoczky, J. 1989. Aperiodic task scheduling for hard real-time systems.Real-Time Systems, 1(1):27–60.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical and Computer Engineering, University of Wisconsin-Madison, 53706-1691, Madison, WI

    Nima Homayoun & Parameswaran Ramanathan

Authors
  1. Nima Homayoun
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Parameswaran Ramanathan
    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

Homayoun, N., Ramanathan, P. Dynamic priority scheduling of periodic and aperiodic tasks in hard real-time systems. Real-Time Syst 6, 207–232 (1994). https://doi.org/10.1007/BF01088596

Download citation

  • Issue Date:

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

Keywords

Search

Navigation