摘要
网格调度的目标提高网格资源的利用率、改善网格应用的性能,它是网格中需着力解决的问题之一.目前,围绕着网格中的任务调度算法,国内外已做了大量的研究工作,先后提出了各种调度算法.但是,这些调度算法不能很好地适应网格环境下的自治性、动态性、分布性等特征.针对目前网格调度机制存在的问题,提出了一种动态的网格调度技术——基于Cache的反馈调度方法(cache based feedback scheduling,简称CBFS).该调度方法依据Cache中所存放的最近访问过的资源信息,如最近一次请求提交时间、任务完成时间等信息进行反馈调度,将任务提交给负载较小或性能较优的资源来完成.实验结果表明,CBFS方法不但可以有效减少不必要的延迟,而且在任务响应时间的平滑性、任务的吞吐率及任务在调度器等待调度的时间方面比随机调度等传统算法要好.
Grid scheduling which aims at improving resource utilization and grid application performance is a key concern in grid. Currently, much research can be found about grid scheduling and some algorithms on it were proposed. However, since grid resources are autonomic, distributed and their status change over time, those scheduling algorithms did not fit for the cases well. In this paper, a cache based feedback grid scheduling （CBFS） approach is presented to capture the dynamics and impact of simultaneously co-allocated tasks in a grid. In this approach, grid scheduler utilizes recent resource performance data, such as recent task submitting time and execution time of task which are kept in cache and a feedback approach to engineer load balancing across multiple grid resources. After comparing this dynamic grid scheduling approach with previous research, it is found that CBFS is more generous than other scheduling approaches. Experimental results demonstrate that this approach diminishes latency and contributes to the overall grid load balancing, which significantly improves resource utilization and response time of tasks.
出处
《软件学报》
EI
CSCD
北大核心
2006年第11期2314-2323,共10页
Journal of Software
基金
国家自然科学基金No.90412010
国家高技术研究发展计划(863)No.2004AA104280
国家教育部中国教育科研网格计划
中国下一代互联网示范工程项目No.CNGI-04-15-7A
武汉市科技攻关项目No.20061002032~~
