| 一种面向服务的网格工作流调度算法 |
| |
| 引用本文： | 郭文彩 杨扬. 一种面向服务的网格工作流调度算法[J]. 计算机科学, 2006, 33(6): 132-134 |
| |
| 作者姓名： | 郭文彩 杨扬 |
| |
| 作者单位： | 北京科技大学信息学院,北京100083;北京科技大学信息学院,北京100083 |
| |
| 摘 要： | 面向服务的网格工作流的研究已成为网格领域的研究热点。由网格服务：组成的工作流（GSF）的调度问题是一个典型的NP问题，由于遗传算法具有并行性和全局解空间搜索的特点，非常适合解决这个问题。因此，本文首先给出GSF的GA定义，然后提出基于遗传算法的网格服务工作流调度算法GSFGA，并通过应用实例验证了该算法优于传统的调度算法，作为结论本文指出了下一步的研究工作。
|
| 关 键 词： | 网格服务 工作流 调度 遗传算法 |
Genetic Scheduling Algorithm for Service Oriented Grid Workflow |
| |
| GUO Wen-Cai,YANG Yang (School of Information Engineering,Beijing University of Science and Technology,Beijing. Genetic Scheduling Algorithm for Service Oriented Grid Workflow[J]. Computer Science, 2006, 33(6): 132-134 |
| |
| Authors: | GUO Wen-Cai YANG Yang (School of Information Engineering Beijing University of Science Technology Beijing |
| |
| Affiliation: | School of Information Engineering, Beijing University of Science and Technology, Beijing 100083 |
| |
| Abstract: | The service oriented grid workflow,GSF, has been a research focus in grid technology. As an NP problem, grid service scheduling is difficult to be solved by means of classic algorithms. Featured in searching concurrently and globally, genetic algorithm can be a better option for solving GSF scheduling problera, therefore, a GA based grid service scheduling algorithm,GSFGA, is provided for obtaining the best GSF instance with highest fitness in this paper. The experiment results prove it available and better than some traditional algorithms. As a conclusion, the further work is also pointed out. |
| |
| Keywords: | Grid service Workflow Scheduling Genetic algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
点击此处可从《计算机科学》下载全文 |
