2006
DOI: 10.1109/iccad.2006.320017
|View full text |Cite
|
Sign up to set email alerts
|

Platform-Based Resource Binding Using a Distributed Register-File Microarchitecture

Abstract: Behavior synthesis and optimization beyond the register transfer level require an efficient utilization of the underlying platform features. This paper presents a platform-based resource-binding approach using a distributed register-file microarchitecture (DRFM) that makes efficient use of distributed embedded memory blocks as register files in modern FPGAs. A DRFM contains multiple islands, each having a local register file, a functional unit pool and data-routing logic. Compared with the traditional discrete… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
23
0

Year Published

2008
2008
2016
2016

Publication Types

Select...
4
3

Relationship

4
3

Authors

Journals

citations
Cited by 14 publications
(23 citation statements)
references
References 30 publications
0
23
0
Order By: Relevance
“…Our work is compared to a traditional behavioral synthesis flow [6,7], and the DFG pattern-based synthesis result in [4]. Table II shows the QoR of our proposed pattern-based synthesis algorithm compared to the other two approaches.…”
Section: Resource Reduction Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…Our work is compared to a traditional behavioral synthesis flow [6,7], and the DFG pattern-based synthesis result in [4]. Table II shows the QoR of our proposed pattern-based synthesis algorithm compared to the other two approaches.…”
Section: Resource Reduction Resultsmentioning
confidence: 99%
“…Table II shows the QoR of our proposed pattern-based synthesis algorithm compared to the other two approaches. In Table II, the second, third and fifth columns are the synthesis results for the number of registers used without pattern-based technique [6,7], with a DFG pattern-based technique [4], and with CDFG pattern-based technique, respectively. Similarly, columns 7 to 11 list the amount and comparison of logic elements usage.…”
Section: Resource Reduction Resultsmentioning
confidence: 99%
“…There is extensive literature on general binding algorithms in high-level synthesis like [31,18,22,8,11]. For example, the weighted bipartite matching approach [18] tries to minimize the multiplexers following a step-by-step method, and it is later enhanced by the co-family based approach in [8].…”
Section: Related Workmentioning
confidence: 99%
“…Such metrics are usually derived from a graph representation of the netlist without performing layout. Widely used structural metrics include the total multiplexer inputs [7,22,23,29], the number of global interconnects [12,32], the total cut size [24], etc. These metrics are often easier to obtain and are more stable (i.e., not dependent on the layout algorithm), but their accuracy is often a concern.…”
Section: Routability Estimationmentioning
confidence: 99%