Executing synchronous dataflow graphs on a SPM-based multicore architecture
In this paper we are concerned about executing synchronous dataflow (SDF) applications on a multicore architecture where a core has a limited size of scratchpad memory (SPM). Unlike traditional multi-processor scheduling of SDF graphs, we consider the SPM size limitation that incurs code and data ov...
Saved in:
| Published in: | DAC Design Automation Conference 2012 pp. 664 - 671 |
|---|---|
| Main Authors: | , , , |
| Format: | Conference Proceeding |
| Language: | English |
| Published: |
New York, NY, USA
ACM
03.06.2012
IEEE |
| Series: | ACM Conferences |
| Subjects: | |
| ISBN: | 1450311997, 9781450311991 |
| ISSN: | 0738-100X |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | In this paper we are concerned about executing synchronous dataflow (SDF) applications on a multicore architecture where a core has a limited size of scratchpad memory (SPM). Unlike traditional multi-processor scheduling of SDF graphs, we consider the SPM size limitation that incurs code and data overlay overhead. Since the scheduling problem is intractable, we propose an EA(evolutionary algorithm)-based technique. To hide memory latency, prefetching is aggressively performed in the proposed technique. The experimental results show that our approach reduces the overlay overhead significantly compared to a non-optimized approach and the previous approach. |
|---|---|
| ISBN: | 1450311997 9781450311991 |
| ISSN: | 0738-100X |
| DOI: | 10.1145/2228360.2228480 |

