TY - GEN
T1 - On disjoint paths of hypercubes
AU - Sen, Arunabha
AU - Bandopadhyay, Subir
AU - Sengupta, Abhijit
PY - 1991/1/1
Y1 - 1991/1/1
N2 - Parallel processors using hypercube interconnection network is widely in use at present. 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. In this paper we consider a graph model and under different assumptions, compute the maximum number of message exchanges that can be sustained in such a network simultaneously.
AB - Parallel processors using hypercube interconnection network is widely in use at present. 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. In this paper we consider a graph model and under different assumptions, compute the maximum number of message exchanges that can be sustained in such a network simultaneously.
UR - http://www.scopus.com/inward/record.url?scp=85067576303&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85067576303&partnerID=8YFLogxK
U2 - 10.1109/MWSCAS.1991.252067
DO - 10.1109/MWSCAS.1991.252067
M3 - Conference contribution
AN - SCOPUS:85067576303
T3 - Midwest Symposium on Circuits and Systems
SP - 899
EP - 903
BT - 1991 Proceedings of the 34th Midwest Symposium on Circuits and Systems, MWSCAS 1991
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 34th Midwest Symposium on Circuits and Systems, MWSCAS 1991
Y2 - 14 May 1992 through 17 May 1992
ER -