Skip to main content

Fault-Tolerant Scheduling in Distributed Real-Time Systems

  • Conference paper
Parallel Processing and Applied Mathematics (PPAM 2003)

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

  • 600 Accesses

Abstract

Enhancing the reliability of a system executing real-time jobs is, in many cases, one of the most important design goals. A dynamic reconfigurable system offers an approach for improvement of reliability. To achieve high reliability, the most suitable recovery action must be used when a fault occurs, which means that some kind of optimal recovery strategy should be followed. In this paper, we suggest a method to analyze the schedulability of a task set in distributed systems and enhance the reliability of the systems.

This work was supported by the Slovak Scientific Grant Agency within Research Project No. 2/3132/23

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Stankovic, J.A.: Distributed Real-Time Computing: The Next Generation. Invited paper for Journal of the Society of Instrument and Control Engineers of Japan (1992)

    Google Scholar 

  2. Kopetz, H.: Real-Time Systems – Design Principles for Distributed Embedded Applications. Kluwer Academic Publishers, Dordrecht (1997)

    MATH  Google Scholar 

  3. Liu, C.L., Layland, J.W.: Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment. Journal of the ACM 20(1), 46–61 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  4. Chetto, H., Chetto, M.: Some Results of the Earliest Deadline Scheduling Algorithm. IEEE Transactions on Software Engineering 15(10) (October 1989)

    Google Scholar 

  5. Hluchy, L., Dobrucky, M., Viet, T.D., Astalos, J.: The Mapping, Scheduling and Load Balancing Tools of GRADE. In: Parallel Program Development For Cluster Computing. NOVA Science Publishers, Inc., USA (2001) ISBN 1-56072-865-5. Advances in Computation: Theory and Practice 5 (2001)

    Google Scholar 

  6. Hluchy, L., Nguyen, G., Halada, L., Tran, V.: Parallel Flood Modeling. In: Parallel Computing, Parco. Imperial College Press, London (2001)

    Google Scholar 

  7. Hluchy, L., Dobrucky, M., Astalos, J.: Hybrid Approach to Task Allocation in Distributed Systems. In: Malyshkin, V.E. (ed.) PaCT 1997. LNCS, vol. 1277, pp. 210–216. Springer, Heidelberg (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Thai, N.D. (2004). Fault-Tolerant Scheduling in Distributed Real-Time Systems. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2003. Lecture Notes in Computer Science, vol 3019. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24669-5_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24669-5_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21946-0

  • Online ISBN: 978-3-540-24669-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics