A method of achieving time information of communication and computation tasks from list scheduling algorithm

作者：Wu Huixin^*; Wang Bingzheng; Wang Yingfeng

来源：Journal of Computational Information Systems, 2013, 9(10): 3865-3872.

DOI：10.12733/jcis5828

• Communication delays
• Communication task
• Dependency relation
• List scheduling algorithms
• List-scheduling
• Multi-core systems
• Parallel processing
• Precedence constraints

In many researches on energy efficient and performance improved scheduling algorithm design for applications including computation tasks with precedence constraints, list scheduling algorithm is widely taken as comparison object due to its popularity. In order to avoid a lot of programming work, we can use existing tool to get the scheduling results from list scheduling. In TORSCHE, the corresponding function is given to get scheduling results generated from list scheduling algorithm. However, we can get the scheduling results of computation tasks without considering communication tasks according to TORSCHE. Therefore, we propose a method of achieving start time and finish time of communication tasks and computation tasks using list scheduling algorithm based on TORSCHE. This method utilizes dependency relation between computation tasks and execution time of communication tasks considering two cases: with and without competition among communication tasks. We experiment our method with random task graphs on multi-core systems with two and three processor cores, respectively. Simulation results show that our method are very effective in getting start time and finish time of computation tasks and communication tasks. This method avoids the programming work of computation task mapped to processor cores.

• 出版日期2013
• 单位郑州大学; 河南大学