Title :
Random Routing of Tasks in Hypercube Architectures
Author_Institution :
Purdue University
Abstract :
We propose a general technique to study the perfor mance of random routing in a hypercube system. The proposed method is a based on association schemes in stead of using representation theory.
Keywords :
Algebra; Computer architecture; Distributed computing; Hypercubes; Load management; Network topology; Parallel processing; Performance analysis; Routing; Scheduling algorithm;
Conference_Titel :
Parallel Processing, 1993. ICPP 1993. International Conference on
Conference_Location :
Syracuse, NY, USA
Print_ISBN :
0-8493-8983-6
DOI :
10.1109/ICPP.1993.154
