FPT approximation algorithm for scheduling with memory constraints

Abstract : In this paper we study a scheduling problem motivated by performing intensive numerical simulations on large meshes. In order to run the simulation as fast as possible, we must allocate computations on different processors such that the makespan is minimized, but also take care of the limited memory on each processor. We present a dynamic programming based algorithm that ensures that both of these objectives are satisfied, within a ratio of 1 + ε. Our algorithm is fixed-parameter tractable (FPT) with respect to the path-width of the graph. For sake of readability, the algorithm is presented for two identical machines, but it can be generalized for a fixed number of unrelated processors.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01367737
Contributor : Frédéric Davesne <>
Submitted on : Friday, September 16, 2016 - 3:49:28 PM
Last modification on : Monday, October 28, 2019 - 10:50:22 AM

Identifiers

Citation

Eric Angel, Cédric Chevalier, Franck Ledoux, Sébastien Morais, Damien Regnault. FPT approximation algorithm for scheduling with memory constraints. 22nd International Conference on Parallel and Distributed Computing (Euro-Par 2016), Aug 2016, Grenoble, France. pp.196--208, ⟨10.1007/978-3-319-43659-3_15⟩. ⟨hal-01367737⟩

Share

Metrics

Record views

187