|
ИСТИНА |
Войти в систему Регистрация |
ИСТИНА ПсковГУ |
||
An approximation algorithm for preemptive speed scaling scheduling of parallel jobs with migrationтезисы доклада
- Авторы: Kononov A., Kovalenko Yu V.
- Сборник: Learning and Intelligent Optimization. LION 2017
- Серия: Lecture Notes in Computer Science
- Том: 10556
- Тезисы
- Год издания: 2017
- Место издания: Springer, Cham Cham
- Первая страница: 351
- Последняя страница: 357
- DOI: 10.1007/978-3-319-69404-7_30
- Аннотация: In this paper we consider a problem of preemptive scheduling rigid parallel jobs on speed scalable processors. Each job is specified by its release date, its deadline, its processing volume and the number of processors, which are required for execution of the job. We propose a new strongly polynomial approximation algorithm for the energy minimization problem with migration of jobs.
- Добавил в систему: Кононов Александр Вениаминович