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

基于Petri网和并发调度标识图的并发任务调度的建模与分析 韩耀军 （上海外国语大学国际工商管理学院信息管理系 上海 200083 ） 摘 要 在云计算及网格计算环境下，由于资源具有分布、异构、动态、自治等特点，其并发任务的调度更加复杂，迫切需 要强有力的图形与数学工具对其进行建模与分析。Petri 网是描述与分析并发、异步、动态等事件理想的图形与数学工具。 给出了并发任务调度的加权时延 Petri 网模型。可达标识图是分析 Petri 网动态特性的一个重要工具，但它不能表达 Petri 网 中变迁的并发关系，尤其是它不便于分析被描述系统的时间特性。提出了并发调度标识图的概念，给出了构造时延 Petri 网 的并发调度标识图的算法。最后，利用并发调度标识图分析了并行下载的时间特性。 关键词 时延Petri 网，并发可达调度图，并发任务，建模与分析 中图法分类号 TP301 文献标识码 A Petri Net and Concurrent Scheduling Marking Graph Based Modeling and Analysis of Concurrent Tasks Scheduling HAN Yao-jun (Department of Information Management, College of International Business, Shanghai International Studies University, Shanghai 200083, China) Abstract In cloud computing and grid computing environment, there is a need for powerful graphical and mathematics tools for modeling and analyzing concurrent tasks scheduling because these tasks have dynamic, distributed, and heterogeneous properties. Petri nets are promising tools for modeling and analysis events that are characterized as being concurrent, asynchronous, and dynamic. The weighted timed Petri net (WTdPN) models for concurrent tasks is 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 presents the concept of concurrent scheduling marking graph (CSMG) and gives an algorithm for constructing concurrent scheduling marking graph of WTdPN. Finally, we analyze the time performance of parallel download system using CSMG of WTdPN Keywords Timed Pe