Communication-aware task scheduling algorithm for heterogeneous computing Online publication date: Tue, 12-Sep-2017
by Tehui Huang; Tao Li; Qiankun Dong; Kezhao Zhao; Wenjing Ma; Yulu Yang
International Journal of High Performance Computing and Networking (IJHPCN), Vol. 10, No. 4/5, 2017
Abstract: In this paper, we propose a new task scheduling algorithm for heterogeneous computing platforms, called communication-aware earliest finish time (CEFT). It combines the features of list-scheduling and task-duplication, where task priority is assigned according to communication ratio (CR), a notion defined to represent communication cost. We also present a duplication mechanism, which cooperates with CR to reduce the communication overhead. The time complexity of the algorithm is O(v2 • p), for v tasks and p processors. The experiment results show that CEFT algorithm improves performance by 11% compared with the state-of-the-art list-based algorithm PEFT, and 15.6% compared with duplication-based algorithm HDCPD, in terms of scheduling length ratio. CEFT is the best algorithm compared with PEFT, HDCPD and HEFT regarding to efficiency and average surplus time as well.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of High Performance Computing and Networking (IJHPCN):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook