|
|||||
|
|
| 网格环境下一种动态任务调度算法 | |
| 引用本文： | 刘欣媛,田庆海,周玮,杨志国,张忠平.网格环境下一种动态任务调度算法[J].燕山大学学报,2006,30(6):534-537. |
| 作者姓名： | 刘欣媛 田庆海 周玮 杨志国 张忠平 |
| 作者单位： | 1. 燕山大学,信息科学与工程学院,河北,秦皇岛,066004 2. 中国网通(集团)有限公司秦皇岛分公司,河北,秦皇岛,066000 3. 中国工商银行秦皇岛市分行,河北,秦皇岛,066000 |
| 基金项目： | 教育部科学技术研究重点项目 |
| 摘 要： | 针对网格系统中资源协同分配的动态性问题，分析了现有的基于有向无环图的资源映射方法，提出了一种动态资源协同分配算法。该算法采用有向无环图表示每个应用，然后，将所有这些图进行分层，执行过程中，就绪的应用组可以按照一定的规则动态插入。该算法解决了网格环境下资源和应用的动态性问题，从而更好的满足了网格的动态特性。 |
| 关 键 词： | 网格 动态资源协同分配 有向无环图 资源共享图 |
| 文章编号： | 1007-791X(2006)06-0534-04 |
| 修稿时间： | 2006年9月12日 |
A dynamic algorithm of task in grid environment |
|
| LIU Xin-yuan,TIAN Qing-hai,ZHOU Wei,YANG Zhi-guo,ZHANG Zhong-ping.A dynamic algorithm of task in grid environment[J].Journal of Yanshan University,2006,30(6):534-537. | |
| Authors: | LIU Xin-yuan TIAN Qing-hai ZHOU Wei YANG Zhi-guo ZHANG Zhong-ping |
| Abstract: | Based on the available resources mapping algorithm using the directed acyclic graph, a new dynamic resource co-alloc- ation algorithm is proposed to solve the dynamic problem of the resource co-allocation in the grid. In the proposed algorithm, each application is represented by a directed acyclic graph, andthen all directed acyclicgraphsarepartitionedinto several levels, during executing process, the ready application set can insert in term of a certain regular. This algorithm solves the dynamic problem of resources and applications in the grid environment, and thus can satisfy the dynamic requirements of the grid system. |
| Keywords: | grid dynamic resource co-allocation directed acyclic graph compatibility graph |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |
