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

Dynamic Configuration Prefetching Based on Piecewise Linear Prediction

Abstract: Abstract-Modern systems demand high performance, as well as high degrees of flexibility and adaptability. Many current applications exhibit a dynamic and nonstationary behavior, having certain characteristics in one phase of their execution, that will change as the applications enter new phases, in a manner unpredictable at design-time. In order to meet the performance requirements of such systems, it is important to have on-line optimization algorithms, coupled with adaptive hardware platforms, that together … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
9
0

Year Published

2013
2013
2018
2018

Publication Types

Select...
4
3

Relationship

2
5

Authors

Journals

citations
Cited by 8 publications
(9 citation statements)
references
References 15 publications
0
9
0
Order By: Relevance
“…Prefetch has been studied extensively for microprocessors [26]. Recently for reconfiguration archtectures a new prefetch scheme was proposed based on piecewise linear prediction [27]. Ours is a much simpler one tailored for stream graphs.…”
Section: Related Workmentioning
confidence: 99%
“…Prefetch has been studied extensively for microprocessors [26]. Recently for reconfiguration archtectures a new prefetch scheme was proposed based on piecewise linear prediction [27]. Ours is a much simpler one tailored for stream graphs.…”
Section: Related Workmentioning
confidence: 99%
“…In [18], a new dynamic optimization approach for configuration prefetching is proposed and evaluated. An on-line piecewise linear predictor is used to capture branch correlations and estimate the likelihood to reach different hardware modules from a prediction point.…”
Section: B Fpga Configuration Prefetchingmentioning
confidence: 99%
“…Dynamic prefetching techniques (e.g. [11], [16], [18]) are suitable for applications with non-stationary behavior, since they provide maximum flexibility and adaptability. On the other hand, the optimization algorithms used for prefetching need to be lightweight and capable to learn on-line what are the best prefetches to apply, given the current run-time conditions.…”
Section: Introductionmentioning
confidence: 99%
“…The second approach targets applications that exhibit a dynamic and non-stationary phase behavior. The optimization technique dynamically schedules prefetches at run-time based on a piecewise linear predictor [LEP13]. Our methods achieve high degrees of adaptability and answer the performance requirements of cost-constrained systems.…”
Section: Summary Of Contributionsmentioning
confidence: 99%