A fault-tolerant wormhole routing scheme for torus networks with nonconvex faults

Information Processing Letters

Volumn 88, Issue 6, 2003, Pages 271-278

  Shih, Jau Der ^a  

^a NATIONAL PINGTUNG UNIVERSITY   (Taiwan)

Author keywords

Fault tolerance; Interconnection networks; Torus; Wormhole routing

Indexed keywords

ALGORITHMS; FAULT TOLERANT COMPUTER SYSTEMS; INTERCONNECTION NETWORKS; VIRTUAL REALITY;

TORUS NETWORKS; WORMHOLE ROUTING;

DATA PROCESSING;

EID: 0242523211     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2003.09.005     Document Type: Article

References (25)

1. Boppana R.V., Chalasani S. Fault-tolerant wormhole routing algorithms for mesh networks. IEEE Trans. Comput. 44:(7):1995;848-864.
2. Boura Y.M., Das C.R. Fault-tolerant routing in mesh networks. Proc. 1995 Internat. Conf. Parallel Process. 1995;I.106-I.109.
3. Chalasani S., Boppana R.V. Adaptive wormhole routing in tori with faults. IEE Proc. - Comput. Digit. Tech. 142:(6):1995;386-394.
4. Chalasani S., Boppana R.V. Communication in multicomputers with nonconvex faults. IEEE Trans. Comput. 46:(5):1997;616-622.
5. Chen C., Chiu G. A fault-tolerant routing scheme for meshes with non-convex faults. IEEE Trans. Parallel Distrib. Systems. 12:(5):2001;467-475.
6. Chien A.A., Kim J.H. Planar-adaptive routing: low-cost adaptive networks for multiprocessors. Proc. 19th Annual Internat. Symp. on Computer Architecture. 1992;268-277.
7. Cunningham C.M., Avresky D.R. Fault-tolerant adaptive routing for two-dimensional meshes. Proc. 1st Annual Internat. Symp. on High Performance Computing Architecture. 1995.
8. Dally W.J., Aoki H. Deadlock-free adaptive routing in multicomputer networks using virtual channels. IEEE Trans. Parallel Distrib. Systems. 4:(4):1993;466-475.
9. Dally W.J., Seitz C.L. The torus routing chip. J. Distrib. Comput. 1:(3):1986;187-196.
10. Duato J. A new theory of deadlock-free adaptive routing in wormhole networks. IEEE Trans. Parallel Distrib. Systems. 4:(12):1993;1320-1331.
11. Duato J. A necessary and sufficient condition for deadlock-free adaptive routing in wormhole networks. IEEE Trans. Parallel Distrib. Systems. 6:(10):1995;1055-1067.
12. Duato J. A theory of fault-tolerant routing in wormhole networks. IEEE Trans. Parallel Distrib. Systems. 8:(8):1997;790-802.
13. Gaughan P.T., Yalamanchili S. A family of fault-tolerant routing protocols for direct multiprocessor networks. IEEE Trans. Parallel Distrib. Systems. 6:(5):1995;482-497.
14. Glass C.J., Ni L.M. Fault-tolerant wormhole routing in meshes without virtual channels. IEEE Trans. Parallel Distrib. Systems. 7:(6):1996;620-636.
15. Hadas R.L., Brandt E. Origin-based fault-tolerant routing in the mesh. Proc. 1st Annual Internat. Symp. on High Performance Computing Architecture. 1995;102-111.
16. Kim S.-P., Han T. Fault-tolerant wormhole routing in mesh with overlapped solid fault regions. Parallel Comput. 23:1997;1937-1962.
17. Kim J.H., Liu Z., Chen A.A. Compressionless routing: a framework for adaptive and fault-tolerant routing. IEEE Trans. Parallel Distrib. Systems. 8:(3):1997;229-244.
18. Linder D.H., Harden J.C. An adaptive and fault tolerant wormhole routing strategy for k -ary n -cubes. IEEE Trans. Comput. 40:1991;2-12.
19. Ni L.M., McKinley P.K. A survey of wormhole routing techniques in direct networks. IEEE Comput. 26:1993;62-76.
20. Shih J.D. Wormhole routing for torus networks with faults. Parallel Comput. 27:2001;1817-1829.
21. Shih J.D. Fault-tolerant wormhole routing in torus networks with overlapped block faults. IEE Proc. - Comput. Digit. Tech. 150:(1):2003;29-37.
22. Suh Y.-J., Dao B.V., Duato J., Yalamanchili S. Software-based rerouting for fault-tolerant pipelined communication. IEEE Trans. Parallel Distrib. Systems. 11:(3):2000;193-211.
23. Su C.C., Shin K.G. Adaptive fault-tolerant deadlock-free routing in meshes and hypercubes. IEEE Trans. Comput. 45:(6):1996;666-683.
24. Sui P.H., Wang S.D. An improved algorithm for fault-tolerant wormhole routing in meshes. IEEE Trans. Comput. 46:(9):1997;1040-1042.
25. Sui P.H., Wang S.D. A fault-tolerant routing algorithm for wormhole-routed meshes. Parallel Comput. 26:2000;455-465.