|
ИСТИНА |
Войти в систему Регистрация |
ИСТИНА ПсковГУ |
||
Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterionстатья
Статья опубликована в высокорейтинговом журнале
Информация о цитировании статьи получена из
Scopus
Статья опубликована в журнале из списка Web of Science и/или Scopus
Дата последнего поиска статьи во внешних источниках: 8 октября 2025 г.
- Авторы: Kononov A., Zakharova Y.
- Журнал: Journal of Global Optimization
- Том: 83
- Номер: 3
- Год издания: 2022
- Издательство: Springer Nature
- Местоположение издательства: Switzerland
- Первая страница: 539
- Последняя страница: 564
- DOI: 10.1007/s10898-021-01115-x
- Аннотация: We are given a set of parallel jobs that have to be executed on a set of speed-scalable processors varying their speeds dynamically. Running a job at a slower speed is more energy-efficient, however, it takes a longer time and affects the performance. Every job is characterized by the processing volume and the number or the set of the required processors. Our objective is to minimize the maximum completion time so that the energy consumption is not greater than a given energy budget. For various particular cases, we propose polynomial-time approximation algorithms, consisting of two stages. At the first stage, we give an auxiliary convex program. By solving this problem, we get processing times of jobs and a lower bound on the makespan. Then, at the second stage, we transform our problem into the correspondingscheduling problem with the constant speed of processors and construct a feasible schedule.We also obtain an “almost exact” solution for the preemptive settings based on a configuration linear program.
- Добавил в систему: Кононов Александр Вениаминович