【摘要】 本文给出了网格计算资源的三层调度方案,并利用层次颜色 Petri 网对这一调度方案进行了建模与分析。对不同层次的资源调度建立了相应的颜色时延 Petri 网模型,不同层次的颜色时延 Petri 网模型可以有不同的行为表现,体现了网格计算资源的异构、自治等特点。给出了层次颜色 Petri 网的可达任务图的概念及构造算法,并利用可达任务图,对网格计算资源调度系统的运行状态进行了分析。更多还原

【Abstract】 A resource scheduling scheme with three-level for grid computing is proposed and is modeled and analyzed u- sing hierarchical colored Petri net in this paper.Different colored timed Petri net models for resource scheduling of dif- ferent layers are given in this paper.The colored timed Petri model for different layer has different behavior,which re- presents heterogeneous and autonomous features of grid computing resources.The concept and algorithm of Reachable Task Graph for hierarchical colored Petri net are given in this paper.Finally,we analyze the running state of resource scheduling for grid computing using reachable task graph.更多还原