Constrained global scheduling of streaming applications on MPSoCs

Abstract-- We present a global scheduling framework for synchronous data flow (SDF) streaming applications on MPSoCs, based on optimized computation and contention-free routing. The global scheduling of processors computing and communication transactions are formulated as constraint based problem, to avoid the scheduling overhead in TDMA-like heuristic schemes. A public domain constraint solver is exploited to solve the NPcomplete scheduling efficiently, together with problem specific constraint modeling techniques. Experimental results show that the proposed framework can achieve a high predictable application throughput with minimized buffer cost. For instance, for applications in communication domain, higher throughput (up to 87%) has been observed with less buffer cost, compared to scenarios considering the heuristic scheduling overhead.

• Type: Journal
• Year: 2010
• Where: ASPDAC
• Authors: Jun Zhu, Ingo Sander, Axel Jantsch
• Keywords: ASPDAC 2010, Buffer Cost, Global Scheduling, Global Scheduling Framework, Hardware