基于多核处理器的关联任务并行感知调度算法  

Parallel Perceptual Scheduling Algorithm for Related Tasks Based on Multi-Core Processors

作　　者：梁秋玲 张向利[2] 张红梅[2] 闫坤 LIANG Qiuling;ZHANG Xiangli;ZHANG Hongmei;YAN Kun(School of Information and Communication,Guilin University of Electronic Technology,Guilin,Guangxi 541004,China;Key Laboratory of Cognitive Radio and Information Processing,Ministry of Education,School of Information and Communication,Guilin University of Electronic Technology,Guilin,Guangxi 541004,China)

机构地区：[1]桂林电子科技大学信息与通信学院,广西桂林541004 [2]桂林电子科技大学信息与通信学院认知无线电与信息处理省部共建教育部重点实验室,广西桂林541004

出　　处：《计算机工程》2021年第7期212-217,共6页Computer Engineering

基　　金：广西云计算与大数据协同创新中心开放项目“大数据分布式存储与处理系统设计与实现”(YD1904);广西研究生教育创新计划(2017YJCX22)。

摘　　要：关联任务在多核处理器上并行调度所产生的通信时延,会对任务调度长度和处理器利用率造成负面影响,为了改善多核系统对关联任务的处理性能,针对关联任务在多核处理器上的调度特点,提出一种并行感知调度算法。计算各任务与终点间的最长路径值,按照该值的降序来分配任务调度次序,在分配处理器内核时兼顾关联度和任务最早可执行时间,设置最佳匹配评价函数。实验结果表明,与busHEFT和DTSV算法相比,该算法具有更短的任务调度时延、更少的通信量以及更高的处理器利用率。The communication delay caused by the parallel scheduling of related tasks on multi-core processors has a negative impact on the task scheduling length and processor utilization.In order to improve the performance of multicore systems in processing related tasks,this paper proposes a parallel perceptual scheduling algorithm based on the scheduling characteristics of related tasks on multi-core processors.The algorithm calculates the value of the longest path from each task to the end point,and assigns the tasks in descending order of the calculated value.The relation and the earliest execution time are both considered when assigning processor cores,and the best matching evaluation function is created.Experimental results show that this algorithm has fewer task scheduling delay,less communication traffic and higher processor utilization compared with busHEFT,DTSV and other algorithms.

关 键 词：多核系统 总线 关联任务 通信时延 任务调度 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]