Optimal communication algorithms for hypercubes

D. P. Bertsekas; C. Özveren; G. D. Stamoulis; P. Tseng; J. N. Tsitsiklis

doi:10.1016/0743-7315(91)90033-6

Optimal communication algorithms for hypercubes

D. P. Bertsekas, C. Özveren, G. D. Stamoulis, P. Tseng, J. N. Tsitsiklis

Research output: Contribution to journal › Article › peer-review

92 Scopus citations

Abstract

We consider the following basic communication problems in a hypercube network of processors: the problem of a single processor sending a different packet to each of the other processors, the problem of simultaneous broadcast of the same packet from every processor to all other processors, and the problem of simultaneous exchange of different packets between every pair of processors. The algorithms proposed for these problems are optimal in terms of execution time and communication resource requirements; that is, they require the minimum possible number of time steps and packet transmissions. In contrast, algorithms in the literature are optimal only within an additive or multiplicative factor.

Original language	English (US)
Pages (from-to)	263-275
Number of pages	13
Journal	Journal of Parallel and Distributed Computing
Volume	11
Issue number	4
DOIs	https://doi.org/10.1016/0743-7315(91)90033-6
State	Published - Apr 1991
Externally published	Yes

ASJC Scopus subject areas

Software
Theoretical Computer Science
Hardware and Architecture
Computer Networks and Communications
Artificial Intelligence

Access to Document

10.1016/0743-7315(91)90033-6

Cite this

@article{2bb5fb5bc77b4e13bc9cfffd4ea939a9,

title = "Optimal communication algorithms for hypercubes",

abstract = "We consider the following basic communication problems in a hypercube network of processors: the problem of a single processor sending a different packet to each of the other processors, the problem of simultaneous broadcast of the same packet from every processor to all other processors, and the problem of simultaneous exchange of different packets between every pair of processors. The algorithms proposed for these problems are optimal in terms of execution time and communication resource requirements; that is, they require the minimum possible number of time steps and packet transmissions. In contrast, algorithms in the literature are optimal only within an additive or multiplicative factor.",

author = "Bertsekas, {D. P.} and C. {\"O}zveren and Stamoulis, {G. D.} and P. Tseng and Tsitsiklis, {J. N.}",

note = "Funding Information: * Researchs upported by the NSF under Grants ECS-85 19058 and ECS-8552419, with matching funds from Bellcore Inc., the AR0 under Grant DAAL03-86-K-017 1, and the AFOSR under Grant AFOSR-88-0032. + Laboratory for lnformation and Decision Systems, MIT., Cambridge, MA 02139.",

year = "1991",

month = apr,

doi = "10.1016/0743-7315(91)90033-6",

language = "English (US)",

volume = "11",

pages = "263--275",

journal = "Journal of Parallel and Distributed Computing",

issn = "0743-7315",

publisher = "Academic Press Inc.",

number = "4",

}

TY - JOUR

T1 - Optimal communication algorithms for hypercubes

AU - Bertsekas, D. P.

AU - Özveren, C.

AU - Stamoulis, G. D.

AU - Tseng, P.

AU - Tsitsiklis, J. N.

N1 - Funding Information: * Researchs upported by the NSF under Grants ECS-85 19058 and ECS-8552419, with matching funds from Bellcore Inc., the AR0 under Grant DAAL03-86-K-017 1, and the AFOSR under Grant AFOSR-88-0032. + Laboratory for lnformation and Decision Systems, MIT., Cambridge, MA 02139.

PY - 1991/4

Y1 - 1991/4

N2 - We consider the following basic communication problems in a hypercube network of processors: the problem of a single processor sending a different packet to each of the other processors, the problem of simultaneous broadcast of the same packet from every processor to all other processors, and the problem of simultaneous exchange of different packets between every pair of processors. The algorithms proposed for these problems are optimal in terms of execution time and communication resource requirements; that is, they require the minimum possible number of time steps and packet transmissions. In contrast, algorithms in the literature are optimal only within an additive or multiplicative factor.

AB - We consider the following basic communication problems in a hypercube network of processors: the problem of a single processor sending a different packet to each of the other processors, the problem of simultaneous broadcast of the same packet from every processor to all other processors, and the problem of simultaneous exchange of different packets between every pair of processors. The algorithms proposed for these problems are optimal in terms of execution time and communication resource requirements; that is, they require the minimum possible number of time steps and packet transmissions. In contrast, algorithms in the literature are optimal only within an additive or multiplicative factor.

UR - http://www.scopus.com/inward/record.url?scp=0026142002&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0026142002&partnerID=8YFLogxK

U2 - 10.1016/0743-7315(91)90033-6

DO - 10.1016/0743-7315(91)90033-6

M3 - Article

AN - SCOPUS:0026142002

VL - 11

SP - 263

EP - 275

JO - Journal of Parallel and Distributed Computing

JF - Journal of Parallel and Distributed Computing

SN - 0743-7315

IS - 4

ER -

Optimal communication algorithms for hypercubes

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this