Table of Contents Author Guidelines Submit a Manuscript
Scientific Programming
Volume 2016, Article ID 3676149, 11 pages
Research Article

HSIP: A Novel Task Scheduling Algorithm for Heterogeneous Computing

1School of Software Technology, Dalian University of Technology, Dalian 116620, China
2Liaoning Police College, Dalian 116036, China
3School of Computer Science and Technology, Dalian University of Technology, Dalian 116024, China

Received 22 September 2015; Revised 9 January 2016; Accepted 16 February 2016

Academic Editor: Bronis R. de Supinski

Copyright © 2016 Guan Wang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


High-performance heterogeneous computing systems are achieved by the use of efficient application scheduling algorithms. However, most of the current algorithms have low efficiency in scheduling. Aiming at solving this problem, we propose a novel task scheduling algorithm for heterogeneous computing named HSIP (heterogeneous scheduling algorithm with improved task priority) whose functionality relies on three pillars: () an improved task priority strategy based on standard deviation with improved magnitude as computation weight and communication cost weight to make scheduling priority more reasonable; () an entry task duplication selection policy to make the makespan shorter; and () an improved idle time slots (ITS) insertion-based optimizing policy to make the task scheduling more efficient. We evaluate our proposed algorithm on randomly generated DAGs, using some real application DAGs by comparison with some classical scheduling algorithms. According to the experimental results, our proposed algorithm appears to perform better than other algorithms in terms of schedule length ratio, efficiency, and frequency of best results.