EDBT 2026 Demo / reviewers in the wild / expert
Pierre Souillot
dblp:93/1330
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 2006
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 2
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Electronic design automation · 56% Reconfigurable computing and FPGAs · 44% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Reconfigurable computing and FPGAs
FPGA architecture |
0.1 | 1 | 2006 | A multilevel hierarchical interconnection structure for FPGA · FPGA 2006 |
Electronic design automation › physical design › routing
FPGA routing |
0.1 | 1 | 2006 | A multilevel hierarchical interconnection structure for FPGA · FPGA 2006 |
Reconfigurable computing and FPGAs › FPGA architecture
hierarchical FPGA |
0.1 | 1 | 2006 | A multilevel hierarchical interconnection structure for FPGA · FPGA 2006 |
Electronic design automation › physical design › routing › FPGA routing
switch box design |
0.1 | 1 | 2006 | A multilevel hierarchical interconnection structure for FPGA · FPGA 2006 |
Electronic design automation › physical design › placement and routing
FPGA placement and routing |
0.0 | 1 | 2006 | A multilevel hierarchical interconnection structure for FPGA · FPGA 2006 |
Electronic design automation
physical design |
0.0 | 1 | 2006 | A multilevel hierarchical interconnection structure for FPGA · FPGA 2006 |
Methods — techniques the papers use, named apart from their topics
rent's rule · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2006 | A multilevel hierarchical interconnection structure for FPGAabstractCreation of large FPGAs needs radical efficient changes in architecture to improve speed, density and software mapping time. Based on industry experience with standard ASICs, we believe that partitioning and hierarchy become an obligation for FPGA hardware and software developments. As an alternative we propose a new Multilevel hierarchical FPGA (MFPGA) architecture where logic blocks and routing resources are sparsely partitioned into multilevel clustered structure. Since the routing resources consume most of the FPGA area, we focus on interconnect check. We try to achieve the best area efficiency by balancing interconnect and logic block utilization. The proposed MFPGA interconnect unifies two unidirectional programmable networks: A downward network based on the Butterfly-Fat-Tree topology, and an upward network that uses hierarchy. The Downward network uses linear populated and unidirectional switch boxes and gives one path from each wire-source in the top to each leaf (logic block) in the lowest level. The upward network connects the logic blocks outputs and the input pads to the different levels of the downward network. Studies based on the Rent's Rule show that wiring and switch requirements in the MFPGA grow slower than in traditional topologies. We used MCNC benchmark circuits to compare the switch and area requirements between our MFPGA architecture and the traditional mesh topology. New software tools for placement and routing were developed to conduct this study on the MFPGA architecture. Expermimental results show that MFPGA can implement circuits with fewer switches and a smaller total area than mesh architecture. Hayder Mrabet, Zied Marrakchi, Pierre Souillot, Habib Mehrez |
FPGA | 3 |
| 2006 | Performances improvement of FPGA using novel multilevel hierarchical interconnection structureabstractThis paper presents a new Multilevel hierarchical FPGA (MFPGA) architecture that unifies two unidirectional programmable networks: A predictible downward network based on the Butterfly-Fat-Tree topology, and an upward network using hierarchy. Studies based on the Rent's Rule show that wiring and switch requirements in the MFPGA grow slower than in traditional topologies. New tools are developed to place and route several benchmark circuits on this architecture. Experimental results based on the MCNC benchmarks show that MFPGA can implement circuits with an average gain of 40% in total area compared with mesh architecture. Hayder Mrabet, Zied Marrakchi, Pierre Souillot, Habib Mehrez |
ICCAD | 3 |