Optimal routing in toroidal networks

DOI10.1016/0020-0190(92)90113-AzbMath0769.68046OpenAlexW2071014122MaRDI QIDQ1195485

Izidor Jerebic, Roman Trobec

Publication date: 29 November 1992

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

Full work available at URL: https://doi.org/10.1016/0020-0190(92)90113-a

zbMATH Keywords

analysis of algorithmsparallel processingrouting algorithmsoptimal routingone-to-one communication in multiprocessorstoroidal interconnection networks

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Mathematical problems of computer architecture (68M07)

Related Items (2)

Communication performance of \(d\)-meshes in molecular dynamics simulation ⋮ Special Issue: Node-to-Node Distances in Regulard-Neighbours Topologies

Cites Work

• On forwarding indices of networks
• Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
• An adaptive and fault tolerant wormhole routing strategy for k-ary n-cubes
• An optimal shortest-path routing policy for network computers with regular mesh-connected topologies

This page was built for publication: Optimal routing in toroidal networks