Open AccessTask Scheduling in Graphic Processing Units Heterogeneous With Density of The Graph
Author(s) -
Xuecheng Wang,
Jinquan Ma,
Yue Chun-sheng,
Da Xiang Yang
Publication year - 2019
Publication title -
iop conference series. materials science and engineering
Language(s) - English
Resource type - Journals
eISSN - 1757-899X
pISSN - 1757-8981
DOI - 10.1088/1757-899x/569/4/042059
Subject(s) - computer science , directed acyclic graph , parallel computing , scheduling (production processes) , fair share scheduling , dynamic priority scheduling , rate monotonic scheduling , distributed computing , round robin scheduling , algorithm , mathematical optimization , mathematics , computer network , quality of service
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.