An Effective Task Scheduling Method with Link Contention Constraints for Heterogeneous Computing System

• Main Authors: He Shuo-Zhan, 何碩展
• Other Authors: Cheng Chen
• Format: Others
• Language: en_US
• Published: 2003
• Online Access: http://ndltd.ncl.edu.tw/handle/83751815029828870092

碩士 === 國立交通大學 === 資訊工程系 === 91 === Sufficient and various computing resources make heterogeneous computing system suitable for parallel and distributed application. A task scheduling problem is to find the minimum schedule length by arranging tasks of application on computing resources. In order to make this problem more practical, we take the link contention constraints into our system model. We extend from the list-scheduling algorithm and propose an effective and efficient algorithm called Communication Look-ahead Scheduling (CLS) algorithm. In the first phase of our method, we propose a new priority function which integrates both information from the concept of critical path and the communication behavior of each task. In the second phase, we select the appropriate processor for a task by means of communication look-ahead. According to the performance evaluations, our method is superior to other methods both in effectiveness and efficiency. The detailed description of our algorithm and performance evaluation will be given in the literature.