Skip to main content
SpringerLink
Log in

Fault-Tolerant Wormhole Routing with 2 Virtual Channels in Meshes

  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

In wormhole meshes, a reliable routing is supposed to be deadlock-free and fault-tolerant. Many routing algorithms are able to tolerate a large number of faults enclosed by rectangular blocks or special convex, none of them, however, is capable of handling two convex fault regions with distance two by using only two virtual networks. In this paper, a fault-tolerant wormhole routing algorithm is presented to tolerate the disjointed convex faulty regions with distance two or no less, which do not contain any nonfaulty nodes and do not prohibit any routing as long as nodes outside faulty regions are connected in the mesh network. The processors' overlapping along the boundaries of different fault regions is allowed. The proposed algorithm, which routes the messages by X-Y routing algorithm in fault-free region, can tolerate convex fault-connected regions with only two virtual channels per physical channel, and is deadlock- and livelock-free. The proposed algorithm can be easily extended to adaptive routing.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Allen F et al. A Version for Protein Science Using Petaflop Supercomputer. IBM Systems J., 2001, 40: 310–327.

    Google Scholar 

  2. Mukherjee S S, Bannon R, Lang S, Spink A. The Alpha 21364 network architecture. IEEE Micro., 2002, 17(1): 26–35.

    Google Scholar 

  3. Scott S L. Synchronization and communication in the T3E multiprocessor. In Proc. ASPLOS 7, Oct. 1996, pp.26–36.

  4. Laudon J, Lenoski D. The SGI Origin: A CCNUMA highly scalable server. In Proc. Int. Symp. Computer Architecture, 1997, pp.241–351.

  5. Boppana R V, Chalasani S. Fault-tolerant wormhole routing algorithms for mesh networks. IEEE Trans. Computers, 1995, 44(7): 848–864.

    Article  Google Scholar 

  6. Chalasani S, Boppana R V. Communication in multicomputers with nonconvex faults. IEEE Trans. Computers, 1997, 46(5): 616–622.

    Article  MathSciNet  Google Scholar 

  7. Kim S P, Han T. Fault-tolerant wormhole routing in mesh with overlapped solid fault regions. Parallel Computing, 1997, 23: 1937–1962.

    MathSciNet  Google Scholar 

  8. Sui P H, Wang S D. An improved algorithm for fault-tolerant wormhole routing in meshes. IEEE Trans. Computers, 1997, 46(9): 1040–1042.

    MathSciNet  Google Scholar 

  9. Boppana R V, Chalasani S. Fault-tolerant communication with partitioned dimension-order routers. IEEE Trans. Parallel and Distributes Systems, 1999, 10(10): 1026–1039.

    Google Scholar 

  10. Zhou J P, Lau F C M. Adaptive fault-tolerant wormhole routing in 2D meshes. In Proc. 15th Annual International Parallel & Distributed Processing Symposium, Hyatt Regency, San Francisco Airport, April 23–27, 2001, pp.56–63.

  11. Zhou J P, Lau F C M. Fault-tolerant wormhole routing in 2D meshes. In Proc. 2000 International Symposium on Parallel Architectures, Algorithms and Networks, Dallas/Richandson, Texas, USA, Dec. 7–9, 2000, pp.94–101.

  12. Tsai M J. Fault-tolerant routing in wormhole meshes. Journal of Interconnection Networks, 2003, 4(4): 463–495.

    Article  Google Scholar 

  13. Ho C T, Stockmeyer L. A new approach to fault-tolerant wormhole routing for mesh-connected parallel computers. IEEE Trans. Computers, 2004, 53(4): 427–438.

    Google Scholar 

  14. Wu J. A fault-tolerant and deadlock-free routing in 2D meshes based on odd-even turn model. IEEE Trans. Computers, 2003, 52(9): 1154–1169.

    Google Scholar 

  15. Zhou J P, Lau F C M. Fault-tolerant wormhole routing algorithm in 2D meshes without virtual channels. In Parallel and Distributed Processing and Applications, Lecture Notes in Computer Science 3358, Cao J N, Yang L T, Lau F (eds.), Springer-Verlag, 2004, pp.688–297.

  16. Wang D. A rectilinear-monotone polygonal fault block model for fault-tolerant minimal routing in meshes. IEEE Trans. Computers, 2003, 52(3): 310–320.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Jinan University, Guangzhou, 510632, P.R. China

    Ji-Peng Zhou

Authors
  1. Ji-Peng Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ji-Peng Zhou.

Additional information

This work is supported by Guangdong Province Natural Science Foundation under Grant No. 04300769, the Ministry of Education Study Abroad Returnees Startup Fund in 2004.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhou, JP. Fault-Tolerant Wormhole Routing with 2 Virtual Channels in Meshes. J Comput Sci Technol 20, 822–830 (2005). https://doi.org/10.1007/s11390-005-0822-6

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-005-0822-6

Keywords

Search

Navigation