2010 Design, Automation &Amp; Test in Europe Conference &Amp; Exhibition (DATE 2010) 2010
DOI: 10.1109/date.2010.5456924
|View full text |Cite
|
Sign up to set email alerts
|

An efficient and complete approach for throughput-maximal SDF allocation and scheduling on multi-core platforms

Abstract: Our work focuses on allocating and scheduling a synchronous data-flow (SDF) graph onto a multi-core platform subject to a minimum throughput requirement. This problem has traditionally be tackled by incomplete approaches based on problem decomposition and local search, which could not guarantee optimality. Exact algorithms used to be considered reasonable only for small problem instances. We propose a complete algorithm based on Constraint Programming which solves the allocation and scheduling problem as a who… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
35
0

Year Published

2012
2012
2015
2015

Publication Types

Select...
3
2
2

Relationship

0
7

Authors

Journals

citations
Cited by 39 publications
(35 citation statements)
references
References 7 publications
0
35
0
Order By: Relevance
“…Other implementation aspects such as storage space or communication delays can be modeled in a similar manner in the dataflow graph. These methods are beyond the scope of this paper; interested readers are referred to for example [9], [26], [27]. Figure 3 illustrates an example behavior of the SADF model of the full WLAN application mapped onto a reconfigurable platform, as discussed in detail below.…”
Section: Modeling Applications Withmentioning
confidence: 99%
See 1 more Smart Citation
“…Other implementation aspects such as storage space or communication delays can be modeled in a similar manner in the dataflow graph. These methods are beyond the scope of this paper; interested readers are referred to for example [9], [26], [27]. Figure 3 illustrates an example behavior of the SADF model of the full WLAN application mapped onto a reconfigurable platform, as discussed in detail below.…”
Section: Modeling Applications Withmentioning
confidence: 99%
“…[9] uses constraint solving to find solutions that satisfy requirements, [10] is based on SAT solving techniques. Both approaches determine throughput optimal mappings using static, single-rate models.…”
Section: Related Workmentioning
confidence: 99%
“…This is done to ensure that the actors with higher criticality are allocated to resources with higher computational power (resources with higher nominal operating points are on average faster). In the second part of the algorithm (lines [11][12][13][14][15][16][17][18][19], allocation optimization is performed. The allocation of each actor in increasing order of criticality is reconsidered.…”
Section: B Heuristic Algorithmmentioning
confidence: 99%
“…There has been extensive research in the area of task allocation and scheduling for MPSoC [6]- [10], [13]- [15]. The researchers in [10], [14], [15] proposed methods to map throughput-constrained applications modeled as SDFGs to the resources in a MPSoC. None of them, however, considers the impact of process variation.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation