Message Scheduling for Parallel Data Redistribution between Clusters - Archive ouverte HAL Access content directly
Journal Articles IEEE Transactions on Parallel and Distributed Systems Year : 2006

Message Scheduling for Parallel Data Redistribution between Clusters

(1) , (2) , (3) , (4)
1
2
3
4
Emmanuel Jeannot
Nicolas Padoy
  • Function : Author
  • PersonId : 756513
  • IdRef : 14741167X
Frédéric Wagner
  • Function : Author
  • PersonId : 755686
  • IdRef : 098034766

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.
Not file

Dates and versions

inria-00097208 , version 1 (21-09-2006)

Identifiers

Cite

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, 2006, 17 (10), pp.1163-1175. ⟨10.1109/TPDS.2006.141⟩. ⟨inria-00097208⟩
123 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More