Scheduling Algorithms for Efficient Gather Operations in Distributed Heterogeneous Systems

Authors:
Jun-ichi Hatta;Susumu Shibusawa
Affiliations:
-;-
Venue:
ICPP '00 Proceedings of the 2000 International Workshop on Parallel Processing
Year:
2000

Citing 0
Cited 8

Scheduling Strategies for Master-Slave Tasking on Heterogeneous Processor Grids

PARA '02 Proceedings of the 6th International Conference on Applied Parallel Computing Advanced Scientific Computing
Optimizing the steady-state throughput of scatter and reduce operations on heterogeneous platforms

Journal of Parallel and Distributed Computing
Accurate and Efficient Estimation of Parameters of Heterogeneous Communication Performance Models

International Journal of High Performance Computing Applications
Accurate Heterogeneous Communication Models and a Software Tool for Their Efficient Estimation

International Journal of High Performance Computing Applications
Two algorithms of irregular scatter/gather operations for heterogeneous platforms

EuroMPI'10 Proceedings of the 17th European MPI users' group meeting conference on Recent advances in the message passing interface
Efficient and reliable network tomography in heterogeneous networks using BitTorrent broadcasts and clustering algorithms

SC '12 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
MPI vs. bittorrent: switching between large-message broadcast algorithms in the presence of bottleneck links

Euro-Par'12 Proceedings of the 18th international conference on Parallel processing workshops
Efficient and reliable network tomography in heterogeneous networks using BitTorrent broadcasts and clustering algorithms

Scientific Programming - Selected Papers from Super Computing 2012

Quantified Score

Hi-index	0.00

Visualization

Abstract

Advances in networks and the availability of low-cost PCs and workstations have resulted in PC/workstation clusters being used as a computer environment that replaces parallel computers. These clusters recently comprise different kinds of nodes and are connected over different kinds of networks, such as Ethernet and Myrinet. They are called distributed heterogeneous systems, and efficient collective communication operations for them have been studied. In this paper, we propose heuristic scheduling algorithms for efficient gather operations in distributed heterogeneous systems, and we present the results of simulations evaluating their performance. These results show that gather operations scheduled by these algorithms are more efficient than sequential gather operations in these systems. They also show that, the efficiency of gather operations scheduled by the algorithms depends on the ratio of the cost that depends on message size in point-to-point communication to the cost that does not depend on message size in point-to-point communication.