一种基于异构系统的实时调度算法研究  

Real-time scheduling algorithm based on heterogeneous systems

作　　者：郑小长[1] 杨红和[2] 

机构地区：[1]闽南师范大学信息与网络中心,福建漳州363000 [2]闽南师范大学教务处,福建漳州363000

出　　处：《邵阳学院学报（自然科学版）》2016年第2期36-40,共5页Journal of Shaoyang University：Natural Science Edition

基　　金：闽南师范大学教学改革项目(JG201542)

摘　　要：高效调度是异构系统中实现高性能计算的关键.调度问题已经被证明是NP完全问题,由于其关键性,调度问题已经被国内外研究机构广泛研究,并提出了多种算法.尽管在一些文献中提出了异构多处理器的调度算法,但是这些算法的调度成本较高,并且在较低的调度成本下无法提供高质量的调度.本文提出一种最小评分优先算法(HMSF),该算法是一种适用于异构系统的高性能、快速调度算法,通过和传统的HEFT算法和DLS算法进行试验对比发现,HMSF算法可以使调度长度更短.Efficient scheduling is the key to high performance computing in heterogeneous system .The scheduling problem has been proved to be NP-complete problem .Because of its significance ,it has been studied extensively in research institutes at home and abroad ,and a variety of algorithms have been put forward .Despite the fact that some scheduling algorithms of heterogeneous multi-core processor are proposed in some literatures , the scheduling cost of these algorithms is high and high-quality scheduling is not to be achieved at low cost of scheduling.In this paper,a minimum score priority algorithm （HMSF） is proposed.The algorithm is applicable in heterogeneous system with the advantage of high performance and speed .The HMSF can shorten the scheduling length ,which is found in comparison tests between traditional heft algorithm and DLS algorithms .

关 键 词：异构系统 实时调度 DAG调度 任务图 调度长度 

分 类 号：TP302[自动化与计算机技术—计算机系统结构]