|
Computational mathematics
Approximate schedules for non-migratory parallel jobs in speed-scaled multiprocessor systems
A. Kononov, Yu. Kovalenko Sobolev Institute of Mathematics,
4, pr. Koptyuga ave.,
Novosibirsk, 630090, Russia
Abstract:
We consider a problem of scheduling rigid parallel jobs on variable speed processors so as to minimize the total energy consumption. Each job is specified by its processing volume and the required number of processors. We propose new constant factor approximation algorithms for the non-migratory cases when all jobs have a common release time and/or a common deadline.
Keywords:
approximation algorithm, speed scaling, schedule, parallel job, migration.
Received June 3, 2018, published February 26, 2019
Citation:
A. Kononov, Yu. Kovalenko, “Approximate schedules for non-migratory parallel jobs in speed-scaled multiprocessor systems”, Sib. Èlektron. Mat. Izv., 16 (2019), 249–257
Linking options:
https://www.mathnet.ru/eng/semr1057 https://www.mathnet.ru/eng/semr/v16/p249
|
Statistics & downloads: |
Abstract page: | 247 | Full-text PDF : | 125 | References: | 24 |
|