Scheduling Algorithm Based on Priority Queue Dividing in Heterogeneous Computing Environment
WANG Lan1，ZHANG Long-xin1，MAN Jun-feng1，ZHOU Li-qian1，LI Ken-li2
1（School of Computer Science，Hunan University of Technology，Zhuzhou 412007，China）2（College of Computer Science and Electronic Engineering，Hunan University，Changsha 410082，China）
Abstract：With rapid development of artificial intelligence，researchers pay more and more attentions to high performance computing which can improve performance of artificial intelligence.The task scheduling problem in heterogeneous computing environment has always been a key issue in high performance computing.In this paper，we propose a scheduling algorithm based on priority queue dividing（PQDSA）.The algorithm determines the number of queues according to the number of entry nodes of the DAG（Directed acyclic graph），divides the priority task queue by the communication overhead and computational overhead of the task，and then assigns the critical node tasks to the appropriate queue to generate a better task scheduling queues.It thereby can improve the parallelism of parallel tasks and reduce the task set completion time.While satisfying the priority constraints，tasks are further scheduled based on the insertion strategy to appropriate processors，so that task scheduling can be executed more efficiently.The PQDSA algorithm can reduce the completion time of task set and improve the scheduling efficiency of processors.By comparing the performance with two classical algorithms，our experimental results show that our presented novel algorithm（PQDSA）obtains greater task completion time and scheduling efficiency than two classical algorithms.
2020, Vol. 41 
