摘要
设计一个面向信息服务的网格资源管理器的架构,该架构分为全局和局部管理器。介绍一个新的作业调度算法,该算法的特点是根据历史作业执行时间来预测当前作业的执行时间,在调度时考虑作业执行时间和截止时间2个要素。试验证明该算法比目前常用的Max-Min和Min-Min算法具有更好的性能。
The architecture of grid resource management system oriented to information services is put forward, which has been divided into global and local resource management system. And a new job scheduling algorithm is provided to meet the request of information and service grid. The algorithm can predict the RT（Running Time） of current job according to the same type jobs＇ historical records of the RTs and schedule those jobs depending on both of the RT and end time. The experiment shows that the algorithm is more efficient than popular algorithm, such as Min-Min and Max-Min.
出处
《计算机工程》
CAS
CSCD
北大核心
2008年第3期49-51,58,共4页
Computer Engineering
基金
国家自然科学基金资助项目(60673041)
江苏省高技术研究基金资助项目(BG2005020)
关键词
资源管理器
网格
作业调度
执行时间预测
resource management system
grid
job scheduling
running time prediction
