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
![](/img/style/loading.gif)