| 基于价值密度和截止期的网格作业调度算法 |
| |
| 引用本文： | 李荣胜,赵文峰,徐惠民.基于价值密度和截止期的网格作业调度算法[J].计算机工程,2011,37(12):16-18. |
| |
| 作者姓名： | 李荣胜 赵文峰 徐惠民 |
| |
| 作者单位： | 1. 北京邮电大学,信息与通信工程学院,北京100876
2. 北京邮电大学,网络与交换技术国家重点实验室,北京100876 |
| |
| 基金项目： | 国家"973"计划基金资助项目，贵州省重大科技专项计划基金资助项目 |
| |
| 摘 要： | 对商业网格中的作业调度问题进行研究，采用作业的到达时间、计算量、预算和截止期4个参数定义作业的优先级。在此基础上提出基于价值密度和相对截止期的网格作业调度算法，并对其进行仿真。仿真结果表明，该算法在实现价值率、按时完成作业数和加权作业按时完成率3个性能指标上优于现有算法，兼顾了消费者和服务者的利益。
|
| 关 键 词： | 价值密度 截止期 优先级 作业调度 网格计算 |
| 收稿时间： | 2010-11-04 |
Algorithm of Grid Job Schedule Based on Value Density and Deadline |
| |
| LI Rong-sheng,ZHAO Wen-feng,XU Hui-min.Algorithm of Grid Job Schedule Based on Value Density and Deadline[J].Computer Engineering,2011,37(12):16-18. |
| |
| Authors: | LI Rong-sheng ZHAO Wen-feng XU Hui-min |
| |
| Affiliation: | a (a.School of Information and Communication Engineering;b.State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications,Beijing 100876,China) |
| |
| 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. |
| |
| Keywords: | value density deadline priority job schedule grid computing |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程》浏览原始摘要信息 |
|
点击此处可从《计算机工程》下载全文 |
