计算网格无中心式调度框架的一种构造方法

The Method of Constructing De-Centralized Scheduling Frameworks for Computational Grids

在无中心式调度框架下,为实现全局调度开销和局部调度开销的折衷,网格节点的平均邻接度应趋近某个适宜值,文章提出了一种构造方法.给定适宜的邻接度,可计算出每个新加入网格的节点应选择的邻居数.构造实验表明,这里的构造方法可使网格节点的邻接度近似趋近给定的邻接度,并可适应网格规模的不断扩大.

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 calculat ed. 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.