Skip to search boxSkip to navigationSkip to main content

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

Output:
Chapter in Book/Report/Conference proceeding
Conference contribution
Academic
Peer-review

Information

Output type

Output:
Chapter in Book/Report/Conference proceeding
Conference contribution
Academic
Peer-review

Original language

English

Pages from-to (Number of pages)

Pages 90-99

Publication milestones

  • Published - 2015

Publication status

Published - 2015

Place of publication

Los Alamitos

Publisher

IEEE Computer Society, United States
978-1-4673-7882-6

Host publication title

Application of Concurrency to System Design, 15th International Conference, ACSD 2015, Brussels, Belgium, 21-26 June 2015

Related Event

Title

15th International Conference on Application of Concurrency to System Design (ACSD 2015)

Description

Conference co-located with the 36th International Conference on Application and Theory of Petri Nets and Concurrency (Petri Nets 2015)

Event type

Conference

Degree of recognition

International event

Date

21/06/2015 - 26/06/2015

Location

BrusselsBelgium

Abstract

Multi-processor systems-on-chips are widely adopted in implementing modern streaming applications to satisfy the ever increasing computing requirements. Predictable memory hierarchies, which make memory access predictable, can better satisfy the strict timing requirements of streaming applications. However, different levels of the memory hierarchy vary in latency and capacity. Hence, the system performance not only depends on the task schedule but also closely relates with the FIFO size distribution and FIFO allocation, which makes the scheduling problem much more complex. We propose an efficient Iteration-based Task-FIFO Co-Scheduling algorithm to optimize the FIFO size distribution and task/FIFO assignment. Randomly generated Synchronous Dataflow Graphs with different sizes and a set of practical applications are used to evaluate the performance of the proposed method. The experimental results demonstrate that the proposed algorithm outperforms the load balancing method and the Highest Access Frequency First algorithm.

Metrics

Metrics

Download statistics
Download count
6
SciVal
FWCI
0.91
SciVal
Author count
5
SciVal
Paper percentile
69
SciVal
citations
2
Scopus
citations
2

PlumX, opens in new tab

Captures
4
Citation count
2