Proceedings of the 46th Annual Design Automation Conference 2009
DOI: 10.1145/1629911.1629988
|View full text |Cite
|
Sign up to set email alerts
|

Retiming and recycling for elastic systems with early evaluation

Abstract: Retiming and recycling are two transformations used to optimize the performance of latency-insensitive (a.k.a. synchronous elastic) systems. This paper presents an approach that combines these two transformations for performance optimization of elastic systems with early evaluation. The method is based on Mixed Integer Linear Programming.On a set of random benchmarks the proposed method achieves, in average, 14.5% performance improvement over min-delay retiming configurations.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2010
2010
2017
2017

Publication Types

Select...
3
2
1

Relationship

3
3

Authors

Journals

citations
Cited by 8 publications
(7 citation statements)
references
References 15 publications
0
7
0
Order By: Relevance
“…Then, the new EB can be retimed backwards across the node with delay 8, and the bubble between nodes 8 and 9 can be removed. This new configuration has a cycle time of 11 units, but the estimated throughput using an ILP model [7] is higher, 0.918, since there is only one cycle with a bubble 2 compared to Fig. 16(a), where two of the three cycles have bubbles.…”
Section: Re-designing For Average Performancementioning
confidence: 94%
See 1 more Smart Citation
“…Then, the new EB can be retimed backwards across the node with delay 8, and the bubble between nodes 8 and 9 can be removed. This new configuration has a cycle time of 11 units, but the estimated throughput using an ILP model [7] is higher, 0.918, since there is only one cycle with a bubble 2 compared to Fig. 16(a), where two of the three cycles have bubbles.…”
Section: Re-designing For Average Performancementioning
confidence: 94%
“…The retiming and recycling optimizations, including anti-token insertion and retiming, can be unified as a mixed integer linear programming problem (MILP) [7], and solved using linear programming tools. Therefore, automatic exploration of pipelines can be achieved by trying different combinations of bypasses added to each of the memory elements of the design, and then automatically pipelining each exploration point [20].…”
Section: B Microarchitectural Explorationmentioning
confidence: 99%
“…Retiming and recycling can be successfully applied for systems with early evaluation to achieve better performance [6]. The example from Fig.…”
Section: Early Evaluationmentioning
confidence: 99%
“…The retiming and recycling method [9] captures all transformations from Figure 2(a) in a formal model. A retiming and recycling configuration, RC, assigns an initial number of tokens (possibly negative) and a number of EBs to each edge.…”
Section: Introductionmentioning
confidence: 99%
“…A retiming and recycling configuration, RC, assigns an initial number of tokens (possibly negative) and a number of EBs to each edge. Since analysis of throughput in elastic systems with early evaluation only provides an upper bound, the heuristic method based on mixed integer linear programming presented in [9] finds a set of Pareto-point RCs/ with different trade-offs between cycle time and analytical throughput.…”
Section: Introductionmentioning
confidence: 99%