网格工作流调度算法研究综述

摘要

As an NP complete problem, grid workflow scheduling is usually solved by means of heuristics. The paper firstly assorted grid workflow scheduling algorithms, secondly analyzed and discussed its typical algorithms, then illustrated several typical grid workflow scheduling systems. Finally, gave the shortcomings and the further research trend.%作为一个NP完全问题,通常采用启发式算法来解决网格工作流调度.首先对网格工作流调度算法进行了分类,然后对其典型算法进行了分析和讨论,并阐述了一些典型网格工作流调度系统,最后指出了现有算法中的一些不足之处,展望了该领域的进一步研究方向.