|
ИСТИНА |
Войти в систему Регистрация |
ИПМех РАН |
||
Algorithms of Computation Scheduling in Real-Time Multiprocessor Systems with Additional Resourcesстатья
- Автор: Meran Furugyan
- Сборник: Recent Advances of the Russian Operations Research Society
- Редактор: Васин Александр Алексеевич
- Год издания: 2020
- Место издания: Cambridge Scholars Publishing Lady Stephenson Library, Newcastle upon Tune, NE6 2PA, UK
- Первая страница: 241
- Последняя страница: 255
- Номер статьи: 14
- Аннотация: The problem of feasible scheduling in a multiprocessor real-time system is considered when directive intervals are assigned. There is additional resource, and the time for executing jobs depends linearly on the amount of additional resource allocated to them. Problems of permitted interruptions, switching from one processor to another, and non-preemptive scheduling, are examined. In the first case, the original problem is reduced to a network-flow problem and a linear programming problem, while in the second case the pseudo-polynomial algorithm was developed. If there is no feasible schedule for a given amount of the additional resource, we consider the problem of optimal correction of directive intervals. The solution to this problem is based on reducing the original problem to one of minimum cost flow.
- Добавил в систему: Фуругян Меран Габибуллаевич