Routing, merging, and sorting on parallel models of computation
Journal of Computer and System Sciences
Assignment problems in parallel and distributed computing
Assignment problems in parallel and distributed computing
Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
IEEE Transactions on Computers
A bridging model for parallel computation
Communications of the ACM
Introduction to algorithms
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
An architecture for optimal all-to-all personalized communication
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
The turn model for adaptive routing
Journal of the ACM (JACM)
Interconnection Networks for Parallel and Distributed Processing
Interconnection Networks for Parallel and Distributed Processing
Edge Congestion and Topological Properties of Crossed Cubes
IEEE Transactions on Parallel and Distributed Systems
Static and dynamic low-congested interval routing schemes
Theoretical Computer Science
| Hi-index | 0.00 |
The problem of choosing a static shortest-path system that minimizes maximum edge congestion in a network is studied. Bounds based on parameters, such as diameter, bisection width, and average distance, are derived and conditions for producing uniform congestion on all edges are explored. Trees are shown to have maximum congestion on edges that are incident to a centroid node. Cartesian product graphs, which generalize multidimensional meshes, are shown to satisfy several closure properties and a generic factor-routing scheme is defined and shown to be optimal in many cases.