Task-FIFO co-scheduling of streaming applications on MPSoCs with predictable memory hierarchy

Q. Tang, A.A. Basten, M.C.W. Geilen, S. Stuijk, Ji-Bo Wei

Research output: Contribution to journalArticleAcademicpeer-review

3 Citations (Scopus)
1 Downloads (Pure)


This article studies the scheduling of real-time streaming applications on multiprocessor systems-on-chips with predictable memory hierarchy. An iteration-based task-FIFO co-scheduling framework is proposed for this problem. We obtain FIFO size distributions using Pareto space searching, based on which the task-to-processor mapping is obtained with the potential FIFO allocation being taken into account; then, the FIFO-to-memory allocation is optimized to minimize the total memory access cost; finally, a self-timed throughput analysis method that considers memory and direct memory access controller contention is utilized to analyze the throughput. Our methods are validated by a set of synthesized and practical applications on different platforms.
Original languageEnglish
Article number49
Pages (from-to)49:1-49:25
Number of pages25
JournalACM Transactions on Embedded Computing Systems
Issue number2
Publication statusPublished - Apr 2017


  • FIFO
  • SDFG
  • Scheduling
  • Scratch pad memory
  • Self-timed


Dive into the research topics of 'Task-FIFO co-scheduling of streaming applications on MPSoCs with predictable memory hierarchy'. Together they form a unique fingerprint.

Cite this