Task Scheduling in Graphic Processing Units Heterogeneous With Density of The Graph

2019 2nd International Conference on Advanced Materials, Intelligent Manufacturing and Automation

Wang, Xuecheng^1 ; Ma, Jinquan^1 ; Yue, Chunsheng^1 ; Yang, Di^1

Departments of Information Systems Engineering, PLA Strategic Support Force Information Engineering University, Zheng Zhou

450002, China^1

关键词: Efficient scheduling;    Graphic processing unit(GPU);    Graphic processing units;    List scheduling algorithms;    Nodes densities;    Performance tasks;    Processor selection;    Task-scheduling;   

Others  :  https://iopscience.iop.org/article/10.1088/1757-899X/569/4/042059/pdf
DOI  :  10.1088/1757-899X/569/4/042059

来源: IOP

【 摘 要 】

An efficient scheduling algorithm is significant to achieve high performance in heterogeneous consisted by the central processing units (CPU) and the graphic processing unit (GPU). However, most of the scheduling algorithms are not suitable to meet the present demands of the heterogeneous. According to the characteristics of the direction acyclic graph, the direction acyclic graph nodes density list scheduling algorithm (DAG-NDLS) was proposed. The algorithm had two important phase, the first phase was task prioritizing, selected the ready task with highest priority, defined by the summation of the node density and the transmission between the node and child nodes, and the second phase was processor selection, selected the processors for the tasks with the earliest finish time minimum. In the end, compared the performances of the proposed algorithm with the heterogeneous earlier finish time algorithm and the high performance task scheduling algorithm, the results of the proposed algorithm were the best in case of the efficiency and utilization.