The Community for Technology Leaders
Parallel Algorithms / Architecture Synthesis, AIZU International Symposium on (1995)
Aizu-Wakamatsu, Fukushima, Japan
Mar. 15, 1995 to Mar. 17, 1995
ISBN: 0-8186-7038-X
pp: 19
M. Kraetzl , Comput. Sci. Inst., FORTH, Heraklion, Greece
M.D. Grammatikakis , Comput. Sci. Inst., FORTH, Heraklion, Greece
D.F. Hsu , Comput. Sci. Inst., FORTH, Heraklion, Greece
ABSTRACT
We survey various aspects of packet routing, namely (partial) permutation, h-relation routing, routing to random destinations, dynamic routing, isotonic routing, fault tolerant routing, and related sorting results. We present theoretical results for general graphs and the hypercube topology, assuming both SIMD and MIMD communication models.
INDEX TERMS
network routing; fault tolerant computing; reliability; hypercube networks; parallel algorithms; packet switching; parallel architectures; sorting; graph theory; multicomputer routing algorithms; packet routing; partial permutation; h-relation routing; random destination routing; dynamic routing; isotonic routing; fault tolerant routing; sorting; general graphs; hypercube topology; SIMD; MIMD; communication models
CITATION
M. Kraetzl, M.D. Grammatikakis, D.F. Hsu, "A journey into multicomputer routing algorithms", Parallel Algorithms / Architecture Synthesis, AIZU International Symposium on, vol. 00, no. , pp. 19, 1995, doi:10.1109/AISPAS.1995.401359
101 ms
(Ver 3.3 (11022016))