| 异构环境下独立任务调度算法的研究 |
| |
| 引用本文： | 周洋,蒋昌俊,方钰.异构环境下独立任务调度算法的研究[J].计算机科学,2008,35(8):90-92. |
| |
| 作者姓名： | 周洋 蒋昌俊 方钰 |
| |
| 作者单位： | 同济大学计算机科学与工程系,上海,201804;国家高性能计算机工程技术研究中心同济分中心,上海,201804;同济大学嵌入式系统与服务计算教育部重点实验室,上海,201804 |
| |
| 基金项目： | 国家发改委资助项目，上海市科委资助项目，上海市科委资助项目 |
| |
| 摘 要： | 本文基于Min-min算法和Sufferage算法提出了基于任务调度损失的最小最早完成时间算法(Sufferage Min-min,SMM).该算法将任务调度损失引入Min-min算法,选取最早完成时间较小的k个任务,再优先对其中任务调度损失最大的一个进行调度.SMM算法克服了Min-min算法单纯追求局部最优而缺少全局意识的缺点.测试表明,SMM算法可以做到调度跨度低与平均等待时间小的统一,在综合性能上较Min-min算法有所提高.
|
| 关 键 词： | 调度算法 Min-min算法 Sufferage算法 调度跨度 平均等待时间 |
Research of Scheduling of Independent Tasks onto Heterogeneous Computing Systems |
| |
| ZHOU Yang,JIANG Chang-jun,FANG Yu.Research of Scheduling of Independent Tasks onto Heterogeneous Computing Systems[J].Computer Science,2008,35(8):90-92. |
| |
| Authors: | ZHOU Yang JIANG Chang-jun FANG Yu |
| |
| Affiliation: | ZHOU Yang1,2,3 JIANG Chang-jun1,3 FANG Yu1,3(Department of Computer Science , Engineering,Tongji University,Shanghai 201804,China)1(Tongji Branch,National Engineering & Technology Center of High Performance Computer,China)2(The Key Laboratory of Embedded System , Service Computing,Ministry of Education,China)3 |
| |
| Abstract: | This paper presents a new heuristic called Sufferage Min-min(SMM),which is based on both Min-min heuristic and Sufferage heuristic.Combining task sufferage with Min-min heuristic,SMM chooses k tasks which have smaller earliest finish times,and assigns the task,which will be suffered most if it isn't assigned,to the corresponding processor.SMM is more suitable for heterogeneous processors platforms by surmounting the limitation of Min-min heuristic.The statistic from the experiments proves that SMM can reach... |
| |
| Keywords: | Scheduling Min-min heuristic Sufferage heuristic Makespan Average waiting time |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机科学》浏览原始摘要信息 |
|
点击此处可从《计算机科学》下载全文 |
|
