基于Petri网和并发调度标识图的并发任务调度的建模与分析  

Petri Net-and Concurrent Scheduling Marking Graph-based Modeling and Analysis of Concurrent Tasks Scheduling

作　　者：韩耀军[1] 

机构地区：[1]上海外国语大学国际工商管理学院信息管理系,上海200083

出　　处：《计算机科学》2014年第7期105-109,共5页Computer Science

基　　金：上海市哲学社会科学规划一般课题:基于语义网格的多语言信息资源检索与调度研究(2010BTQ001);上海外国语大学校级重大科研项目;上海外国语大学国际工商管理学院高层次培育项目资助

摘　　要：在云计算及网格计算环境下,由于资源具有分布、异构、动态、自治等特点,其并发任务的调度更加复杂,迫切需要强有力的图形与数学工具对其进行建模与分析。Petri网是描述与分析并发、异步、动态等事件的理想的图形与数学工具。给出了并发任务调度的加权时延Petri网模型。可达标识图是分析Petri网动态特性的一个重要工具,但它不能表达Petri网中变迁的并发关系,尤其是不便于分析被描述系统的时间特性。提出了并发调度标识图的概念,给出了构造时延Petri网的并发调度标识图的算法。最后,利用并发调度标识图分析了并行下载的时间特性。In cloud computing and grid computing environment, there is a need of powerful graphical and mathematics tools for modeling and analyzing concurrent tasks scheduling because these tasks have dynamic,distributed, and hetero- geneous properties. Petri nets are promising tools for modeling and analyzing events that are characterized as being con~ current, asynchronous, and dynamic. The weighted timed Petri net （WTdPN） model for concurrent tasks was given in this paper. Reachable marking graph is a very important tool to analyze the dynamic properties of Petri nets, but the concurrent relation of transitions in Petri nets can not be represented by reachable marking graph. Especially, it is not convenient to analyze time performance of system modeled by Petri net for the reachable marking graph. This paper presented the concept of concurrent scheduling marking graph（CSMG） and gave an algorithm for constructing concur- rent scheduling marking graph of WTdPN. Finally,we analyzed the time performance of parallel download system using CSMG of WTdPN.

关 键 词：时延PETRI网 并发可达调度图 并发任务 建模与分析 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]