Optimum Broadcasting and Personalized Communication in Hypercubes
IEEE Transactions on Computers
Introduction to algorithms
Generating an Efficient Broadcast Sequence Using Reflected Gray Codes
IEEE Transactions on Parallel and Distributed Systems
Efficient Broadcasting in Wormhole-Routed Multicomputers: A Network-Partitioning Approach
IEEE Transactions on Parallel and Distributed Systems
Algebraic Foundations and Broadcasting Algorithms for Wormhole-Routed All-Port Tori
IEEE Transactions on Computers
Near-Optimal Broadcast in All-Port Wormhole-Routed Hypercubes Using Error-Correcting Codes
IEEE Transactions on Parallel and Distributed Systems
Asymptotically optimal algorithms for job shop scheduling and packet routing
Journal of Algorithms
Adaptive communication algorithms for distributed heterogeneous systems
Journal of Parallel and Distributed Computing - Special issue on software support for distributed computing
Broadcast scheduling optimization for heterogeneous cluster systems
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
MPI: The Complete Reference
Scalable Parallel Computing: Technology,Architecture,Programming
Scalable Parallel Computing: Technology,Architecture,Programming
On multicast algorithms for heterogeneous networks of workstations
Journal of Parallel and Distributed Computing - Special issue on cluster and network-based computing
Introduction to Parallel Computing
Introduction to Parallel Computing
Broadcast scheduling optimization for heterogeneous cluster systems
Journal of Algorithms
Efficient Collective Communication on Heterogeneous Networks of Workstations
ICPP '98 Proceedings of the 1998 International Conference on Parallel Processing
HCW '99 Proceedings of the Eighth Heterogeneous Computing Workshop
Reduction Optimization in Heterogeneous Cluster Environments
IPDPS '00 Proceedings of the 14th International Symposium on Parallel and Distributed Processing
Efficient Collective Communication in Distributed Heterogeneous Systems
ICDCS '99 Proceedings of the 19th IEEE International Conference on Distributed Computing Systems
Successive Broadcasts on Hypercube
Successive Broadcasts on Hypercube
IEEE Communications Magazine
Broadcast Trees for Heterogeneous Platforms
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Future Generation Computer Systems
A study of process arrival patterns for MPI collective operations
Proceedings of the 21st annual international conference on Supercomputing
Techniques for pipelined broadcast on ethernet switched clusters
Journal of Parallel and Distributed Computing
The Journal of Supercomputing
Scheduling for atomic broadcast operation in heterogeneous networks with one port model
The Journal of Supercomputing
Scheduling for atomic broadcast operation in heterogeneous networks with one port model
GPC'08 Proceedings of the 3rd international conference on Advances in grid and pervasive computing
Pipelined broadcast on ethernet switched clusters
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Replica-Aware job scheduling in distributed systems
GPC'10 Proceedings of the 5th international conference on Advances in Grid and Pervasive Computing
Scheduling of job combination and dispatching strategy for grid and cloud system
GPC'10 Proceedings of the 5th international conference on Advances in Grid and Pervasive Computing
Hi-index | 0.00 |
In this paper, we consider the communications involved by the execution of a complex application, deployed on a heterogeneous platform. Such applications extensively use macrocommunication schemes, for example, to broadcast data items. Rather than aiming at minimizing the execution time of a single broadcast, we focus on the steady-state operation. We assume that there is a large number of messages to be broadcast in pipeline fashion, and we aim at maximizing the throughput, i.e., the (rational) number of messages which can be broadcast every time-step. We target heterogeneous platforms, modeled by a graph where resources have different communication and computation speeds. Achieving the best throughput may well require that the target platform is used in totality: We show that neither spanning trees nor DAGs are as powerful as general graphs. We show how to compute the best throughput using linear programming, and how to exhibit a periodic schedule, first when restricting to a DAG, and then when using a general graph. The polynomial compactness of the description comes from the decomposition of the schedule into several broadcast trees that are used concurrently to reach the best throughput. It is important to point out that a concrete scheduling algorithm based upon the steady-state operation is asymptotically optimal, in the class of all possible schedules (not only periodic solutions).