Buffer Minimization of Real-Time Streaming Applications Scheduling on Hybrid CPU/FPGA Architectures
2009 (English)In: DATE: 2009 DESIGN, AUTOMATION & TEST IN EUROPE CONFERENCE & EXHIBITION, 2009, 1506-1511 p.Conference paper (Refereed)
We address the problem of real-time streaming applications scheduling on hybrid CPU/FPGA architectures. The main contribution is a two-step approach to minimize the buffer requirement for streaming applications with throughput guarantees. A novel declarative way of constraint based scheduling for real-time hybrid SW/HW systems is proposed, while the application throughput is guaranteed by periodic phases in execution. We use a voice-band modem application to exemplify the scheduling capabilities of our method. The experimental results show the advantages of our techniques in both less buffer requirement and higher throughput guarantees compared to the traditional PAPS method.
Place, publisher, year, edition, pages
2009. 1506-1511 p.
, Design, Automation and Test in Europe Conference and Expo, ISSN 1530-1591
SYNCHRONOUS DATA-FLOW, REQUIREMENTS, NETWORKS
Computer and Information Science
IdentifiersURN: urn:nbn:se:kth:diva-30354ISI: 000273246700267ScopusID: 2-s2.0-70350077786ISBN: 978-1-4244-3781-8OAI: oai:DiVA.org:kth-30354DiVA: diva2:401558
Design, Automation and Test in Europe Conference and Exhibition, Nice, FRANCE, APR 20-24, 2009
QC 201103032011-03-032011-02-242011-03-03Bibliographically approved