Scheduling in Multiprocessor Systems with Additional Restrictions
- Авторы: Furugyan M.1
-
Учреждения:
- Dorodnicyn Computing Center
- Выпуск: Том 57, № 2 (2018)
- Страницы: 222-229
- Раздел: Systems Analysis and Operations Research
- URL: https://journals.rcsi.science/1064-2307/article/view/220079
- DOI: https://doi.org/10.1134/S1064230718020077
- ID: 220079
Цитировать
Аннотация
An admissible multiprocessor preemptive scheduling problem is solved for the given execution intervals. In addition, a number of generalizations are considered—interprocessor communications are arbitrary and may vary in time; costs for processing interruptions and switches from one processor to another are taken into account; and besides the processors, additional resources are used. Algorithms based on reducing the original problem to finding paths of a specific length in a graph, a flow problem, and an integer system of linear restrictions are developed.
Об авторах
M. Furugyan
Dorodnicyn Computing Center
Автор, ответственный за переписку.
Email: rtsccas@ya.ru
Россия, Moscow, 119991