Making schedules in multiprocessing systems with several additional resources
- Авторы: Furugyan M.1
-
Учреждения:
- Federal Research Center Information Science and Control
- Выпуск: Том 56, № 2 (2017)
- Страницы: 227-235
- Раздел: Systems Analysis and Operations Research
- URL: https://journals.rcsi.science/1064-2307/article/view/219838
- DOI: https://doi.org/10.1134/S1064230717020071
- ID: 219838
Цитировать
Аннотация
The problem of making a feasible schedule in a preemptive multiprocessing system with identical processors and several types of additional recourses is considered in the case when the task execution intervals are given and the durations of task execution linearly depend on the amount of the additional resource allocated to them. Algorithms based on reducing this problem to a network flow problem and a system of linear constraints are developed.
Об авторах
M. Furugyan
Federal Research Center Information Science and Control
Автор, ответственный за переписку.
Email: rtsccas@ya.ru
Россия, Moscow
![](/img/style/loading.gif)