|
Discrete mathematics and mathematical cybernetics
Minimizing makespan for parallelizable jobs with energy constraint
A. Kononova, Yu. Zakharovaba a Sobolev Institute of Mathematics, 4, Koptyuga ave., Novosibirsk, 630090, Russia
b Dostoevsky Omsk State University, 55a, Mira ave., Omsk, 644077, Russia
Abstract:
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.
Received May 13, 2022, published August 30, 2022
Citation:
A. Kononov, Yu. Zakharova, “Minimizing makespan for parallelizable jobs with energy constraint”, Sib. Èlektron. Mat. Izv., 19:2 (2022), 586–600
Linking options:
https://www.mathnet.ru/eng/semr1523 https://www.mathnet.ru/eng/semr/v19/i2/p586
|
|