Parallel and Distributed Processing Symposium, International (2008)
Miami, FL, USA
Apr. 14, 2008 to Apr. 18, 2008
Olivier Beaumont , Université de Bordeaux, INRIA - Sud-Ouest, France
Lionel Eyraud-Dubois , Université de Bordeaux, INRIA - Sud-Ouest, France
Nicolas Bonichon , Université de Bordeaux, INRIA - Sud-Ouest, France
In this paper, we discuss complexity issues for scheduling divisible workloads on heterogeneous systems under the bounded multi-port model. To our best knowledge, this paper is the first attempt to consider divisible load scheduling under a realistic communication model, where the master node can communicate simultaneously to several slaves, provided that bandwidth constraints are not exceeded. In this paper, we concentrate on one round distribution schemes, where a given node starts its processing only once all data has been received. Our main contributions are (i) the proof that processors start working immediately after receiving their work (ii) the study of the optimal schedule in the case of 2 processors and (iii) the proof that scheduling divisible load under the bounded multi-port model is NP-complete. This last result strongly differs from divisible load literature and represents the first NP-completeness result when latencies are not taken into account.
Olivier Beaumont, Lionel Eyraud-Dubois, Nicolas Bonichon, "Scheduling divisibleworkloads on heterogeneous platforms under bounded multi-port model", Parallel and Distributed Processing Symposium, International, vol. 00, no. , pp. 1-7, 2008, doi:10.1109/IPDPS.2008.4536170