On broadcasting in heterogenous networks

Authors:
Samir Khuller;Yoo-Ah Kim
Affiliations:
Unviersity of Maryland, College Park, MD;University of Maryland, College Park, MD
Venue:
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Year:
2004

Citing 14
Cited 9

Optimal broadcast and summation in the LogP model

SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Designing broadcasting algorithms in the Postal Model for message-passing systems

Proceedings of the 4th ACM symposium on Parallel algorithms and architectures
Interfacing Condor and PVM to harness the cycles of workstation clusters

Future Generation Computer Systems - Special issue: resource management in distributed systems
A high-performance, portable implementation of the MPI message passing interface standard

Parallel Computing
Efficient message passing interface (MPI) for parallel computing on clusters of workstations

Journal of Parallel and Distributed Computing - Special issue on workstation clusters and network-based computing
Multicasting in heterogeneous networks

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Broadcast scheduling optimization for heterogeneous cluster systems

Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A Case for NOW (Networks of Workstations)

IEEE Micro
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
Multicast on Irregular Switch-based Networks with Wormhole Routing

HPCA '97 Proceedings of the 3rd IEEE Symposium on High-Performance Computer Architecture
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

Broadcast Trees for Heterogeneous Platforms

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
A scalable group communication mechanism for mobile agents

Journal of Network and Computer Applications - Special issue: Network and information security: A computational intelligence approach
The impact of heterogeneity on master-slave scheduling

Parallel Computing
Contention awareness and fault-tolerant scheduling for precedence constrained tasks in heterogeneous systems

Parallel Computing
Efficient content distribution in wireless P2P networks

Proceedings of the 5th International ICST Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness
A heterogeneous peer-to-peer network testbed

ICUFN'09 Proceedings of the first international conference on Ubiquitous and future networks
Fast file dissemination in peer-to-peer networks with upstream bandwidth constraint

Future Generation Computer Systems
The impact of heterogeneity on master-slave on-line scheduling

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Heuristics for flash-dissemination in heterogenous networks

HiPC'06 Proceedings of the 13th international conference on High Performance Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we study a well known broadcasting heuristic for heterogenous networks of workstations, called fastest node first. We show that this heuristic produces an optimal solution for minimizing the sum of all completion times, and in addition produces a 1.5 approximation for the problem of minimizing the maximum completion time. We extend these results to show that the same bounds can be obtained for the multicast operation on such heterogenous networks. In addition we show that the problem of minimizing the maximum completion time is N P-hard, which settles the complexity of this open problem.