Geodesic
Minimizing makespan for parallelizable jobs with energy constraint
Sibirskie èlektronnye matematičeskie izvestiâ, Tome 19 (2022) no. 2, pp. 586-600

Voir la notice de l'article provenant de la source Math-Net.Ru

We investigate the problem of scheduling parallelizable jobs to minimize the makespan under the given energy budget. A parallelizable job can be run on an arbitrary number of processors with a job execution time that depends on the number of processors assigned to it. We consider malleable and moldable jobs. Processors can vary their speed to conserve energy using dynamic speed scaling. Polynomial time algorithms with approximation guarantees are proposed. In our algorithms, a lower bound on the makespan and processing times of jobs are calculated. Then numbers of utilized processors are assigned for jobs and a feasible solution is constructed using a list-type scheduling rule.
Keywords: parallelizable job, speed scaling, scheduling, approximation algorithm. 
@article{SEMR_2022_19_2_a29,
     author = {A. Kononov and Yu. Zakharova},
     title = {Minimizing makespan for parallelizable jobs with energy constraint},
     journal = {Sibirskie \`elektronnye matemati\v{c}eskie izvesti\^a},
     pages = {586--600},
     publisher = {mathdoc},
     volume = {19},
     number = {2},
     year = {2022},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/SEMR_2022_19_2_a29/}
}
TY  - JOUR
AU  - A. Kononov
AU  - Yu. Zakharova
TI  - Minimizing makespan for parallelizable jobs with energy constraint
JO  - Sibirskie èlektronnye matematičeskie izvestiâ
PY  - 2022
SP  - 586
EP  - 600
VL  - 19
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/SEMR_2022_19_2_a29/
LA  - en
ID  - SEMR_2022_19_2_a29
ER  - 
%0 Journal Article
%A A. Kononov
%A Yu. Zakharova
%T Minimizing makespan for parallelizable jobs with energy constraint
%J Sibirskie èlektronnye matematičeskie izvestiâ
%D 2022
%P 586-600
%V 19
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/SEMR_2022_19_2_a29/
%G en
%F SEMR_2022_19_2_a29
A. Kononov; Yu. Zakharova. Minimizing makespan for parallelizable jobs with energy constraint. Sibirskie èlektronnye matematičeskie izvestiâ, Tome 19 (2022) no. 2, pp. 586-600. http://geodesic.mathdoc.fr/item/SEMR_2022_19_2_a29/