Skip to main content
SpringerLink
Log in

Dynamic Real-time Scheduling of Firm Periodic Tasks with Hard and Soft Aperiodic Tasks

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

Abstract

In this paper, we address the problem of the dynamic scheduling of skippable periodic task sets (i.e., period tasks allowing occasional skips of instances), together with aperiodic tasks. Scheduling of tasks is handled thanks to the merging of two existing approaches: the Skip-Over task model and the EDL (Earliest Deadline as Late as possible) aperiodic task server. The objective is to provide two on-line scheduling algorithms, namely EDL-RTO and EDL-BWP, in order to minimize the average response time of soft aperiodic requests, while ensuring that the QoS (Quality of Service) of periodic tasks will never be less than a specified bound. We also extend our results to the acceptance of sporadic tasks (i.e., aperiodic tasks with deadlines). We show that these novel scheduling algorithms have better performance compared to related algorithms regarding aperiodic response time and acceptance ratio.

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

  • Buttazzo, G.-C., and Caccamo, M. 1999. Minimizing aperiodic response times in a firm real-time environment. IEEE Transactions on Computers, 48(10): 1035–1052.

    Article  Google Scholar 

  • Buttazzo, G.-C., and Sensini, F. 1999. Optimal deadline assingnment for scheduling soft aperiodic tasks in hard real-time environments. IEEE Transactions on Software Engineering, 25(1): 22–32.

    Article  Google Scholar 

  • Caccamo, M., and Buttazzo, G. 1997. Exploiting skips in periodic tasks for enhancing aperiodic responsiveness. Proceedings of the 18th IEEE Real-Time Systems Symposium.

  • Caccamo, M., and Buttazzo, G. 1998. Optimal scheduling for fault-tolerant and firm real-time systems. Proceedings of the IEEE Real-Time Computing Systems and Applications.

  • Chetto, H., and Chetto, M. 1989. Some results of the earliest deadline scheduling algorithm. IEEE Transactions on Software Engineering, 15(10): 1261–1269.

    Article  MathSciNet  Google Scholar 

  • Chetto, H., Chetto, M. and Bouchentouf, T. 1990. Dynamic scheduling of real-time tasks under precedence constraints. The Journal of Real-Time Systems, 181–194.

  • Davis, R.-I., Tindell, K.-W., and Burns, A. 1993. Scheduling slack time in fixed priority preemptive systems. Proceedings of the Real-Time Systems Symposium, pp. 222–231.

  • Ghazalie, T.-M., and Baker, T.-P. 1995. Aperiodic servers in a deadline scheduling environment. The Journal of Real-Time Systems, 9: 21–36.

    Article  Google Scholar 

  • Hamdaoui, M., and Ramanathan, P. 1995. A dynamic priority assignment technique for streams with (m,k)-firm deadlines. IEEE Transactions on Computers, 44(4): 1443–1451.

    Google Scholar 

  • Koren, G., and Shasha, D. 1995. Skip-over algorithms and complexity for overloaded systems that allow skips. In Proceedings of the 16th IEEE Real-Time Systems Symposium.

  • Lehoczky, J.-P., and Ramos-Thuel, S. 1992. An optimal algorithm for scheduling soft-aperiodic tasks in fixed-priority preemptive systems. In Proceedings of the 13th IEEE Real-Time Systems Symposium, pp. 110–123.

  • Lehocsky, J.-P., Sha, J.-P., and Strosnider, K.-K. 1987. Enhanced aperiodic responsiveness in hard real-time environments. Proceedings of the IEEE Real-Time Systems Symposium, pp. 261–270.

  • Leung, J.-Y.-T., and Whitehead, J. 1982. On the complexity of fixed-priority scheduling of periodic real-time tasks. Performance Evaluation, 2: 237–250.

    Article  MathSciNet  Google Scholar 

  • Liu, J.-W.-S. 2000. Real-Time Systems. Prentice-Hall.

  • 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.

    MathSciNet  Google Scholar 

  • Ripoll, I., Crespo, A., and Garcia-Fornes, A. 1997. An optimal algorithm for scheduling soft aperiodic tasks in dynamic-priority preemptive systems. IEEE Transactions on Software Engineering, 23(6): 388–400.

    Article  Google Scholar 

  • Silly, M. The EDL Server for scheduling periodic and soft aperiodic tasks with resource constraints. The Journal of Real-Time Systems, 17: 1–25.

    Article  Google Scholar 

  • Silly, M., Chetto, H., and Elyounsi, N. 1990. An optimal algorithm for guaranteeing sporadic tasks in hard real-time systems. IEEE Symposium on Parallel and Distributed Processing, pp. 578–585.

  • Sprunt, B., Sha, L., and Lehoczky, J.-P. 1989. Aperiodic task sheduling for hard-real-time systems. The Journal of Real-Time Systems, 1: 27–60.

    Google Scholar 

  • Spuri, M., and Buttazzo, G.-C. 1994. Efficient aperiodic service under earliest deadline scheduling. In Proceedings of the IEEE Real-Time Systems Symposium.

  • Spuri, M., Buttazzo, G.-C., and Sensini, F. 1995. Robust aperiodic scheduling under dynamic priority systems. In Proceedings of the IEEE Real-Time Systems Symposium.

  • Spuri, M., and Buttazzo, G.-C. 1996. Scheduling aperiodic tasks in dynamic priority systems. The Journal of Real-Time Systems, 10(2).

  • Strosnider, J.-K., Lehoczky, J.-P., and Sha, L. 1995. The Deferrable server algorithm for enhanced aperiodic responsiveness in hard real-time environments. IEEE Trans. Computer, 44(1).

  • Stankovic, J.-A. 1988. A serious problem for next-generation systems. IEEE Computer, 21(10): 10–19.

    Google Scholar 

  • Tia, T.-S., Liu, J.-W.-S., and Shankar, M. 1995. Algorithms and optimality of scheduling aperiodic requests in fixed-priority preemptive systems. The Journal of Real-Time Systems.

Download references

Author information

Authors and Affiliations

  1. Institut de Recherche en Communications et Cybernetique de Nantes, University of Nantes, UMR CNRS 6597 - 1, rue de la Noë, BP 92 101, 44321, Nantes Cedex 03, France

    Audrey Marchand & Maryline Silly-Chetto

Authors
  1. Audrey Marchand
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Maryline Silly-Chetto
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Audrey Marchand guaduated in Computer Engineering at the Ecole polytechnique of the University of Nantes (France), in 2002. She is currently a PhD student at the University of Nantes. Her research interests include real-time scheduling theory, aperiodic service mechanisms, quality of service guarantees in soft real-time systems, and Linux-based real-time operating systems and applications.

Maryline Chetto received the degree of Docteur de 3ème cycle in control engineering and the degree of Habilitée à Diriger des Recherches in Computer Science from the University of Nantes, France, in 1984 and 1993, respectively. From 1984 to 1985, she held the position of Assistant professor of Computer Science at the University of Rennes, while her research was with the Institut de Recherche en Informatique et Systèmes Aléatoires, Rennes. In 1986, she returned to Nantes and is currently a professor with the Institute of Technology of the University of Nantes. She is conducting her research at IRCCyN. Her main research interests include scheduling and fault-tolerance technologies for real-time applications. She has published more than 60 journal articles and conference papers in the area of real-time operating systems. She is the leader of a French national R&D project, namely Cleopatre, supported by the French government, which aims to provide free open source real-time solutions.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Marchand, A., Silly-Chetto, M. Dynamic Real-time Scheduling of Firm Periodic Tasks with Hard and Soft Aperiodic Tasks. Real-Time Syst 32, 21–47 (2006). https://doi.org/10.1007/s11241-006-4962-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11241-006-4962-8

Keywords

Search

Navigation