DocumentCode
2697768
Title
A journey into multicomputer routing algorithms
Author
Grammatikakis, Miltos D. ; Hsu, D. Frank ; Kraetzl, Miro
Author_Institution
Comput. Sci. Inst., FORTH, Heraklion, Greece
fYear
1995
fDate
15-17 Mar 1995
Firstpage
19
Lastpage
27
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
Keywords
fault tolerant computing; graph theory; hypercube networks; network routing; packet switching; parallel algorithms; parallel architectures; reliability; sorting; MIMD; SIMD; communication models; dynamic routing; fault tolerant routing; general graphs; h-relation routing; hypercube topology; isotonic routing; multicomputer routing algorithms; packet routing; partial permutation; random destination routing; sorting; Australia; Broadcasting; Computer science; Fault tolerance; Hypercubes; Information science; Routing; Scattering; Sorting; Statistics;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel Algorithms/Architecture Synthesis, 1995. Proceedings., First Aizu International Symposium on
Conference_Location
Fukushima
Print_ISBN
0-8186-7038-X
Type
conf
DOI
10.1109/AISPAS.1995.401359
Filename
401359
Link To Document