Scheduling 2-Dimensional grids with large communication delays

Abstract : Most parallel and distributed platforms available today show a large unbalance between slow communications and fast local computations which makes the scheduling of tasks much harder to handle efficiently. The so called scheduling with large communication delays problem has been proved to be NP-hard even in some restricted cases. Its status regarding approximation is still unknown. In this work, we propose to study this challenging problem for graphs with a specific structure of 2-dimensional grids. More precisely, we provide lower and upper bounds for both sub-problems of unbounded number of processors and two processors. We show in both cases that the proposed scheduling algorithms are close to lower bounds.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01101728
Contributor : Grégory Mounié <>
Submitted on : Friday, January 9, 2015 - 2:43:28 PM
Last modification on : Thursday, April 4, 2019 - 10:18:05 AM

Links full text

Identifiers

Collections

INRIA | UGA | LIG

Citation

Daoudi El Mostafa, Frédéric Wagner, D. Trystram. Scheduling 2-Dimensional grids with large communication delays. RAIRO - Operations Research, EDP Sciences, 2014, 49, pp.369-381. ⟨10.1051/ro/2014048⟩. ⟨hal-01101728⟩

Share

Metrics

Record views

247