Cited By
View all- Agrawal PRao S(2021)Energy-efficient scheduling: classification, bounds, and algorithmsSādhanā10.1007/s12046-021-01564-w46:1Online publication date: 26-Feb-2021
Divisible load applications occur in many fields of science and engineering and can be easily parallelized in a master-worker fashion, but pose several scheduling challenges. While a number of approaches have been proposed that allocate load to workers ...
In this paper we analyze MapReduce distributed computations as a divisible load scheduling problem. The two operations of mapping and reducing can be understood as two divisible applications with precedence constraints. A divisible load model of the ...
We consider the constrained parallel-machine scheduling problem with divisible processing times and penalties (the CPS-DTP problem, for short). Specifically, given a set of m identical machines, and a set of n jobs, ...
Association for Computing Machinery
New York, NY, United States
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in