Article

Free access

Fault-tolerant wormhole routing in tori

Authors:

Suresh Chalasani,

Rajendra V. BoppanaAuthors Info & Claims

ICS '94: Proceedings of the 8th international conference on Supercomputing

Pages 146 - 155

https://doi.org/10.1145/181181.181330

Published: 16 July 1994 Publication History

Abstract

We present a method to enhance wormhole routing algorithms for deadlock-free fault-tolerant routing in tori. We consider arbitrarily-located faulty blocks and assume only local knowledge of faults. Messages are routed via shortest paths when there are no faults, and this constraint is only slightly relaxed to facilitate routing in the presence of faults. The key concept we use is that, for each fault region, a fault ring consisting of fault free nodes and physical channels can be formed around it. These fault rings can be used to route messages around fault regions. We prove that at most four additional virtual channels are sufficient to make any fully-adaptive algorithm tolerant to multiple faulty blocks in torus networks. As an example of this technique, we present simulation results for a fully-adaptive algorithm and show that good performance can be obtained with as many as 10% links faulty.

References

[1]

A. AgarwM, et. al. The MIT A~wife machine: A largescMe di~fibuted multiprocessor. In Proc. of Workshop on Scalable Shared Memory Mult,processors. Kluwer Academic Publishers, 1991.

[2]

R. Alverson, D. Callahan, D. Cummings, B. Koblenz, A. Porterfi~d, and B. Smith. The Tera computer system. In Proc. 1990 Int. Conf. on Supereomputin9.

Digital Library

[3]

K. Bolding and L. Snyder. Overv~w of fault handling for the chaos router, in Proceedings o} the 1991 IEEE Internatzonal Workshop on De~ect and Fault Tolerance in VLSI Systems, pages 124-127, 1991.

[4]

R. V. Boppana and S. Chalasani. A comparison of adaptive wormhole routing algorithms. In Proc. 20th Ann. int. Syrnp. on Cornput. Arch., pages 351-360, May 1993.

Digital Library

[5]

R. V. Boppana and S. Chalasani. Faul~tolerant wormhole routing MgoMthms for mesh networks. Submitted for publication, Dec. 1993.

[6]

S. Borkar et al. iWarp: An integrated solution to highspeed paralld computing. In Proc. Supercomputing ~8, pages 330-339.

Digital Library

[7]

A. A. Chien and J. H. Kim. Plana~adaptive routing: Low-cost adaptive networks for mul~processors. In Proc. 19th Ann. Int. Symp. on Comput. Arch., pages 268-277, 1992.

Digital Library

[8]

W. J. Dally. Virtu~-chann~ flow control. IEEE Trans. on Parallel and Distributed Systems, 3(2):194- 205, Mar. 1992.

Digital Library

[9]

W. J. Dally and H. Aoki. Deadlock-flee adaptive routing in mult~omputer networks using virtuM chann~s. IEEE Trans. on Parallel and Distributed Systems, 4(4):466-475, April 1993.

Digital Library

[10]

W. J. DMly and C. L. Seitz. Deadlock-flee message routing in mul~processor interconnection networks. IEEE Trans. on Computers, C-36(5):547-553, 1987.

Digital Library

[11]

J. Duato. A new theory of deadlock-flee adaptive routing in wormhole networks. IEEE Trans. on Parallel and D~stributed Systems, 4(12):1320-1331, Dec. 1993.

Digital Library

[12]

S. A. Felperin, L. Gravano, G. D. PKarr6, and 3. L. Sanz. Routing techniques for mas~vely parall~ communication. Procee&ngs o/ the IEEE, 79(4):488-503, 1991.

[13]

P. T. Gaughan and S. Yalamanchili. Pipelined circuitswitching: A fault-to,rant variant of wormhole routing. In Proc. Fourth IEEE Syrup. on Parallel and Distmbuted Processing, pages 148-155, 1992.

[14]

C. ~. Glass and L. M. Ni. Fault-to,rant wormhole routing in meshes. In Twenty-Third Annual Int. Symp. on Fault-Tolerant Computing, pages 240-249, 1993.

[15]

I. S. Gopal. Preven~on of store-and-forward deadlock in computer networks. IEEE Trans. on Communications, COM-33(12):1258-1264, Dec. 1985.

[16]

P. Kermani and L. Kleinrock. VirtuM CuUThrough: A New Computer Communication Switching Technique. Computer Networks, 3:267-286, 1979.

[17]

J. H. Kim and A. A. Chien. An evaluation of plana~ adaptive routing (PAR). In Proc. Fourth IEEE Syrup. on Parallel and Distributed Processing, 1992.

[18]

S. S. Lam and M. Reiser. Congestion control of storeand-forward networks by input buffer 5mits--an analys~. IEEE Trans. on Communications, com-27(1):127- 133, Jan. 1979.

[19]

T. Lee and J. Hayes. A faul~tolerant communication scheme for hypercube computers. IEEE Trans. on Computers, 41(10):1242-1256, Oct. 1992.

Digital Library

[20]

S. L. Lillevik. The Touchstone 30 Gigaflop DELTA prototype. In S~xth Distributed Memory Computing Conference, pages 671-677, 1991.

[21]

D. H. Linder and J. C. Harden. An adaptive and fault tolerant wormhole routing strategy for k-ary n-cubes. IEEE Trans. on Computers, 40(1):2-12, 1991.

Digital Library

[22]

M.D. Noakes et al. The J-machine mul~computer: An architectural evaluation. In Proc. 20th Ann. Int. Syrup. on Comput. Arch., pages 224-235, May 1993.

Digital Library

[23]

A. L. Nara~mha Reddy and R. Frdtas. Fault torrance of adaptive routing algorithms in multicomputers. In Proc. Fourth IEEE Symp. on Parallel and D~stributed Processing, pages 156-161, 1992.

[24]

J. Y. Ngai and C. L. S~tz. A framework for adaptive routing in mul~computer networks. In Proc. Fsrst Syrup. on Parallel Algorzthms" and Architectures, 1989.

Digital Library

[25]

W. Oed. The cray research mas~vdy parallel processor system, CRAY T3D. Technical report, Cray Research Inc., Nov. 1993.

[26]

C. S. Raghavendra, P.-J. Yang, and S.-B. Tien. Free d~ men~ons- an effective approach to achieving fault to~ erance in hypercubes. In Twenty-Second Annual Int. Symp. on Faul~Tolerant Computing, pages 170-177, 1992.

[27]

C. S~tz. Concurrent architectures. In R. Suaya and G. B~twislte, editors, VLSI and Parallel Computation, chapter 1, pages 1-84. Morgan-K~ufman Pubh~hcr~, Inc., San Mateo, California, 1990.

Digital Library

Cited By

Xiaochao YGuodong HZeyu G(2018)Modified PFNF Fault-Tolerant Routing Algorithm for WUDN StructureRecent Developments in Intelligent Computing, Communication and Devices10.1007/978-981-10-8944-2_64(549-557)Online publication date: 23-Aug-2018
https://doi.org/10.1007/978-981-10-8944-2_64
Peñaranda RGómez MLópez PGunnar Gran ESkeie T(2017) A fault‐tolerant routing strategy for k ‐ary n ‐direct s ‐indirect topologies based on intermediate nodes Concurrency and Computation: Practice and Experience10.1002/cpe.406529:13Online publication date: 8-Feb-2017
https://doi.org/10.1002/cpe.4065
Penaranda RGran ESkeie TGomez MLopez P(2016)A New Fault-Tolerant Routing Methodology for KNS Topologies2016 2nd IEEE International Workshop on High-Performance Interconnection Networks in the Exascale and Big-Data Era (HiPINEB)10.1109/HIPINEB.2016.9(1-8)Online publication date: Mar-2016
https://doi.org/10.1109/HIPINEB.2016.9
Show More Cited By

Index Terms

Fault-tolerant wormhole routing in tori
1. Computer systems organization
  1. Architectures
    1. Parallel architectures
      1. Multiple instruction, multiple data
2. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis
      1. Routing and network design problems

Recommendations

Fault-Tolerant Wormhole Routing Algorithms for Mesh Networks

We present simple methods to enhance the current minimal wormhole routing algorithms developed for high-radix, low-dimensional mesh networks for fault-tolerant routing. We consider arbitrarily-located faulty blocks and assume only local knowledge of ...
Fault-tolerant routing with non-adaptive wormhole algorithms in mesh networks
Supercomputing '94: Proceedings of the 1994 ACM/IEEE conference on Supercomputing

We present simple techniques to enhance the e-cube algorithm for fault-tolerant routing in mesh networks. These techniques are based on the concept of fault rings, which are formed using fault-free nodes and links around each fault region. We use fault ...
A comparison of adaptive wormhole routing algorithms
Special Issue: Proceedings of the 20th annual international symposium on Computer architecture (ISCA '93)

Improvement of message latency and network utilization in torus interconnection networks by increasing adaptivity in wormhole routing algorithms is studied. A recently proposed partially adaptive algorithm and four new fully-adaptive routing algorithms ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

ICS '94: Proceedings of the 8th international conference on Supercomputing

July 1994

452 pages

ISBN:0897916654

DOI:10.1145/181181

Chairmen:
John Gurd
Univ. of Manchester, Manchester, UK
,
William Jalby
Univ. de Versailles, France

Copyright © 1994 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGARCH: ACM Special Interest Group on Computer Architecture

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 16 July 1994

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

ICS94

Sponsor:

SIGARCH

ICS94: International Conference on Supercomputing '94

July 11 - 15, 1994

Manchester, England

Acceptance Rates

ICS '94 Paper Acceptance Rate 45 of 114 submissions, 39%;

Overall Acceptance Rate 629 of 2,180 submissions, 29%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

33
Total Citations
View Citations
379
Total Downloads

Downloads (Last 12 months)59
Downloads (Last 6 weeks)6

Reflects downloads up to 06 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Xiaochao YGuodong HZeyu G(2018)Modified PFNF Fault-Tolerant Routing Algorithm for WUDN StructureRecent Developments in Intelligent Computing, Communication and Devices10.1007/978-981-10-8944-2_64(549-557)Online publication date: 23-Aug-2018
https://doi.org/10.1007/978-981-10-8944-2_64
Peñaranda RGómez MLópez PGunnar Gran ESkeie T(2017) A fault‐tolerant routing strategy for k ‐ary n ‐direct s ‐indirect topologies based on intermediate nodes Concurrency and Computation: Practice and Experience10.1002/cpe.406529:13Online publication date: 8-Feb-2017
https://doi.org/10.1002/cpe.4065
Penaranda RGran ESkeie TGomez MLopez P(2016)A New Fault-Tolerant Routing Methodology for KNS Topologies2016 2nd IEEE International Workshop on High-Performance Interconnection Networks in the Exascale and Big-Data Era (HiPINEB)10.1109/HIPINEB.2016.9(1-8)Online publication date: Mar-2016
https://doi.org/10.1109/HIPINEB.2016.9
Jha SJana PYadav RSinha BSrivastava S(2015)Improved Algorithms for Balanced Ring Formation for Fault Tolerance in A 2D MeshInternational Journal of Computers and Applications10.1080/1206212X.2010.1144198032:2(232-237)Online publication date: 11-Jul-2015
https://doi.org/10.1080/1206212X.2010.11441980
Vitkovskiy ASoteriou VNicopoulos C(2013)Dynamic fault‐tolerant routing algorithm for networks‐on‐chip based on localised detouring pathsIET Computers & Digital Techniques10.1049/iet-cdt.2012.00547:2(93-103)Online publication date: Mar-2013
https://doi.org/10.1049/iet-cdt.2012.0054
Vitkovskiy ASoteriou VNicopoulos C(2012)A highly robust distributed fault-tolerant routing algorithm for NoCs with localized reroutingProceedings of the 2012 Interconnection Network Architecture: On-Chip, Multi-Chip Workshop10.1145/2107763.2107771(29-32)Online publication date: 25-Jan-2012
https://dl.acm.org/doi/10.1145/2107763.2107771
Sem-Jacobsen FLysne O(2012)Topology Agnostic Dynamic Quick Reconfiguration for Large-Scale Interconnection NetworksProceedings of the 2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)10.1109/CCGrid.2012.62(228-235)Online publication date: 13-May-2012
https://dl.acm.org/doi/10.1109/CCGrid.2012.62
Duan XZhang DSun X(2009)A New Approach to Fault-Tolerant Routing in Torus NetworksProceedings of the 2009 Second International Conference on Intelligent Networks and Intelligent Systems10.1109/ICINIS.2009.66(233-236)Online publication date: 1-Nov-2009
https://dl.acm.org/doi/10.1109/ICINIS.2009.66
Lysne OSkeie TReinemo SSem-Jacobsen FNordbotten N(2009)Scalable Interconnection NetworksSimula Research Laboratory10.1007/978-3-642-01156-6_14(129-162)Online publication date: 22-Oct-2009
https://doi.org/10.1007/978-3-642-01156-6_14
Xie LXu DYao QSong L(2008)The Two-Level-Turn-Model Fault-tolerant Routing Scheme in Tori with Convex FaultsProceedings of the 2008 International Conference on Computer Science and Information Technology10.1109/ICCSIT.2008.86(379-387)Online publication date: 29-Aug-2008
https://dl.acm.org/doi/10.1109/ICCSIT.2008.86
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents