Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Carlo Chiesa

dblp:83/5429 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2004
0000-0003-0634-013XORCID · corroborated

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
Reconfigurable computing and FPGAs · 91% Electronic design automation · 9%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Reconfigurable computing and FPGAs
dynamic reconfiguration
0.012004
Routing architecture for multi-context FPGAs · FPGA 2004
Reconfigurable computing and FPGAs
FPGA routing architecture
0.012004
Routing architecture for multi-context FPGAs · FPGA 2004
Reconfigurable computing and FPGAs › dynamic reconfiguration
multicontext FPGA
0.012004
Routing architecture for multi-context FPGAs · FPGA 2004
Electronic design automation
physical design
0.012004
Routing architecture for multi-context FPGAs · FPGA 2004

Methods — techniques the papers use, named apart from their topics

decoder-based multicontext architecture · 0.0
YearPublicationVenuePosition
2004 Routing architecture for multi-context FPGAs
abstract
Multi-context FPGAs are a convenient solution for run-time reconfiguration, but they suffer from large area occupation. This is mainly due to programmable interconnect configuration memories which need to be replicated as many times as the number of contexts. This limitation can be overcome with a DBM (Decoder Based Multicontext) routing architecture which introduces a decoding stage between configuration memories and routing structures, so that the number of SRAM cells can be highly reduced. Both the switch and connect blocks have been designed, at the architectural and schematic level. A suitable router for DBM structures has also been developed. The results show that the approach adopted requires on average only 5% more tracks whereas the device area occupation is reduced up to 40%. We also show that DBM routing architecture does not affect the critical path delay, due to the reduction of the routing wire length.
Andrea Lodi 0002, Roberto Giansante, Carlo Chiesa, Luca Ciccarelli, Mario Toma, Fabio Campi
FPGA3
2004 Compact Buffered Routing Architecture
Andrea Lodi 0002, Roberto Giansante, Carlo Chiesa, Luca Ciccarelli, Fabio Campi, Mario Toma
FPL3