用Petri网结构化的方法求解实时并行运算调度问题
Real-Time Parallel Operation Scheduling Structurized by Petri Nets
-
摘要: 本文讨论多资源有顺序关系的运算调度问题.算法中每步所需时间已知,用Petri网建 模可使问题高度结构化,搜索空间只限于符合顺序的可行解部分[1],求得有资源约束及无资源 约束两种条件下并行处理的最小时间跨度和相应的调度方案,所得结果为精确解.Abstract: A method for scheduling operations with given precedence relation under multiple resources is proposed. The time duration of each operation is deterministic. Minimum time span of parallel processing without and with resource restrictions are solved. Modelling by Petri Nets makes the problem highly structurized, thus limiting the search space merely to feasible solutions subject to precedence relation. These engineering approaches are solved for analytical solutions.
-
Key words:
- Petri Nets /
- scheduling /
- parallel operations
-
点击查看大图
计量
- 文章访问数: 2532
- HTML全文浏览量: 80
- PDF下载量: 908
- 被引次数: 0
下载:
