Fault-tolerant wormhole routing algorithm for mesh networks

Access Full Text

Fault-tolerant wormhole routing algorithm for mesh networks

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Add to cart
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)
Add to cart

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IEE Proceedings - Computers and Digital Techniques — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

IEE
Published

A multicomputer system can hardly avoid having faulty components in the real world. A good fault-tolerant routing scheme should tolerate as many fault patterns as possible and, hence, reduce the number of disabled functional nodes. The authors consider disconnected unsurrounded faults, i.e. all disconnected faults discussed in the literature. In disconnected unsurrounded fault models, there is no restriction on the shapes of faults. In the proposed routing scheme, a message always leaves each f-ring encountered at an appropriate node such that no message will encounter the same f-ring again and therefore never get trapped in faults.

Inspec keywords: multiprocessor interconnection networks; fault tolerant computing; message passing

Other keywords: real world; routing scheme; disconnected unsurrounded faults; disabled functional nodes; multicomputer system; fault-tolerant routing scheme; mesh networks; disconnected unsurrounded fault models; f-ring; faulty components; fault-tolerant wormhole routing algorithm; fault patterns

Subjects: Multiprocessing systems; Parallel architecture; Distributed systems software; Performance evaluation and testing; Multiprocessor interconnection

References

    1. 1)
      • GLASS, C.J., NI, L.M.: `Fault-tolerant wormhole routing in meshes', Proc. 23th Ann. Int'l Symp. Fault-Tolerant Computing, 1993, p. 240–249.
    2. 2)
      • W.J. Dally , C.L. Seitz . Deadlock-free message routing in multiprocessor interconnection networks. IEEE Trans. Comput. , 5 , 547 - 553
    3. 3)
      • SEITZ, C.L., ATHAS, W.C., FLAIG, C.M., MARTIN, A.J., SEIZOVIC, J., STEELE, C.S., SU, W.K.: `The architecture and programming of the Ametek Series 200 multicomputer', Proc. 3rd Conference Hypercube Concurrent Computers and Applications, Jan 1988, I, p. 33–36, Association for Computing Machinery.
    4. 4)
      • P.H. SUI , S.D. WANG . An improved algorithm for fault-tolerant wormhole routing in meshes. IEEE Trans. Comput. , 9 , 1040 - 1042
    5. 5)
      • CHALASSANI, S., BOPPANA, R.V.: `Adaptive fault-tolerant wormhole routing algorithms with low virtual channels requirements', Int'l Symp. Parallel Architecture, and Networks, 1994, p. 214–221.
    6. 6)
      • M.S. CHEN , K.G. SHIN . Adaptive Fault-tolerant routing in multicomputers. IEEE Trans. Comput. , 12 , 1406 - 1416
    7. 7)
      • A.A. CHIEN , J.H. KIM . Planar-adaptive routing: low-cost adaptive networks for multi-processors. Proc. 19th Int'l Symp. Computer Architecture , 268 - 277
    8. 8)
      • S.P. KIM , T. HAN . Fault-tolerant wormhole routing in mesh with overlapped solid fault regions. Parallel Comput. , 1937 - 1962
    9. 9)
      • C.C. SU , K.G. SHIN . Adaptive fault-tolerant deadlock-free routing in meshes and hypercubes. IEEE Trans. Comput. , 6 , 666 - 682
    10. 10)
      • D.H. LINDER , J.C. HARDEN . An adaptive and fault tolerant wormhole routing strategy for k-ary n-cubes. IEEE Trans. Comput. , 1 , 2 - 12
    11. 11)
      • L.M. NI , P.K. MCKINLEY . A survey of wormhole routing techniques in direct networks. IEEE Comput. , 62 - 76
    12. 12)
      • T.C. Lee , J.P. Hays . A fault-tolerant communication scheme for hypercube computers. IEEE Trans. Comput. , 10 , 1242 - 1256
    13. 13)
      • S. CHALASSANI , R.V. BOPPANA . Communication in multicomputers with nonconvex faults. IEEE Trans. Comput. , 5 , 612 - 622
    14. 14)
      • W.J. DALLY , H. AOKI . Deadlock-free adaptive routing in multicomputer networks using virtual channels. IEEE Trans. Parallel Distrib. Syst. , 4 , 466 - 475
    15. 15)
      • R.V. BOPPANA , S. CHALASSANI . Fault-tolerant wormhole routing algorithms for mesh networks. IEEE Trans. Comput. , 7 , 848 - 864
    16. 16)
      • R.V. BOPPANA , S. CHALASSANI . Fault-tolerant routing with non-adaptive wormhole algorithms in mesh networks. Supercomput. , 693 - 702
    17. 17)
      • Intel Corp . (1991) , A Touchstone DELTA System Description.
    18. 18)
      • G.M. CHIU , S.P. WU . A fault-tolerant routing strategy in hypercube multicomputers. IEEE Trans. Comput. , 2 , 143 - 155
    19. 19)
      • M.S. CHEN , K.G. SHIN . Depth-first search approach for fault-tolerant routing in hypercube multiprocessors. IEEE Trans. Parallel Distrib. Syst. , 2 , 152 - 159
http://iet.metastore.ingenta.com/content/journals/10.1049/ip-cdt_20000187
Loading

Related content

content/journals/10.1049/ip-cdt_20000187
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading