Skip to main content
SpringerLink
Log in

Dual-Mode r-Reliable Task Model for Flexible Scheduling in Reliable Real-Time Systems

  • Conference paper
Embedded and Ubiquitous Computing (EUC 2006)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 4096))

Included in the following conference series:

  • 721 Accesses

Abstract

Recent research in real-time systems has much focused on new task models for flexible scheduling and fault-tolerant real-time systems. In this paper, we propose a novel task model for the purpose of flexible scheduling in reliable real-time systems. In the proposed dual-mode r-reliable task model, a task periodically releases fast mode jobs or reliable mode jobs with the constraint that reliable mode jobs must be executed at least once for any r consecutive periods to guarantee the reliability of task. We also propose scheduling algorithms and compare performance through simulation results.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Article  MATH  MathSciNet  Google Scholar 

  2. Koren, G., Shasha, D.: Skip-Over: algorithms and complexity for overloaded systems that allow skips. In: Proceedings of Real-Time Systems Symposium, pp. 110–117 (1995)

    Google Scholar 

  3. West, R., Poellabauer, C.: Analysis of a window-constrained scheduler for real-time and best-effort packet streams. In: Proceedings of Real-Time Systems Symposium, pp. 239–248 (2000)

    Google Scholar 

  4. Bernat, G., Burns, A., Llamosi, A.: Weakly hard real-time systems. IEEE Transactions on Computers 50(4), 308–321 (2001)

    Article  MathSciNet  Google Scholar 

  5. Mok, A.K., Chen, D.: A multiframe model for real-time tasks. IEEE Transactions on Software Engineering 23(10), 635–645 (1997)

    Article  Google Scholar 

  6. Lin, K.-J., Natarajan, S., Liu, J.W.-S.: Imprecise results: utilizing partial computations in real-time systems. In: Proceedings of Real-Time Systems Symposium, pp. 210–217 (1987)

    Google Scholar 

  7. Liu, J.W.-S., Lin, K.-J., Shih, W.-K., Yu, A.C.-S., Chung, C., Yao, J., Zhao, W.: Algorithms for scheduling imprecise computations. IEEE Computers 24(5), 58–68 (1991)

    Google Scholar 

  8. Dey, J.K., Kurose, J., Towsley, D.: On-line scheduling policies for a class of IRIS (Increasing Reward with Increasing Service) real-time tasks. IEEE Transactions on Computers 45(7), 802–813 (1996)

    Article  MATH  Google Scholar 

  9. Liestman, A.L., Campbell, R.H.: A fault-tolerant scheduling problem. IEEE Transactions on Software Engineering 12(11), 1089–1095 (1986)

    MATH  Google Scholar 

  10. Krishna, C., Shin, K.G.: On scheduling tasks with a quick recovery from failure. IEEE Transactions on Computers 35(5), 448–455 (1986)

    Article  MATH  Google Scholar 

  11. Han, C.-C., Shin, K.G., Wu, J.: A fault-tolerant scheduling algorithm for real-time periodic tasks with possible software faults. IEEE Transactions on Computers 52(3), 362–372 (2003)

    Article  Google Scholar 

  12. Ghosh, S., Melhem, R., Mosśe, D., Sarma, J.S.: Fault-tolerant rate-monotonic scheduling. Journal of Real-Time Systems 15(2), 149–181 (1998)

    Article  Google Scholar 

  13. Punnekkat, S., Burns, A., Davis, R.: Analysis of checkpointing for real-time systems. Journal of Real-Time Systems 20(1), 83–102 (2001)

    Article  MATH  Google Scholar 

  14. Seto, D., Krogh, B., Sha, L., Chutinan, A.: Dynamic control systems upgrade using Simplex architecture. IEEE Control Systems, 72–80 (1998)

    Google Scholar 

  15. Sha, L.: Dependable system upgrade. In: Proceedings of Real-Time Systems Symposium, pp. 440–448 (1998)

    Google Scholar 

  16. Chandra, R., Liu, X., Sha, L.: On the scheduling of flexible and reliable real-time control systems. Journal of Real-Time Systems 24(2), 153–169 (2003)

    Article  MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  18. Quan, G., Hu, X.: Enhanced fixed-priority scheduling with (m,k)-firm guarantee. In: Proceedings of Real-Time Systems Symposium, pp. 79–88 (2000)

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Pohang University of Science and Technology (POSTECH), Pohang, Korea

    Kyong Hoon Kim, Jong Kim & Sung Je Hong

Authors
  1. Kyong Hoon Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jong Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sung Je Hong
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, The University of Texas at Dallas, 75083-0688, TX, USA

    Edwin Sha

  2. Department of Computer Engineering, Wonkwang University, Jeollabuk-do, 570-749, Iksan, Korea

    Sung-Kook Han

  3. Department of of Electrical and Computer Engg, Wayne State University, 48202, Detroit, Michigan, ox, USA

    Cheng-Zhong Xu

  4. Computer Science Department, Konkuk University, Seoul, Korea

    Moon-Hae Kim

  5. Department of Computer Science, St. Francis Xavier University, Antigonish, Canada

    Laurence T. Yang

  6. Department of Computing, Hong Kong Polytechnic University, Hong Kong

    Bin Xiao

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kim, K.H., Kim, J., Hong, S.J. (2006). Dual-Mode r-Reliable Task Model for Flexible Scheduling in Reliable Real-Time Systems. In: Sha, E., Han, SK., Xu, CZ., Kim, MH., Yang, L.T., Xiao, B. (eds) Embedded and Ubiquitous Computing. EUC 2006. Lecture Notes in Computer Science, vol 4096. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11802167_32

Download citation

  • DOI: https://doi.org/10.1007/11802167_32

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-36679-9

  • Online ISBN: 978-3-540-36681-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation