Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/13516
Title: Memory-aware optimal scheduling with communication overhead minimization for streaming applications on chip multiprocessors
Authors: Wang, YI
Liu, DUO
Qin, Z
Shao, Z 
Keywords: Integer programming
Linear programming
Multiprocessing systems
Processor scheduling
Storage management
Issue Date: 2010
Publisher: IEEE
Source: 2010 IEEE 31st Real-Time Systems Symposium (RTSS), November 30 2010-December 3 2010, San Diego, CA, p. 350-359 How to cite?
Abstract: In this paper, we focus on solving the problem of removing inter-core communication overhead for streaming applications on chip multiprocessors. The objective is to totally remove inter-core communication overhead while minimizing the overall memory usage. By totally removing inter-core communication overhead, a shorter period can be applied and system throughput can be improved. Our basic idea is to 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. To solve the problem, we first perform analysis and obtain the bounds of the times needed to reschedule each task. Then we formulate the scheduling problem as an integer linear programming (ILP) model and obtain an optimal schedule. We perform simulations on a set of benchmarks from both real-life streaming applications and synthetic task graphs. The simulation results show that the proposed approach can achieve significant reduction in schedule length and improve the memory usage compared with the previous work.
URI: http://hdl.handle.net/10397/13516
ISBN: 978-0-7695-4298-0
ISSN: 1052-8725
DOI: 10.1109/RTSS.2010.16
Appears in Collections:Conference Paper

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

SCOPUSTM   
Citations

5
Last Week
0
Last month
Citations as of Apr 19, 2016

Page view(s)

26
Last Week
3
Last month
Checked on Aug 14, 2017

Google ScholarTM

Check

Altmetric



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