作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2008, Vol. 34 ›› Issue (18): 53-55. doi: 10.3969/j.issn.1000-3428.2008.18.019

• 软件技术与数据库 • 上一篇    下一篇

集群中基于资源可用度的作业调度

康 健,李 巍,李云春   

  1. (北京航空航天大学网络技术北京重点实验室,北京 100083)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2008-09-20 发布日期:2008-09-20

Job Scheduling Based on Resource Availability in Clusters

KANG Jian, LI Wei, LI Yun-chun   

  1. (Beijing Key Laboratory of Network Technology, Beijing University of Aeronautics and Astronautics, Beijing 100083)
  • Received:1900-01-01 Revised:1900-01-01 Online:2008-09-20 Published:2008-09-20

摘要: 提出一种基于资源可用度的集群作业调度算法,综合考虑资源的历史记录和当前的资源信息。基于资源可用度评价方法,改进原有的Min-Min算法。采用GridSim对算法进行模拟实验,并与Min-Min算法进行了对比。模拟实验结果显示,基于可用度的作业调度算法提高了集群的效率和作业的完成效率,缩短了作业的平均完成时间。

关键词: 作业调度, 可用度, Min-Min算法, GridSim方法

Abstract: This paper proposes a job scheduling algorithm based on the resources availability. It takes account of the historical record of resources and the current resources information. Based on the resource availability, it improves the original Min-Min algorithm. GridSim is used to simulate the experiment based on the algorithm, and is compared with experiment based on Min-Min algorithm. Simulation results show that job-scheduling algorithm based on the availability improves the cluster’s efficiency, shortens the average job complete time.

Key words: job scheduling, availability, Min-Min algorithm, GridSim method

中图分类号: