论文信息 - Deadlock-Free:FaultTolerantWormhole Routing inMesh basedMassivelyParallelSystems*

Deadlock-Free:FaultTolerantWormhole Routing inMesh basedMassivelyParallelSystems*

In thispaper we presenta routingscheme which isextremely suitedforuse inmassively parallel systems. The routing algorithm isfault-tolerantso that network failureswillnot stop the system. For reasons ofscalability, the routinginformationisextremely compact, alsowhen the network isinjured.The wormhole routingtechniqueguaranteesvery low routinglatency.Moreover the routingisguaranteed tobe deadlock-freewithout theneed fordedicatedbuffering.

Johan Vounckx | J. Vounckx

[1] Lionel M. Ni,et al. A survey of wormhole routing techniques in direct networks , 1993, Computer.

[2] William J. Dally,et al. Deadlock-Free Message Routing in Multiprocessor Interconnection Networks , 1987, IEEE Transactions on Computers.

[3] Jan van Leeuwen,et al. Interval Routing , 1987, Computer/law journal.

[4] Lionel M. Ni,et al. Fault-tolerant wormhole routing in meshes , 1993, FTCS-23 The Twenty-Third International Symposium on Fault-Tolerant Computing.

[5] Lionel M. Ni,et al. The turn model for adaptive routing , 1992, ISCA '92.

[6] Rudy Lauwereins,et al. Minimal Deadlock-Free Compact Routing in Wormhole Switching based Injured Meshes , 1995 .

[7] Daniel H. Linder,et al. An Adaptive and Fault Tolerant Wormhole Routing Strategy for k-Ary n-Cubes , 1994, IEEE Trans. Computers.

[8] Rudy Lauwereins,et al. Fault-Tolerant Compact Routing Based on Reduced Structural Information in Wormhole-Switching Based Networks , 1994, SIROCCO.

[9] Andrew A. Chien,et al. Planar-adaptive routing: low-cost adaptive networks for multiprocessors , 1992, ISCA '92.