2000
DOI: 10.1145/329458.329463
|View full text |Cite
|
Sign up to set email alerts
|

Multiway FPGA partitioning by fully exploiting design hierarchy

Abstract: In this paper, we present a new integrated synthesis and partitioning method for multiple-FPGA applications. Our approach bridges the gap between HDL synthesis and physical partitioning by fully exploiting the design hierarchy. We propose a novel multiple-FPGA synthesis and partitioning method which is performed in three phases: (1) fine-grained synthesis, (2) functional-based clustering, and (3) hierarchical set-covering partitioning. This method first synthesizes a design specification in a fine-grained way … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0
2

Year Published

2003
2003
2013
2013

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 12 publications
(8 citation statements)
references
References 10 publications
0
6
0
2
Order By: Relevance
“…However, compared to Atom, the Nehalem core requires roughly 4x more FPGA capacity. Due to this size increase, multiple-FPGA partitioning must be employed for the Nehalem core requiring time multiplexing of wires [2] between FPGAs and various partitioning tools [1] and techniques [5,12].…”
Section: Related Workmentioning
confidence: 99%
“…However, compared to Atom, the Nehalem core requires roughly 4x more FPGA capacity. Due to this size increase, multiple-FPGA partitioning must be employed for the Nehalem core requiring time multiplexing of wires [2] between FPGAs and various partitioning tools [1] and techniques [5,12].…”
Section: Related Workmentioning
confidence: 99%
“…In the past several years, many partitioning approaches and algorithms have been proposed to solve the FPGA partitioning problem [4][5][6][7][8][9][10]. One conventional partitioning approach for large netlists is to first apply clustering, topological ordering, and/or level construction schemes to reduce circuit complexity and then apply a set-covering method to reduce the number of required PEs.…”
Section: Partitioning Approachesmentioning
confidence: 99%
“…The result of this partitioning approach is a set of segments of the synthesised design distributed over multiple devices [7], [11]. A number of studies have demonstrated the superiority of the partitioning at the behavioural level over RTL [6], [12], [13]. A common design representation for partitioning would be a graph-based model like Data Flow Graphs, Control and Data Flow Graphs [12] or Module Call Graphs [14].…”
Section: Multi-fpga Synthesis System a Synthesis And Partitioningmentioning
confidence: 99%