Message Scheduling for Parallel Data Redistribution between Clusters

Abstract : 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.
Complete list of metadatas

https://hal.inria.fr/inria-00097208
Contributor : Emmanuel Jeannot <>
Submitted on : Thursday, September 21, 2006 - 11:13:50 AM
Last modification on : Thursday, May 16, 2019 - 6:46:13 PM

Identifiers

Citation

Johanne Cohen, Emmanuel Jeannot, Nicolas Padoy, Frédéric Wagner. Message Scheduling for Parallel Data Redistribution between Clusters. IEEE Transactions on Parallel and Distributed Systems, Institute of Electrical and Electronics Engineers, 2006, 17 (10), pp.1163-1175. ⟨10.1109/TPDS.2006.141⟩. ⟨inria-00097208⟩

Share

Metrics

Record views

267