Broadcast Trees for Heterogeneous Platforms
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Optimizing the steady-state throughput of scatter and reduce operations on heterogeneous platforms
Journal of Parallel and Distributed Computing
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
| Hi-index | 0.01 |
A heterogeneous cluster system consisting of different types of workstations and communication links plays an important role in parallel computing. In many applications onthe system, collective communication operations are commonly used as communication primitives. Thus, design of the efficient collective communication operations is the key to achieve high-performance parallel computing. But the heterogeneity of the system complicates the design. In this paper, we consider design of an efficient gather operation, one of the most important collective operations. We show that an optimal gather schedule is found in O(n2k-1) time for the heterogeneous cluster system with n processors od k distinct types, and that a nearly optimal schedule is found in 0(n) time if k=2.