Please use this identifier to cite or link to this item:
Title: Memory-aware task scheduling with communication overhead minimization for streaming applications on bus-based multiprocessor system-on-chips
Authors: Wang, Y
Shao, ZL 
Chan, HCB 
Liu, D
Guan, Y
Keywords: Real-time
Task scheduling
Inter-core communication
Streaming applications
Issue Date: 2014
Publisher: Institute of Electrical and Electronics Engineers
Source: IEEE transactions on parallel and distributed systems, 2014, v. 25, no. 7, p. 1797-1807 How to cite?
Journal: IEEE transactions on parallel and distributed systems 
Abstract: Inter-core communication introduces overheads in task schedules on Multiprocessor System-on-Chips (MPSoCs). Inter-core communication overhead not only negatively impacts the timing performance but also significantly degrades the memory usage for streaming applications running on MPSoC architectures. By minimizing inter-core communication overhead, a shorter period can be applied and system performance (e.g., throughput, memory usage) can be improved. In this paper, we focus on solving the problem of minimizing inter-core communication overhead for streaming applications on bus-based MPSoCs. The objective is to minimize inter-core communication overhead while minimizing the overall memory usage. To solve the problem, we first let tasks with intra-period data dependencies transform to inter-period data dependencies so as to overlap the execution of computation and inter-core communication tasks. By doing this, inter-core communication overhead can be effectively removed. To minimize the overall memory usage, we then perform schedulability analysis and obtain the bounds of the times needed to reschedule each task. Based on the schedulability analysis, we formulate the scheduling problem as an integer linear programming (ILP) model and obtain an optimal schedule. In addition, we propose a heuristic approach to efficiently obtain a near-optimal solution. We conduct experiments on a set of benchmarks from both real-life streaming applications and synthetic task graphs. The experimental results show that the proposed approach can significantly reduce the schedule length and improve the memory usage compared with the previous work.
ISSN: 1045-9219
EISSN: 1558-2183
DOI: 10.1109/TPDS.2013.172
Appears in Collections:Journal/Magazine Article

View full-text via PolyU eLinks SFX Query
Show full item record


Last Week
Last month
Citations as of Aug 11, 2018


Last Week
Last month
Citations as of Aug 17, 2018

Page view(s)

Last Week
Last month
Citations as of Aug 20, 2018

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.