Title :
On disjoint paths of hypercubes
Author :
Sen, Arunabha ; Bandopadhyay, Subir ; Sengupta, Abhijit
Author_Institution :
Dept. of Comput. Sci., Arizona State Univ., Tempe, AZ, USA
Abstract :
Parallel processors using hypercube interconnection network are widely in use. The processors in these machines need to exchange messages for parallel computation; however, the maximum number of message exchanges that can be carried out simultaneously in such a network is not known completely. The authors consider a graph model, and under different assumptions compute the maximum number of message exchanges that can be sustained in such a network simultaneously
Keywords :
graph theory; hypercube networks; parallel architectures; disjoint paths; graph model; hypercubes; interconnection network; message exchanges; parallel computation; Communication networks; Communication switching; Computer networks; Computer science; Concurrent computing; Degradation; Hypercubes; Multiprocessor interconnection networks; Routing; Switching circuits;
Conference_Titel :
Circuits and Systems, 1991., Proceedings of the 34th Midwest Symposium on
Conference_Location :
Monterey, CA
Print_ISBN :
0-7803-0620-1
DOI :
10.1109/MWSCAS.1991.252067
