Scheduling in Multiprocessor Systems with Additional Restrictions

被引:0
|
作者
M. G. Furugyan
机构
[1] Russian Academy of Sciences,Dorodnicyn Computing Center
关键词
D O I
暂无
中图分类号
学科分类号
摘要
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.
引用
收藏
页码:222 / 229
页数:7
相关论文
共 50 条