一种对资源不稳定性敏感的EASY-backfill算法  

Research on modified EASY-backfill algorithm for grid with unstable resource

作　　者：王征宇[1] 肖南峰[1] 

机构地区：[1]华南理工大学计算机科学与工程学院,广州510006

出　　处：《南京信息工程大学学报（自然科学版）》2012年第2期163-169,共7页Journal of Nanjing University of Information Science & Technology（Natural Science Edition）

基　　金：国家自然科学基金(61171141);广东省自然科学基金重点项目(8251064101000005)

摘　　要：网格将分布式的计算节点连接起来,形成一个集中的计算和资源环境.网格环境中的任务调度对于网格的运算效率和整体性能有很大的影响.EASY-backfill算法作为经典的动态网格任务调度算法,有着算法简单、运算量小、调度性能优秀等诸多优点,但其算法条件对于计算资源的假设是理想绝对稳定的,同时认为任务的性能预测是精确可靠的,这显然不符合实际情况.首先建立不稳定计算资源的模型,在该模型下改进EASY-backfill算法,使其能够在感知计算资源的不稳定性的条件下,保持算法原有的效果;然后,把经典EASY-backfill算法与改进算法作了比较;最后,就不稳定计算资源模型的相关参数对算法造成的影响进行了讨论.Grid connects distributed resource into a mass environment for computing.The scheduling algorithm has much influence over the efficiency and performance of grid.EASY-backfill is a classical scheduling algorithm with simple program,little computation workload and relatively high performance.But the algorithm is based on assumptions that all resources in the grid are absolutely stable,and the performance forecast of jobs is accurate and reliable.Yet these conditions are ideal and unpractical.In this paper,we use some unstable parameters to build a different model of unstable grid resources,and modify the EASY-backfill algorithm according to the model.We make effort to keep the performance and effectiveness of the algorithm on condition that the modified algorithm sensitive to the unstable and unpredictable grid resource.We also make comparison between the classical and modified algorithm and do some discussion on the influence of different unstable parameters.

关 键 词：网格计算 任务调度 EASY-backfill算法 

分 类 号：TP391.41[自动化与计算机技术—计算机应用技术]