Minimal fully adaptive wormhole routing on hypercubes

DOI10.1016/0020-0190(94)00060-3MaRDI QIDQ1330659zbMATH OpenOpenAlexFDO

Authors Chiu-Chuan Lin, Ferng-Ching Lin

Publication date 20 September 1994

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL http://ntur.lib.ntu.edu.tw/bitstream/246246/155750/1/14.pdf

zbMATH Keywords

fully adaptive routing algorithmswitching techniquevirtual channelwormhole routing

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Distributed algorithms (68W15)

Recommendations

• Adaptive wormhole routing in hypercube multicomputers
• Optimal fully adaptive minimal wormhole routing for meshes
• Analysis of fully adaptive wormhole routing in tori
• Fault-tolerant wormhole routing for hypercube networks
• AN ADAPTIVE FAULT-TOLERANT WORMHOLE ROUTING ALGORITHM FOR HYPERCUBES

Cites work

• An adaptive and fault tolerant wormhole routing strategy for k-ary n-cubes
• Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
• Virtual cut-through: A new computer communication switching technique

Cited in

(6)

• Adaptive wormhole routing in hypercube multicomputers
• Optimal fully adaptive minimal wormhole routing for meshes
• Vertex-ordering for fully adaptive routing in a wormhole-routed star graph
• scientific article; zbMATH DE number 1863335 (Why is no real title available?)
• scientific article; zbMATH DE number 2090664 (Why is no real title available?)
• Adaptive routing on the new switch chip for IBM SP systems

This page was built for publication: Minimal fully adaptive wormhole routing on hypercubes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1330659)