A Two-Level Scheduling Strategy for optimising communications of data parallel programs in clusters

Authors:
Ching-Hsien Hsu;Shih-Chang Chen
Affiliations:
Department of Computer Science and Information Engineering, Chung Hua University, 707, Sec. 2, WuFu Road, Hsinchu 30012, Taiwan.;College of Engineering, Chung Hua University, 707, Sec. 2, WuFu Road, Hsinchu 30012, Taiwan
Venue:
International Journal of Ad Hoc and Ubiquitous Computing
Year:
2010

Citing 19
Cited 3

Fast runtime block cyclic data redistribution on multiprocessors

Journal of Parallel and Distributed Computing
Scheduling Block-Cyclic Array Redistribution

IEEE Transactions on Parallel and Distributed Systems
A Generalized Basic-Cycle Calculation Method for Efficient Array Redistribution

IEEE Transactions on Parallel and Distributed Systems
Multi-phase array redistribution: modeling and evaluation

IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
Symbolic Communication Set Generation for Irregular Parallel Applications

The Journal of Supercomputing
An MPI prototype for compiled communication on Ethernet switched clusters

Journal of Parallel and Distributed Computing - Special issue: Design and performance of networks for super-, cluster-, and grid-computing: Part I
An Efficient Communication Scheduling Method for the Processor Mapping Technique Applied Data Redistribution

The Journal of Supercomputing
Messages Scheduling for Parallel Data Redistribution between Clusters

IEEE Transactions on Parallel and Distributed Systems
Optimizing Communications of Dynamic Data Redistribution on Symmetrical Matrices in Parallelizing Compilers

IEEE Transactions on Parallel and Distributed Systems
Essential Cycle Calculation Method for Irregular Array Redistribution

IEICE - Transactions on Information and Systems
Message Scheduling for Irregular Data Redistribution in Parallelizing Compilers

IEICE - Transactions on Information and Systems
Scheduling contention-free irregular redistributions in parallelizing compilers

The Journal of Supercomputing
Job scheduling and data replication on data grids

Future Generation Computer Systems
Data distribution schemes of sparse arrays on distributed memory multicomputers

The Journal of Supercomputing
Scheduling Messages For Data Redistribution: An Experimental Study

International Journal of High Performance Computing Applications
A flexible processor mapping technique toward data localization for block-cyclic data redistribution

The Journal of Supercomputing
ISO: comprehensive techniques toward efficient gen_block redistribution with multidimensional arrays

PaCT'07 Proceedings of the 9th international conference on Parallel Computing Technologies
Efficient multidimensional data redistribution for resizable parallel computations

ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications
On the complexity of the max-edge-coloring problem with its variants

ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies

SPHINX: a scheduling middleware for data intensive applications on a grid

International Journal of Internet Protocol Technology
User-defined schedulers for real-time concurrent objects

Innovations in Systems and Software Engineering
An improved partitioning mechanism for optimizing massive data analysis using MapReduce

The Journal of Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Irregular data distribution and redistribution have been attracting attention recently since it can distribute different size of data segments to heterogeneous processors. High Performance Fortran Version 2 (HPF2) provides GEN_BLOCK distribution format which facilitates generalised block distributions. In this paper, we present a two-level scheduling method to minimise the communication cost in such operations. The proposed technique isolates local messages from inter-processor messages and schedules both kinds of messages in separated steps to efficiently avoid synchronisation delay. The proposed technique which has been implemented with the traditional scheduling approach yields improved schedules for heterogeneous processors environment.