首页 | 本学科首页   官方微博 | 高级检索  
     

基于优先级和优化完成时间的网格调度算法
引用本文:何岩,李肯立,石岿然,刘晓玲,王颖.基于优先级和优化完成时间的网格调度算法[J].计算机应用,2006,26(1):61-0064.
作者姓名:何岩  李肯立  石岿然  刘晓玲  王颖
作者单位:1. 湖南大学计算机与通信学院,湖南,长沙,410082
2. 南京工业大学理学院,江苏,南京,210009
基金项目:中国科学院资助项目;教育部科学技术研究项目;国家自然科学基金
摘    要:网格由大量的异构资源组成,具有复杂性、动态性和自治性特点。高效的网格调度算法可以充分利用网格系统资源,提高网格处理应用程序的能力。Min min算法是一个简单、快速、有效的调度算法,但由于总是先分配小任务而不能确保负载平衡。文中首先对网格系统中任务的数据传输和执行进行分析,计算并优化Min min算法的任务完成时间,再根据任务需求赋予任务优先级,通过优先级安排任务调度,提高算法负载平衡能力,最后在上述分析基础上提出POTE Min min(Priority and Overlap Transmission and Execution Min min)调度算法。

关 键 词:网格  Min-min算法  完成时间  优先级
文章编号:1001-9081(2006)00-0061-04
收稿时间:2005-07-14
修稿时间:2005-07-142005-09-07

Scheduling algorithm based on the priority and improved completion-time in grid
HE Yan,LI Ken-li,SHI Kui-ran,LIU Xiao-ling,WANG Ying.Scheduling algorithm based on the priority and improved completion-time in grid[J].journal of Computer Applications,2006,26(1):61-0064.
Authors:HE Yan  LI Ken-li  SHI Kui-ran  LIU Xiao-ling  WANG Ying
Affiliation:1. School of Computer and Communications, Hunan University, Changsha Hunan 410082, China; 2. School of Sciences, Nanjing University of Technology, Nanjing Jiangsu 210009, China
Abstract:Grid system consists of a wide variety of geographically distributed resources and these resources are heterogeneous,geographically distributed and dynamically available.High efficient scheduling algorithm would be able to increase throughput,maximize system utilization,and fulfill economical system and user constraints.Min-min algorithm is a simple and fast algorithm,and able to deliver good performance,but with the drawback of limitation of load balance.In this paper the transmission and execution of jobs were analyzed first.Then the completion time of the Min-min algorithm was computed and improved based on the schedule model.Furthermore,in order to improve the load balance of the Min-min algorithm,priority was assigned to the jobs according to different schedule limitations,and jobs were scheduled based on these priorities.Finally the POTE Min-min(Priority and Overlap Transmission and Execution Min-min) algorithm was proposed based on the analysis.
Keywords:Grid  Min-min algorithm  completion time  priority
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机应用》浏览原始摘要信息
点击此处可从《计算机应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号