Skip to main content
SpringerLink
Log in

A uniform reliable multicast protocol with guaranteed response times

  • Refereed Papers
  • Conference paper
  • First Online:
Languages, Compilers, and Tools for Embedded Systems (LCTES 1998)

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

Included in the following conference series:

Abstract

Uniform reliable multicast protocols with a guaranteed response time are of concern in numerous distributed real-time systems (e.g. distributed transactional systems, high available systems). We focus on uniform reliable multicast protocols in processors groups. The source of a message can belong or not to the destination group. A bounded number of processors crashes and network omissions is tolerated. The uniform reliable multicast protocol, designed and proved in this paper, works with Earliest Deadline First (EDF) scheduling, proved optimal in the uniprocessor context. A worst-case response time analysis for sporadic tasks subject to release jitter is given for non-preemptive EDF on a uniprocessor and extended to the distributed case using the holistic scheduling approach.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. B. Charron-Bost, C. Delporte, H. Fauconnier, E. Ledinot, G. Le Lann, A. Marcuzzi, P. Minet, J.M. Vincent, “Spécification du problème ATR (Accord Temps Réel)”, rapport du contrat DGA-DSP/MENSR/CNRS, Juin 1997.

    Google Scholar 

  2. S. K. Baruah, R. R. Howell, L. E. Rosier, “Algorithms and Complexity Concerning the Preemptive Scheduling of Periodic Real-Time tasks on one processor”, Real-Time Systems, 2, p 301–324, 1990.

    Article  Google Scholar 

  3. F. Cristian, “Synchronous atomic broadcast for redundant channels”, IBM Research Report RJ 7203, Dec. 1989.

    Google Scholar 

  4. L. George, “Ordonnancement en ligne temps réel critique dans les systèmes distribués”, PhD Thesis, Université de Versailles Saint-Quentin, Janvier 1998.

    Google Scholar 

  5. L. George, N. Rivierre, M. Spuri, “Preemptive and Non-Preemptive Real-Time Uniprocessor Scheduling” INRIA Rocquencourt, France, Research Report 2966, Sept. 1996.

    Google Scholar 

  6. R. Guerraoui, A. Schiper, “Total Order Multicast to Multiple Groups”, ICDCS’97, Baltimore, Maryland, pp 578–585, May 1997.

    Google Scholar 

  7. J. F. Hermant, M. Spuri, “End-to-end response times in real-time distributed systems”, 9th int. conf. on Parallel and Distributed Computing Systems, Dijon, France, pp 413–417, Sept. 1996.

    Google Scholar 

  8. V. Hadzilacos, S. Toueg, “A modular approach to fault-tolerant broadcasts and related problems”, Technical Report TR 94-1425, Dept. of Computer Science, Cornell University, Ithaca, NY14853, May 1994.

    Google Scholar 

  9. K. Jeffay, D. F. Stanat, C. U. Martel, “On Non-Preemptive Scheduling of Periodic and Sporadic Tasks”, IEEE Real-Time Systems Symposium, San-Antonio, December 4–6, 1991, pp 129–139.

    Google Scholar 

  10. D. D. Kandlur, K. G. Shin, D. Ferrari, “Real-time communication in multihop networks”, IEEE Trans. on Parallel and Distributed Systems, 5(10), October 1994.

    Google Scholar 

  11. C.L Liu, J. W. Layland, “Scheduling Algorithms for multiprogramming in a Hard Real Time Environment”, Journal of the Association for Computing Machinery, 20(1), Jan. 1973.

    Google Scholar 

  12. G. Le Lann, “A methodology for designing and dimensioning critical complex computing systems”, IEEE Engineering of Computer Based Systems, Friedrichshafen, Germany, March 1996, pp 332–339.

    Google Scholar 

  13. A. Parekh, R. Gallager, “ A generalized processor sharing approach to flow control in integrated services networks-the single node case”, INFOCOM92, Florence, Italy, 1992, pp915–924.

    Google Scholar 

  14. F. Schmuck, F. Cristian, “Continuous clock amortization need not affect the precision of a clock synchronization algorithm”, Research Report RJ7290, IBM Almaden, Jan. 1990.

    Google Scholar 

  15. M. Spuri, “Holisitic analysis for deadline scheduled real-time distributed systems” Research Report 2873, INRIA, France, April 1996.

    Google Scholar 

  16. K. Tindell, J. Clark “Holistic Schedulability Analysis for Distributed Hard Real-Time Systems”, Microprocessors and Microprogramming 40, 1994.

    Google Scholar 

  17. G Xie, S. Lam, “Delay Guarantee of virtual clock server”, IEEE/ACM Trans. on Networking, 3(6), pp 683–689, Dec. 1995.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Département Télécom, ESIGETEL, 1 rue du port Valvins, 77210, Avon, France

    Laurent George

  2. Projet Reflecs, INRIA Rocquencourt, 78153, Le Chesnay Cedex, France

    Pascale Minet

Authors
  1. Laurent George
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pascale Minet
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Frank Mueller Azer Bestavros

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

George, L., Minet, P. (1998). A uniform reliable multicast protocol with guaranteed response times. In: Mueller, F., Bestavros, A. (eds) Languages, Compilers, and Tools for Embedded Systems. LCTES 1998. Lecture Notes in Computer Science, vol 1474. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0057781

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65075-1

  • Online ISBN: 978-3-540-49673-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation