计算机工程2011，Vol.37Issue(12)：16-18,3.DOI:10.3969/j.issn.1000-3428.2011.12.006
基于价值密度和截止期的网格作业调度算法
Algorithm of Grid Job Schedule Based on Value Density and Deadline
摘要
Abstract
This paper studies the job schedule problem in commercial grid computing. Four parameters of jobs, arrival time, computation, budget and deadline, are used to define a priority of jobs. A job schedule algorithm is proposed and simulated. Results of simulation show that this algorithm outperforms existing algorithms in metrics of Hit Value Ratio(HVR), Weighted Job Fulfillment Ratio(WJFR), and number of jobs finished before deadline. It achieves higher quality of service for consumers and higher income for providers than the contrastive algorithms.关键词
价值密度/截止期/优先级/作业调度/网格计算Key words
value density/ deadline/ priority/job schedule/ grid computing分类
信息技术与安全科学引用本文复制引用
李荣胜,赵文峰,徐惠民..基于价值密度和截止期的网格作业调度算法[J].计算机工程,2011,37(12):16-18,3.基金项目
国家"973"计划基金资助项目(2007CB307103) （2007CB307103）
贵州省重大科技专项计划基金资助项目(黔科合重大专项字[2007]6017) （黔科合重大专项字[2007]6017）
