Constrained Global Scheduling of Streaming Applications on MPSoCs
2010 (English)In: 2010 15TH ASIA AND SOUTH PACIFIC DESIGN AUTOMATION CONFERENCE (ASP-DAC 2010), 2010, 223-228 p.Conference paper (Refereed)
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 NP-complete 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.
Place, publisher, year, edition, pages
2010. 223-228 p.
, Asia and South Pacific Design Automation Conference Proceedings
MINIMIZING BUFFER REQUIREMENTS, FLOW
Computer and Information Science
IdentifiersURN: urn:nbn:se:kth:diva-29231DOI: 10.1109/ASPDAC.2010.5419892ISI: 000281611400038ScopusID: 2-s2.0-77951211801ISBN: 978-1-4244-5765-6OAI: oai:DiVA.org:kth-29231DiVA: diva2:392892
15th Asia and South Pacific Design Automation Conference, Taipei, TAIWAN, JAN 18-21, 2010
QC 201101282011-01-282011-01-272011-01-28Bibliographically approved