Optimal routing in toroidal networks
From MaRDI portal
Recommendations
Cites work
Cited in
(18)- Communication performance of d-meshes in molecular dynamics simulation
- Synthesis of size-optimal toroïdal arrays for the algebraic path problem: A new contribution
- Optimal communication algorithms for Manhattan Street networks
- Efficient location of resources in cylindrical networks
- There is no optimal routing policy for the torus.
- Dense bipartite circulants and their routing via rectangular twisted torus
- scientific article; zbMATH DE number 3878344 (Why is no real title available?)
- A New Load Balanced Routing Algorithm for Torus Networks
- Minimal‐distance routing for KYKLOS II
- scientific article; zbMATH DE number 1034103 (Why is no real title available?)
- Routing on Triangles, Tori and Honeycombs
- scientific article; zbMATH DE number 2058458 (Why is no real title available?)
- Special Issue: Node-to-Node Distances in Regulard-Neighbours Topologies
- Isomorphic Routing on a Toroidal Mesh
- Optimal multi-packet routing on the torus
- Randomized Throughput-Optimal Oblivious Routing for Torus Networks
- scientific article; zbMATH DE number 6469145 (Why is no real title available?)
- A practical interconnection network \(\text{RP}(k)\) and its routing algorithms
This page was built for publication: Optimal routing in toroidal networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1195485)