Malleable scheduling for flows of jobs and applications to MapReduce
Year of publication: |
2019
|
---|---|
Authors: | Nagarajan, Viswanath ; Wolf, Joel ; Balmin, Andrey ; Hildrum, Kirsten |
Published in: |
Journal of scheduling. - New York, NY : Springer Science + Business Media LLC, ISSN 1094-6136, ZDB-ID 1492486-9. - Vol. 22.2019, 4, p. 393-411
|
Subject: | Parallel scheduling | Precedence constraints | Approximation algorithms | MapReduce | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm |
-
Wang, Tianyu, (2019)
-
Scheduling unit-length jobs with precedence constraints of small height
Berger, André, (2014)
-
Procedures for the bin packing problem with precedence constraints
Pereira, Jordi, (2016)
- More ...
-
Nagarajan, Viswanath, (2008)
-
Tight bounds for permutation flow shop scheduling
Nagarajan, Viswanath, (2009)
-
On the maximum quadratic assignment problem
Nagarajan, Viswanath, (2009)
- More ...