网格计算资源调度方案及其Petri网建模与分析  

Modeling and Analyzing of Resource Scheduling Scheme for Grid Computing Using Petri Nets

作　　者：韩耀军[1,2] 

机构地区：[1]上海外国语大学国际经济贸易管理学院 [2]同济大学计算机科学与工程系,上海200092

出　　处：《系统仿真学报》2006年第4期824-828,共5页Journal of System Simulation

基　　金：国家重大研究计划(90412013);国家重点基础研究发展计划(973)项目(2004CB318001-03);国家自然科学基金项目(60473094);上海外国语大学科学研究基金项目

摘　　要：通过对现有网格计算资源调度方案的分析,提出了网格计算资源的三层调度方案,该方案与已有的方案相比,更能体现网格资源的特点。利用Petri网这一具有描述并发、异步、动态等事件能力的图形与数学工具,对所提出的调度方案进行了模拟与分析。为不同层次的调度者构造了不同的扩展有色时延Petri网模型,并利用Petri网的共享合成技术得到整个系统的Petri网模型。同时给出了资源调度所对应的Petri网的可达任务图的概念,利用可达任务图,分析了诸如吞吐量、负载平衡、调度时间等资源调度的一些重要特性。A resource scheduling scheme with three-level for grid computing was proposed by analyzing the present resource scheduling schemes. The scheme shows more features of grid resources than present schemes. The three-level resource scheduling scheme was model and analyzed using Petri net which is a powerful graphical and mathematical tool for describing the concurrent, asynchronous and dynamic events. Different extended colored timed Petri net models for different scheduling levels were constructed. A Petri net model for whole system was got by sharing synthesis of Petri nets. A concept of reachable task graph of Petri net corresponding to the resource scheduling was proposed. Some important results such as throughput, load balance and makespan on resource scheduling were analyzed by the reachable task graph.

关 键 词：网格计算 资源调度方案 PETRI网 共享合成 可达任务图 

分 类 号：TP393[自动化与计算机技术—计算机应用技术] TP301[自动化与计算机技术—计算机科学与技术]