Efficient trigger-broadcasting in heterogeneous clusters

Authors:
Pierre Fraigniaud;Bernard Mans;Arnold L. Rosenberg
Affiliations:
CNRS, Lab. de Recherche en Informatique, Université Paris-Sud, 91405 Orsay cedex, France;Department of Computing, University of Macquarie, Sydney, NSW 2109, Australia;Department of Computer Science, University of Massachusetts Amherst, Amherst, MA 01003, USA
Venue:
Journal of Parallel and Distributed Computing
Year:
2005

Citing 27
Cited 0

Optimum Broadcasting and Personalized Communication in Hypercubes

IEEE Transactions on Computers
Methods and problems of communication in usual networks

Proceedings of the international workshop on Broadcasting and gossiping 1990
Designing broadcasting algorithms in the Postal Model for message-passing systems

Proceedings of the 4th ACM symposium on Parallel algorithms and architectures
Approximation Algorithms for Minimum-Time Broadcast

SIAM Journal on Discrete Mathematics
LogP: a practical model of parallel computation

Communications of the ACM
Approximation algorithms for structured communication problems

Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Approximation algorithms for broadcasting and gossiping

Journal of Parallel and Distributed Computing
LogGP: incorporating long messages into the LogP model for parallel computation

Journal of Parallel and Distributed Computing
Coordinating parallel processes on networks of workstations

Journal of Parallel and Distributed Computing
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
Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties

Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
On multicast algorithms for heterogeneous networks of workstations

Journal of Parallel and Distributed Computing - Special issue on cluster and network-based computing
Message Multicasting in Heterogeneous Networks

SIAM Journal on Computing
A Case for NOW (Networks of Workstations)

IEEE Micro
Sublogarithmic approximation for telephone multicast: path out of jungle (extended abstract)

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient Collective Communication on Heterogeneous Networks of Workstations

ICPP '98 Proceedings of the 1998 International Conference on Parallel Processing
Broadcasting and Multicasting in Cut-through Routed Networks

IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Approximation Algorithms for Minimum-Time Broadcast under the Vertex-Disjoint Paths Mode

ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Optimal sharing of bags of tasks in heterogeneous clusters

Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Multicast on Irregular Switch-based Networks with Wormhole Routing

HPCA '97 Proceedings of the 3rd IEEE Symposium on High-Performance Computer Architecture
Efficient Multicast in Heterogeneous Networks of Workstations

ICPP '00 Proceedings of the 2000 International Workshop on Parallel Processing
Optimal Contention-Free Unicast-Based Multicasting in Switch-Based Networks of Workstations

IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Efficient Barrier Synchronization Mechanism for the BSP Model on Message-Passing Architectures

IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Efficient Collective Communication in Distributed Heterogeneous Systems

ICDCS '99 Proceedings of the 19th IEEE International Conference on Distributed Computing Systems
Approximation algorithm for directed telephone multicast problem

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Broadcasts in parallel computing environments are often used to trigger ''personal'' computations at the processors (or, nodes) that comprise the system. (The qualifier ''personal'' means that the triggered computations may differ in type and complexity at each node.) We present an algorithm for trigger-broadcasting in a node-heterogeneous cluster of workstations, which comes predictably close to minimizing the time for completing both the broadcast and the computations it triggers. The algorithm orchestrates its broadcast taking account of: the speeds of the cluster's constituent workstations, the speed of the cluster's network, and the complexities of the computations that the broadcast triggers. The algorithm is within a constant factor of optimal when the speeds of the cluster's workstations and of its network are independent of the number of workstations. The algorithm is exactly optimal when the cluster is homogeneous-no matter how diverse the ''personal'' computations are.