A time-wavelength assignment algorithm for a WDM star network
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 3)
Approximate algorithms scheduling parallelizable tasks
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Scheduling transmissions in WDM broadcast-and-select networks
IEEE/ACM Transactions on Networking (TON)
Efficient scheduling of transmissions in optical broadcast networks
IEEE/ACM Transactions on Networking (TON)
Component software: beyond object-oriented programming
Component software: beyond object-oriented programming
Scheduling Block-Cyclic Array Redistribution
IEEE Transactions on Parallel and Distributed Systems
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 Generalized Processor Mapping Technique for Array Redistribution
IEEE Transactions on Parallel and Distributed Systems
A Framework for Efficient Data Redistribution on Distributed Memory Multicomputers
The Journal of Supercomputing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
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
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
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 Management in Grid Applications Providers
DFMA '05 Proceedings of the First International Conference on Distributed Frameworks for Multimedia Applications
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
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs
SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
Optimal routing for end-to-end guarantees: the price of multiplexing
Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
A flexible processor mapping technique toward data localization for block-cyclic data redistribution
The Journal of Supercomputing
Scheduling in a dynamic heterogeneous distributed system using estimation error
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
| Hi-index | 0.00 |
We study the problem of redistributing data between clusters interconnected by a backbone. We suppose that at most k communications can be performed at the same time (the value of k depending on the characteristics of the platform). Given a set of messages, we aim at minimizing the total communication time assuming that communications can be preempted and that preemption comes with an extra cost. Our problem, called k{\hbox{-}}Preemptive Bipartite Scheduling (KPBS) is proven to be NP-hard. We study its lower bound. We propose two {\frac{8}{3}}{\hbox{-}}{\rm{approximation}} algorithms with low complexity and fast heuristics. Simulation results show that both algorithms perform very well compared to the optimal solution and to the heuristics. Experimental results, based on an MPI implementation of these algorithms, show that both algorithms outperform a brute-force TCP-based solution, where no scheduling of the messages is performed.