On disjoint paths of hypercubes

Arunabha Sen, Subir Bandopadhyay, Abhijit Sengupta

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish (US)
Title of host publication1991 Proceedings of the 34th Midwest Symposium on Circuits and Systems, MWSCAS 1991
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages899-903
Number of pages5
ISBN (Electronic)0780306201
DOIs
StatePublished - Jan 1 1991
Event34th Midwest Symposium on Circuits and Systems, MWSCAS 1991 - Monterey, United States
Duration: May 14 1992May 17 1992

Publication series

NameMidwest Symposium on Circuits and Systems
ISSN (Print)1548-3746

Conference

Conference34th Midwest Symposium on Circuits and Systems, MWSCAS 1991
CountryUnited States
CityMonterey
Period5/14/925/17/92

    Fingerprint

ASJC Scopus subject areas

  • Electronic, Optical and Magnetic Materials
  • Electrical and Electronic Engineering

Cite this

Sen, A., Bandopadhyay, S., & Sengupta, A. (1991). On disjoint paths of hypercubes. In 1991 Proceedings of the 34th Midwest Symposium on Circuits and Systems, MWSCAS 1991 (pp. 899-903). [252067] (Midwest Symposium on Circuits and Systems). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/MWSCAS.1991.252067