一种并行的网格资源协同分配方法

针对网格系统中资源协同分配的实时性问题,分析了现有的基于有向无环图的资源映射方法,提出了一种并行资源协同分配算法.该算法采用有向无环图表示每个应用,然后,将所得到的这些图合并成一个有向无环图并对其进行分层,最后,对每层中应用任务的资源分配问题并行处理.分析表明,该并行资源协同分配算法降低了系统中资源调度时间,提高了资源分配的效率,从而能够满足系统实时性要求.

A parallel method of resources co-allocation in grid system

Based on the available resources mapping methods using the directed acyclic graph, a new parallel resources co-allocation algorithm was proposed to solve the real-time problem of the resources co-allocation in the grid. In the proposed algorithm, each application is represented by a directed acyclic graph, and then all directed acyclic graphs representing applications are combined into one united directed acyclic graph. In succession, the united graph is partitioned into several levels, and the resources co-allocation problems in different levels are processed simultaneously. Analyses show that the parallel algorithm reduces the scheduling time of the resources allocation and improves the efficiency of resources co-allocation, and thus can satisfy the real-time requirements of the grid system.