| 网格工作流动态调度研究 |
| |
| 引用本文： | 向培素,田珂,黄勤珍.网格工作流动态调度研究[J].微电子学与计算机,2007,24(10):78-80,84. |
| |
| 作者姓名： | 向培素 田珂 黄勤珍 |
| |
| 作者单位： | 1. 西南民族大学,电气信息工程学院,四川,成都,610041
2. 中兴通讯,成都研究所,四川,成都,610041 |
| |
| 摘 要： | 现有的网格工作流调度算法大都利用遗传算法所具有的并行性和全局解空间搜索的特点来解决工作流调度问题.但是,现有的调度算法没有对动态调度问题进行处理.文中针对网格服务的动态性,提出了服务资源信息中心的概念并给出了网格工作流管理系统的体系结构.在现有的基于遗传算法的网格工作流调度算法的基础上提出了网格服务工作流动态调度算法,补充了不同工作流过程模型的适应度函数的计算.
|
| 关 键 词： | 网格工作流 遗传算法 服务资源信息中心 动态调度 |
| 文章编号： | 1000-7180（2007）10-0078-03 |
| 修稿时间： | 2007-06-02 |
Study of Dynamic Scheduling for Grid Workflow |
| |
| XIANG Pei-su,TIAN Ke,HUANG Qin-zhen.Study of Dynamic Scheduling for Grid Workflow[J].Microelectronics & Computer,2007,24(10):78-80,84. |
| |
| Authors: | XIANG Pei-su TIAN Ke HUANG Qin-zhen |
| |
| Affiliation: | 1 College of Electrical Information Engineering ,Southwest University for Nationalities, Chengdu 610041, China; 2 Chengdu Institute of ZTE Corporation, Chengdu 610041, China |
| |
| Abstract: | As an NP problem, grid service workflow(GSF) 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 problem, so it is widely adopted by present papers. But most of them can not deal with the dynamic scheduling of grid service. Pointing to the problem, this paper proposes the concept of Center of service information and the architecture of service-oriented grid workflow. This paper also supplements the fitness calculation for different workflow model. In the end, the algorithm is proved to have better convergence by the analysis of instances. |
| |
| Keywords: | grid workflow genetic algorithm center of service information dynamic scheduling |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
