Skip to main content
SpringerLink
Log in

Scheduling algorithms based on weakly hard real-time constraints

  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

The problem of scheduling weakly hard real-time tasks is addressed in this paper. The paper first analyzes the characters of μ-pattern and weakly hard real-time constraints, then, presents two scheduling algorithms, Meet Any Algorithm and Meet Row Algorithm, for weakly hard real-time systems. Different from traditional algorithms used to guarantee deadlines, Meet Any Algorithm and Meet Row Algorithm can guarantee both deadlines and constraints. Meet Any Algorithm and Meet Row Algorithm try to find out the probabilities of tasks breaking constraints and increase task’s priority in advance, but not till the last moment. Simulation results show that these two algorithms are better than other scheduling algorithms dealing with constraints and can largely decrease worst-case computation time of real-time tasks.

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

  1. Bernat G, Burns A, Llamosi A. Weakly hard real-time systems.IEEE Trans. Computers, 2001, 50(4): 308–330.

    Article  MathSciNet  Google Scholar 

  2. Bernat G, Burns A. Specification and analysis of weakly hard real-time systems [Dissertation]. Department de Ciencies Matematiques Informatica, Universitat de les Illes Balears, Spain, Jan. 1998.

    Google Scholar 

  3. Bernat G, Burns A. Weakly-hard temporal constraints. Technical Report YCS, Dept. Computer Science, Univ. York, 2000.

  4. Bernat G, Burns A. Combining (nm)-hard deadlines with dual priority scheduling. InProc. 18th IEEE Real-Time Systems Symposium, San Francisco, USA, Dec. 1997, pp.46–57.

  5. Hamdaoui M, Ramanathan P. A dynamic priority assignment technique for streams with (m,k)-firm dendlines.IEEE Trans. Computers, Dec. 1995, 44(12): 1443–1451.

    Article  MATH  MathSciNet  Google Scholar 

  6. West R, Poellabauer G. Analysis of a window-constrained scheduler for real-time and best-effort packet streams. InProc. 21st IEEE Real-Time Systems Symposium, Orlando, FL, Nov. 2000, pp.239–248.

  7. Wedde H, Lind J. Building large, complex, distributed safety-critical operating systems.Real-Time Systems, 1997, 13: 277–302.

    Google Scholar 

  8. Bernat G, Cayssials R. Guaranteed on-line weakly hard real-time systems. InProc. 22nd IEEE Real-Time Systems Symposium, London, England, Dec. 2001.

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

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, Huazhong University of Science and Technology, 430074, Wuhan, P.R. China

    Tu Gang, Yang FuMin & Lu YanSheng

Authors
  1. Tu Gang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yang FuMin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Lu YanSheng
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Tu Gang.

Additional information

TU Gang received his M.S. degree in computer science from Huazhong University of Science and Technology (HUST) in 2001. Now he is a Ph.D. candidate in Institute of Computer Science, HUST. His research interests are real-time scheduling algorithms and embedded real-time systems.

YANG FuMin is a professor of Huazhong University of Science and Technology. He received his M.S. degree in computer science from HUST in 1989. Currently, he is the head of Embedded Real-Time Operating System Lab of HUST. His research interests cover real-time systems, embedded systems and DBMS.

LU YanSheng is a professor and Ph.D. supervisor of Huazhong University of Science and Technology. He received his M.S. degree in computer science from HUST in 1985. Currently, he is the head of the Institute of Software of HUST. His research interests cover real-time systems, real-time DBMS and data mining.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tu, G., Yang, F. & Lu, Y. Scheduling algorithms based on weakly hard real-time constraints. J. Comput. Sci. & Technol. 18, 815–821 (2003). https://doi.org/10.1007/BF02945471

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation