| 计算网格无中心式调度框架的一种构造方法 |
| |
| 引用本文： | 张琳,黄仙姣. 计算网格无中心式调度框架的一种构造方法[J]. 河南师范大学学报(自然科学版), 2006, 34(2): 32-34 |
| |
| 作者姓名： | 张琳 黄仙姣 |
| |
| 作者单位： | 河南财经学院,计算中心,郑州,450002;河南财经学院,计算中心,郑州,450002 |
| |
| 摘 要： | 在无中心式调度框架下,为实现全局调度开销和局部调度开销的折衷,网格节点的平均邻接度应趋近某个适宜值,文章提出了一种构造方法.给定适宜的邻接度,可计算出每个新加入网格的节点应选择的邻居数.构造实验表明,这里的构造方法可使网格节点的邻接度近似趋近给定的邻接度,并可适应网格规模的不断扩大.
|
| 关 键 词： | 计算网格 作业调度 调度框架 邻接度 |
| 文章编号： | 1000-2367(2006)02-0032-03 |
| 收稿时间： | 2005-10-19 |
| 修稿时间： | 2005-10-19 |
The Method of Constructing De-Centralized Scheduling Frameworks for Computational Grids |
| |
| ZHANG Lin,HUANG Xian-jiao. The Method of Constructing De-Centralized Scheduling Frameworks for Computational Grids[J]. Journal of Henan Normal University(Natural Science), 2006, 34(2): 32-34 |
| |
| Authors: | ZHANG Lin HUANG Xian-jiao |
| |
| Abstract: | In de-centralized scheduling frameworks,to make tradeoff between the cost of global scheduling and the cost of local scheduling,the average adjacency degree of grid nodes should approach a certain appropriate value,so a construction method is proposed.Given an appropriate adjacency degree, the neighbor number of each incoming grid node may be calculated.As construction experiments show,the construction method can make the adjacency degrees of grid nodes approximately approach the given adjacency degree,and can adapt to the continuous expansion of grid. |
| |
| Keywords: | computational grids job scheduling scheduling framework adjacency degree |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
