华东师范大学学报(自然科学版) ›› 2009, Vol. 2009 ›› Issue (1): 111-116.

• 计算机科学 • 上一篇    下一篇

一种多QoS约束的网格资源调度算法

陈玉兰;郑骏;胡文心
   

  1. 华东师范大学 计算中心，上海 200062
  • 收稿日期:2007-12-15 修回日期:2008-05-23 出版日期:2009-01-25 发布日期:2009-01-25
  • 通讯作者: 陈玉兰

Algorithm for resource scheduling based on multiQoS constraints(Chinese)

CHEN Yu-lan;ZHENG Jun;HU Wen-xin
   

  1. computer Center Institute, East China Normal University, Shanghai 200062,China
  • Received:2007-12-15 Revised:2008-05-23 Online:2009-01-25 Published:2009-01-25
  • Contact: CHEN Yu-lan

PDF

1498

摘要： 针对网格计算中资源调度问题，提出一种多QoS（Quality of Service）约束的贪婪推广算法.调度时以调度驱动函数为贪婪准则.调度驱动函数与网格用户提供的“deadline”,“budget”,“timeweight”和“costweight”等参数有关.每次根据调度驱动函数选择最经济的资源进行调度.通过在Gridsim环境下的分析与比较，该算法能够在满足用户QoS的同时，能够以最小的调度驱动函数值完成任务，最大化地实现用户的满意度.

关键词: 经济模型, 贪婪算法, Gridsim, 调度, 网格计算, 经济模型, 贪婪算法, Gridsim, 调度, 网格计算

Abstract: A new algorithm for resource scheduling in grid environment based on multiQoS constraints and greedy method was proposed. It takes a driver function which is determined by parameters“deadline”, “budget”, “time weight” and “cost weight” which the user provided as the greedy criterion. The performance of this new scheduling algorithm, choosing a most economic resource for scheduling each time and achieving the maximum of customer′s satisfaction, is demonstrated by its implementation on Gridsim.

Key words: Greedy algorithm, Gridsim, schedule, computational grid, economic model, Greedy algorithm, Gridsim, schedule, computational grid

中图分类号: