Issue No. 02 - Feb. (2013 vol. 62)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2011.236
Yi Wang , Hong Kong Polytechnic Univeristy, Kowloon
Duo Liu , Hong Kong Polytechnic Univeristy, Kowloon
Zhiwei Qin , Hong Kong Polytechnic Univeristy, Kowloon
Zili Shao , Hong Kong Polytechnic Univeristy, Kowloon
This paper aims to totally remove intercore communication overhead with joint computation and communication task scheduling for streaming applications on Multiprocessor System-on-Chips (MPSoCs). Our basic idea is to let some computation and communication tasks be executed in earlier periods (the added periods are called the prologue) such that intercore data transfer can be finished before the execution of the tasks that need the data to start. In particular, we solve the following problem: how to do rescheduling in such a way that the schedule length can be minimized with the minimum prologue length (the number of periods in the prologue) while the intercore communication overhead can be totally removed? To solve this problem, we first perform schedulability analysis and obtain the upper bound of the times needed to reschedule each computation task. Then we formulate the problem as an Integer Linear Programming (ILP) formulation and obtain an optimal solution. We evaluate our technique with a set of benchmarks from both real-life streaming applications and synthetic task graphs. The experimental results show that our technique can achieve significant reductions in schedule length and energy consumption compared with the previous work.
Schedules, Computer architecture, Processor scheduling, Energy consumption, Upper bound, Computational modeling, Joints, MPSoC, Task scheduling, intercore communication, retiming, streaming applications
Z. Qin, D. Liu, Y. Wang and Z. Shao, "Optimally Removing Intercore Communication Overhead for Streaming Applications on MPSoCs," in IEEE Transactions on Computers, vol. 62, no. , pp. 336-350, 2013.