一种负载均衡的网格在线调度算法  

A Load Balanced Online Scheduling Algorithm in Grids

作　　者：孙立斌[1,2] 陈闳中[1,2] 邓蓉[1,2] 

机构地区：[1]同济大学计算机科学与技术系,上海201804 [2]同济大学嵌入式系统与服务计算教育部重点实验室,上海200092

出　　处：《计算机工程》2014年第2期44-47,共4页Computer Engineering

基　　金：国家科技支撑计划基金资助项目(2012BAH15F03)

摘　　要：任务调度是网格领域的一个核心问题。针对网格资源及任务高度异构环境下的负载失衡问题,设计一种负载均衡的在线任务调度算法BOS。BOS算法在进行任务调度时,综合考虑任务到达频率、任务计算量、任务的完成时刻以及任务开始执行时刻等因素。任务周转时间由执行时间和等待时间2个部分组成。对于长任务,执行时间占更大比重。而对于短任务,等待时间的影响更大。算法根据长任务和短任务的各自特点,引入适应度的概念来指导调度。实验结果表明,与MCT算法相比,BOS算法的调度跨度、任务周转时间、响应比更小,资源利用率更高,负载也更加均衡。Task scheduling is a core issue in grid computing. In view of the load imbalance problem caused by the high heterogeneity of grid resources and tasks, a Balanced Online Scheduling（BOS） algorithm is proposed. The algorithm comprehensively considers task arrival frequencies, task size, task completion time and task execution moment. A task＇s turnaround time consists of two parts, such as waiting time and executing time. For a long task, executing time accounts for a greater proportion, while for a short task, waiting time is more critical. Thus, different policies are used for short and long tasks. Experimental results show that compared with MCT algorithm, BOS shortens makespan, average task turnaround time, and average stretch. Resource utilization and load balance factor are improved.

关 键 词：网格计算 GridSim仿真器 任务调度 负载均衡 资源利用率 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]