TY - GEN
T1 - Scheduling of synchronous data flow models on scratchpad memory based embedded processors
AU - Che, Weijia
AU - Chatha, Karam S.
PY - 2010
Y1 - 2010
N2 - Many embedded processors incorporate scratchpad memories (SPM) due to their lower power consumption characteristics. SPMs are utilized to host both code and data, often on the same physical unit. Synchronous dataflow (SDF) is a popular format for specifying many embedded system applications particularly in multimedia and network processing domains. Execution of SDF specifications on SPM based processors involves division of memory between actor code and buffers, and scheduling of actor executions and code overlays such that latency is minimized subject to the memory constraints. In our problem instance a traditional minimum buffer SDF schedule could require a larger code overlay overhead and therefore may not be optimal. The paper presents a three stage integer linear programming (ILP) formulation to solve the problem. Further, the paper also introduces modifications to the three stage ILP for incorporating code prefetching optimization to further reduce the code overlay overhead. The effectiveness of the proposed approaches is evaluated by comparisons with minimum buffer SDF schedules for several benchmark applications.
AB - Many embedded processors incorporate scratchpad memories (SPM) due to their lower power consumption characteristics. SPMs are utilized to host both code and data, often on the same physical unit. Synchronous dataflow (SDF) is a popular format for specifying many embedded system applications particularly in multimedia and network processing domains. Execution of SDF specifications on SPM based processors involves division of memory between actor code and buffers, and scheduling of actor executions and code overlays such that latency is minimized subject to the memory constraints. In our problem instance a traditional minimum buffer SDF schedule could require a larger code overlay overhead and therefore may not be optimal. The paper presents a three stage integer linear programming (ILP) formulation to solve the problem. Further, the paper also introduces modifications to the three stage ILP for incorporating code prefetching optimization to further reduce the code overlay overhead. The effectiveness of the proposed approaches is evaluated by comparisons with minimum buffer SDF schedules for several benchmark applications.
UR - http://www.scopus.com/inward/record.url?scp=78650916761&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=78650916761&partnerID=8YFLogxK
U2 - 10.1109/ICCAD.2010.5654150
DO - 10.1109/ICCAD.2010.5654150
M3 - Conference contribution
AN - SCOPUS:78650916761
SN - 9781424481927
T3 - IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD
SP - 205
EP - 212
BT - 2010 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2010
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2010 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2010
Y2 - 7 November 2010 through 11 November 2010
ER -