Real-Time Fault-Tolerant Communication in Distributed Computing Systems

  • Kang G. Shin
  • Qin Zheng
Part of the The Kluwer International Series in Engineering and Computer Science book series (SECS, volume 285)


Distributed systems with point-to-point interconnection networks are natural candidates for real-time fault-tolerant communication because parallel processing and communication as well as fault-tolerance can be achieved using multiple processors and interconnection paths between every pair of nodes. However, due to the contention among randomly-arriving messages at each node/link and multi-hops between the source and destination that a message must travel, it is difficult to guarantee the timely delivery of the messages. The goal of this chapter is to remove this difficulty and simultaneously realize the potential of distributed systems for high performance and high reliability.


Source Node Destination Node Faulty Node Basic Circuit Primary Channel 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    D. Ferrari and D. C. Verma, “A scheme for real-time channel establishment in wide-area networks,” IEEE Journal on Selected Areas in Communications, vol. SAC-8, no. 3, pp. 368–379, April 1990.CrossRefGoogle Scholar
  2. [2]
    Q. Zheng and K. G. Shin, “On the ability of establishing real-time channels in point-to-point packet-switched networks,” IEEE Transactions on Communication (in press), 1993.Google Scholar
  3. [3]
    Q. Zheng, Real-time Fault-tolerant Communication in Computer Networks, PhD thesis, University of Michigan, 1993. PostScript version of the thesis is available via anonymous FTP from in directory outgoing/zheng.Google Scholar
  4. [4]
    C. L. Liu and J. W. Layland, “Scheduling algorithms for multiprogramming in a hard real-time environment,” Journal of the ACM, vol. 20, no. 1, pp. 46–61, January 1973.MATHCrossRefGoogle Scholar
  5. [5]
    D. D. Kandlur, K. G. Shin, and D. Ferrari, “Real-time communication in multi-hop networks,” in Proc. Int. Conf. on Distributed Computer Systems, pp. 300–307. IEEE, May 1991.Google Scholar
  6. [6]
    Q. Zheng and K. G. Shin, “Real-time communication in local area ring networks,” in Conference on Local Computer Networks, pp. 416–425, September 1992.Google Scholar
  7. [7]
    A. Indiresan and Q. Zheng, “Design and evaluation of a fast deadline scheduling switch for multicomputers,” RTCL working document, December 1991.Google Scholar
  8. [8]
    Q. Zheng, K. G. Shin, and E. Abram-Profeta, “Transmission of compressed digital motion video over computer networks,” in Digest of COMPCON Spring, pp. 37–46, February 1993.Google Scholar
  9. [9]
    M.-S. Chen, K. G. Shin, and D. D. Kandlur, “Addressing, routing and broadcasting in hexagonal mesh multiprocessors,” IEEE Trans. Computers, vol. 39, no. 1, pp. 10–18, January 1990.CrossRefGoogle Scholar
  10. [10]
    A. M. Farley, “Networks immune to isolated failures,” Networks, vol. 11, pp. 255–268, 1981.MATHCrossRefGoogle Scholar
  11. [11]
    K. G. Shin, “HARTS: A distributed real-time architecture,” IEEE Computer, vol. 24, no. 5, pp. 25–36, May 1991.Google Scholar
  12. [12]
    D. D. Kandlur and K. G. Shin, “Design of a communication subsystem for HARTS,” Technical Report CSE-TR-109-91, CSE Division, Department of EECS, The University of Michigan, October 1991.Google Scholar

Copyright information

© Kluwer Academic Publishers 1994

Authors and Affiliations

  • Kang G. Shin
    • 1
  • Qin Zheng
    • 2
  1. 1.Department of Electrical Engineering and Computer ScienceThe University of MichiganAnn Arbor
  2. 2.Mitsubishi Electric Research Labs., Inc.Cambridge Research CenterCambridge

Personalised recommendations