系 统 仿 真 学 报 Vol. 17 增刊
166 JOURNAL OF SYSTEM SIMULATION Oct. 2005
主从任务调度的T-时间Petri 网
张金泉 倪丽娜 蒋昌俊
同济大学计算机科学与工程系, 上海 200092; 山东科技大学计算机科学系, 青岛 266510
摘 要 任务调度是一个NP-hard 问题 并且是并行与分布式计算必不可少的组成部分 本文首先
提出了适合描述异构环境下独立 等尺寸的大规模任务调度问题的T-时间Petri 网模型 然后给出
了刻画该模型运行的并发可达图的构造算法 最后 在并发可达图中得到了最优调度策略 该策略
实现了稳定状态的最优调度 有效地缩短了调度的初始化及清除阶段的时间
关键词 任务调度 Petri 网 T-时间Petri 网 并发可达标识 并发可达图
文章编号 1004-731X (2005) S-166-04 中图分类号 TP391.9 文献标识码 A
A T-time Petri net for Master-Slave Task Scheduling
ZHANG Jin-quan, NI Li-na, JIANG Chang-jun
Department of Computer Science & Engineering, Tongji University, Shanghai 200092, China
Department of Computer Science, Shan Dong University of Science & Tech, Qingdao 266510, China
Abstract: Task scheduling is an NP- Hard problem and is an integral part of parallel and distributed computing. This paper
presents a T-time Petri net for modeling the scheduling problem of a collection of independent, equal-sized tasks on
heterogeneous environment. Then the constructing algorithm of the concurrency reachability graph for characterizing the
running of the T-time Petri net is proposed. Finally, an optimal scheduling strategy is achieved in our proposed concurrency
reachability graph. The strategy implements the optimal scheduling on steady-state and reduces effectively the time during the
initial phase and the clearing phase of a scheduling procedure.
Key words: task scheduling; Petri net; T-time Petri net; concurrency reachability marking; co