A better than “best possible” algorithm to edge color multigraphs
Journal of Algorithms
The complexity of file transfer scheduling with forwarding
SIAM Journal on Computing
On the 1.1 edge-coloring of multigraphs
SIAM Journal on Discrete Mathematics
A comparison of sorting algorithms for the connection machine CM-2
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Introduction to parallel computing: design and analysis of algorithms
Introduction to parallel computing: design and analysis of algorithms
Doubly Logarithmic Communication Algorithms for Optical-Communication Parallel Computers
SIAM Journal on Computing
Packet routing in fixed-connection networks: a survey
Journal of Parallel and Distributed Computing
Edge-coloring bipartite graphs
Journal of Algorithms
MPI: The Complete Reference
Universal schemes for parallel communication
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Portable and scalable algorithms for irregular all-to-all communication
ICDCS '96 Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS '96)
| Hi-index | 0.00 |
We study the problem of exchanging a set of messages among a group of processors, using the model of simplex communication. Messages may consist of different numbers of packets. Let h denote the maximum number of packets that a processor must send and receive. If all the packets need to be delivered directly, at least 3/2h communication steps are needed to solve the problem in the worst case. We show that by allowing forwarding, only 6/5h+O(1) time steps are needed to exchange all the messages, and this is optimal. Our work was motivated by the importance of irregular message exchanges in distributed-memory parallel computers, but it can also be viewed as an answer to an open problem on scheduling file transfers posed by Coffmann, Garey, Johnsson, and LaPaugh in 1985.