Communication in multicomputer with nonconvex faults

  • Suresh Chalasani
  • Rajendra V. Boppana
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 966)


A technique to enhance multicomputer routers for fault-tolerant routing with modest increase in routing complexity and resource requirements is described. This method handles solid faults in meshes, which includes all convex faults and many practical nonconvex faults, for example, faults in the shape of L or T. As examples of the proposed method, adaptive and nonadaptive fault-tolerant routing algorithms using four virtual channels per physical channel are described.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    A. Agarwal et al., “The MIT Alewife machine: A large-scale distributed multiprocessor,” in Proc. of Workshop on Scalable Shared Memory Multiprocessors, Kluwer Academic Publishers, 1991.Google Scholar
  2. 2.
    K. Bolding and L. Snyder, “Overview of fault handling for the chaos router,” in Proceedings of the 1991 IEEE International Workshop on Defect and Fault Tolerance in VLSI Systems, pp. 124–127, 1991.Google Scholar
  3. 3.
    R. V. Boppana and S. Chalasani, “Fault-tolerant wormhole routing algorithms for mesh networks,” IEEE Trans. on Computers. To appear. Preliminary results presented at Supercomputing '94.Google Scholar
  4. 4.
    S. Chalasani and R. V. Boppana, “Adaptive fault-tolerant wormhole routing algorithms with low virtual channel requirements,” in Int'l Symp. on Parallel Architectures, Algorithms and Networks, Dec. 1994.Google Scholar
  5. 5.
    A. A. Chien and J. H. Kim, “Planar-adaptive routing: Low-cost adaptive networks for multiprocessors,” in Proc. 19th Ann. Int. Symp. on Comput. Arch., pp. 268–277, 1992.Google Scholar
  6. 6.
    Cray Research Inc., Cray T3D Architectural Summary, Oct. 1993.Google Scholar
  7. 7.
    W. J. Dally and H. Aoki, “Deadlock-free adaptive routing in multicomputer networks using virtual channels,” IEEE Trans. on Parallel and Distributed Systems, vol. 4, pp. 466–475, April 1993.Google Scholar
  8. 8.
    W. J. Dally and C. L. Seitz, “Deadlock-free message routing in multiprocessor interconnection networks,” IEEE Trans. on Computers, vol. C-36, no. 5, pp. 547–553, 1987.Google Scholar
  9. 9.
    J. Duato, “A new theory of deadlock-free adaptive routing in wormhole networks,” IEEE Trans. on Parallel and Distributed Systems, vol. 4, pp. 1320–1331 Dec. 1993.Google Scholar
  10. 10.
    P. T. Gaughan and S. Yalamanchili, “A family of fault-tolerant routing protocols for direct multiprocessor networks,” IEEE Trans. on Parallel and Distributed Systems, vol. 6, pp. 482–497, May 1995.Google Scholar
  11. 11.
    C. J. Glass and L. M. Ni, “Fault-tolerant wormhole routing in meshes,” in Twenty-Third Annual Int. Symp. on Fault-Tolerant Computing, pp. 240–249, 1993.Google Scholar
  12. 12.
    Intel Corporation, Paragon XP/S Product Overview, 1991.Google Scholar
  13. 13.
    M. D. Noakes et al., “The J-machine multicomputer: An architectural evaluation,” in Proc. 20th Ann. Int. Symp. on Comput. Arch., pp. 224–235, May 1993.Google Scholar
  14. 14.
    C. L. Seitz, “Concurrent architectures,” in VLSI and Parallel Computation (R. Suaya and G. Birtwistle, eds.), ch. 1, pp. 1–84, San Mateo, California: Morgan-Kaufman Publishers, Inc., 1990.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Suresh Chalasani
    • 1
  • Rajendra V. Boppana
    • 2
  1. 1.Dept. of ECEUniversity of Wisconsin-MadisonMadisonUSA
  2. 2.Computer Science DivisionThe University of Texas at San AntonioSan AntonioUSA

Personalised recommendations