Interval routing & layered cross product: compact routing schemes for butterflies, meshes of trees, fat trees and Beneš networks

Authors:
Tiziana Calamoneri;Miriam Di Ianni
Affiliations:
Dip. di Informatica, Università di Roma "La Sapienza", via Salaria 113, 00198 Rome, Italy;Dip. di Matematica, Università di Roma "Tor Vergata", via della Ficerca Scientifica, 00133 Rome, Italy
Venue:
Journal of Parallel and Distributed Computing
Year:
2003

Citing 8
Cited 0

Interval routing

The Computer Journal
Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
Layered cross product—a technique to construct interconnection networks

SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Randomized routing and sorting on fixed-connection networks

Journal of Algorithms
On Efficiency of Interval Routing Algorithms

MFCS '88 Proceedings of the Mathematical Foundations of Computer Science 1988
The Complexity of Interval Routing on Random Graphs

MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
The Complexity of Shortest Path and Dilation Bounded Interval Routing

Euro-Par '97 Proceedings of the Third International Euro-Par Conference on Parallel Processing
Optimal Interval Routing

CONPAR 94 - VAPP VI Proceedings of the Third Joint International Conference on Vector and Parallel Processing: Parallel Processing

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper we propose compact routing schemes having space and time complexities comparable to a 2-interval routing scheme for the class of networks decomposable as layered cross product (LCP) of rooted trees. As a consequence, we are able to design a "quasi" 2-interval routing scheme (i.e. a 2-interval routing scheme plus a fast and small local algorithm) for butterflies, meshes of trees and fat trees. Then we show that a compact routing scheme for general networks which are LCP of cyclic graphs cannot be found by any method using only information about shortest paths on the factors. Nevertheless, we extend our scheme to Benes networks, although they cannot be decomposed as the LCP of trees.