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 | |
State | Published - Apr 1991 |
Externally published | Yes |
ASJC Scopus subject areas
- Software
- Theoretical Computer Science
- Hardware and Architecture
- Computer Networks and Communications
- Artificial Intelligence