Task-FIFO co-scheduling of streaming applications on MPSoCs with predictable memory hierarchy
article
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-toprocessor mapping is obtained with the potential FIFO allocation being taken into account; then, the FIFOto-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.
TNO Identifier
756673
DOI
https://dx.doi.org/10.1145/3038484
ISSN
15399087
Source
ACM Transactions on Embedded Computing Systems, 16(2)
Publisher
Association for Computing Machinery
Article nr.
49
Files
To receive the publication files, please send an e-mail request to TNO Repository.