Broadcast scheduling optimization for heterogeneous cluster systems
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Broadcast scheduling optimization for heterogeneous cluster systems
Journal of Algorithms
An Adaptive Communication System for Heterogeneous Network Computing
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
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
Optimal sharing of bags of tasks in heterogeneous clusters
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
An Overview of MSHN: The Management System for Heterogeneous Networks
HCW '99 Proceedings of the Eighth Heterogeneous Computing Workshop
Efficient Multiple Multicast on Heterogeneous Network of Workstations
The Journal of Supercomputing
On broadcasting in heterogenous networks
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Pipelining Broadcasts on Heterogeneous Platforms
IEEE Transactions on Parallel and Distributed Systems
Efficient trigger-broadcasting in heterogeneous clusters
Journal of Parallel and Distributed Computing
A Parallel Computational Model for Heterogeneous Clusters
IEEE Transactions on Parallel and Distributed Systems
Mapping pipeline skeletons onto heterogeneous platforms
Journal of Parallel and Distributed Computing
Multi-Criteria Scheduling of Pipeline Workflows (and Application To the JPEG Encoder)
International Journal of High Performance Computing Applications
An efficient collective communication method for grid scale networks
ICCS'03 Proceedings of the 2003 international conference on Computational science
A clustering model for multicast on hypercube network
GPC'08 Proceedings of the 3rd international conference on Advances in grid and pervasive computing
Centralized versus distributed schedulers for multiple bag-of-task applications
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
The impact of heterogeneity on master-slave on-line scheduling
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Improving multilevel approach for optimizing collective communications in computational grids
EGC'05 Proceedings of the 2005 European conference on Advances in Grid Computing
A two-phase scheduling algorithm for efficient collective communications of MPICH-G2
ICDCIT'05 Proceedings of the Second international conference on Distributed Computing and Internet Technology
SC '12 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
Throughput optimization for pipeline workflow scheduling with setup times
Euro-Par'12 Proceedings of the 18th international conference on Parallel processing workshops
Euro-Par'12 Proceedings of the 18th international conference on Parallel processing workshops
Scientific Programming - Selected Papers from Super Computing 2012
Hi-index | 0.00 |
The Information Power Grid (IPG) is emerging as an infrastructure that will enable distributed applications -- such as video conferencing and distributed interactive simulation -- to seamlessly integrate collections of heterogeneous workstations, multiprocessors, and mobile nodes, over heterogeneous wide-area networks. This paper introduces a framework for developing efficient collective communication schedules in such systems. Our framework consists of analytical models of the heterogeneous system, scheduling algorithms for the collective communication pattern, and performance evaluation mechanisms. We show that previous models, which considered node heterogeneity but ignored network heterogeneity, can lead to solutions which are worse than the optimal by an unbounded factor. We then introduce an enhanced communication model, and develop three heuristic algorithms for the broadcast and multicast patterns. The completion time of the schedule is chosen as the performance metric. The heuristic algorithms are FEF (Fastest Edge First), ECEF (Earliest Completing Edge First), and ECEF with look-ahead. For small system sizes, we find the optimal solution using exhaustive search. Our simulation experiments indicate that the performance of our heuristic algorithms is close to optimal. For performance evaluation of larger systems, we have also developed a simple lower bound on the completion time. Our heuristic algorithms achieve significant performance improvements over previous approaches.