Approximate algorithms scheduling parallelizable tasks
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
ScaLAPACK user's guide
Scheduling Block-Cyclic Array Redistribution
IEEE Transactions on Parallel and Distributed Systems
Open Shop Scheduling to Minimize Finish Time
Journal of the ACM (JACM)
Efficient Algorithms for Block-Cyclic Array Redistribution Between Processor Sets
IEEE Transactions on Parallel and Distributed Systems
Design and implementations of Ninf: towards a global computing infrastructure
Future Generation Computer Systems - Special issue on metacomputing
A Parallel CORBA Component Model for Numerical Code Coupling
GRID '02 Proceedings of the Third International Workshop on Grid Computing
CPR: Mixed Task and Data Parallel Scheduling for Distributed Systems
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Efficient Block Cyclic Data Redistribution
Euro-Par '96 Proceedings of the Second International Euro-Par Conference on Parallel Processing - Volume I
One-Step Algorithm for Mixed Data and Task Parallel Scheduling without Data Replication
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
PACO++: A Parallel Object Model for High Performance Distributed Systems
HICSS '04 Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 9 - Volume 9
Improving the GridRPC Model with Data Persistence and Redistribution
ISPDC '04 Proceedings of the Third International Symposium on Parallel and Distributed Computing/Third International Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Networks
Data Redistribution and Remote Method Invocation in Parallel Component Architectures
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Improving communication scheduling for array redistribution
Journal of Parallel and Distributed Computing
Message scheduling for array re-decomposition on distributed memory systems
Future Generation Computer Systems
A Two-Level Scheduling Strategy for optimising communications of data parallel programs in clusters
International Journal of Ad Hoc and Ubiquitous Computing
A compound scheduling strategy for irregular array redistribution in cluster based parallel system
MTPP'10 Proceedings of the Second Russia-Taiwan conference on Methods and tools of parallel programming multicomputers
Globe'11 Proceedings of the 4th international conference on Data management in grid and peer-to-peer systems
Fast and efficient total exchange on two clusters
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
| Hi-index | 0.00 |
Data redistribution has been widely studied in the literature. In recent years, several papers proposed scheduling algorithms to execute redistributions under different constraints in a minimal amount of time. More recently, with the expansion of grid computing, several algorithms have been proposed to schedule the messages in a redistribution taking place between two distant clusters. Here, we describe different existing scheduling methods and explain the differences between them. We present a comparison between them for the cases of local redistributions and inter-cluster redistributions.