一种基于任务复制方法的网格调度算法  

A New Grid Scheduling Algorithm Based on Task Replication

作　　者：吕桦[1] 钟诚[1] 李智[1] 

机构地区：[1]广西大学计算机与电子信息学院,广西南宁530004

出　　处：《计算机技术与发展》2006年第8期66-68,71,共4页Computer Technology and Development

基　　金：广西科学基金资助项目(桂科基0575014);广西科技信息网络中心资助项目

摘　　要：根据Internet上存在大量空闲主机的情况,结合流行的P2P的思想给出了一种基于资源代理的网格系统模型,该模型能提供超级计算能力给一般的用户。针对在像网格这样的大规模系统中部署大量监控组件的困难性,设计了一种基于任务复制的调度算法。该算法无需任何有关环境的预测信息,仅需知道任务的相对长度,就可在执行过程中自动地适应网格的动态性,并且具有容错功能。For the fact that there are a lot of underutilized hosts on the Intemet, proposes a resource broker- based grid model by referring to the popular Peer-to- Peer idea, which can provide super computing capability to the ordinary users. Then, this paper presents a new scheduling algorithm based on task replication to solve the difficulty of monitoring a large - scale grid system. The algorithm doesn＇t require the forecasting information about the running environment. Only gives the relative length of the tasks, it can dynamically adapt to the varying grid environment,and it has the tolerant function.

关 键 词：网格 任务调度 任务复制 P2P 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]