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

Deepak Rautela

dblp:98/1503 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2005
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 first-author

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 · 88% Reconfigurable computing and FPGAs · 12%

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

TopicWeightPapersLastEvidence papers
Electronic design automation › physical design › routing
FPGA routing
0.112005
Efficient utilization of heterogeneous routing resources for FPGAs (abstract only) · FPGA 2005
Electronic design automation
physical design
0.112005
Efficient utilization of heterogeneous routing resources for FPGAs (abstract only) · FPGA 2005
Reconfigurable computing and FPGAs
FPGA routing architecture
0.012005
Efficient utilization of heterogeneous routing resources for FPGAs (abstract only) · FPGA 2005
Electronic design automation › physical design
routing resource graph
0.012005
Efficient utilization of heterogeneous routing resources for FPGAs (abstract only) · FPGA 2005

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

routability-driven routing · 0.1dynamic weight update heuristic · 0.1
YearPublicationVenuePosition
2005 Efficient utilization of heterogeneous routing resources for FPGAs (abstract only)
abstract
The routing resources available in recent FPGA architectures (e.g., Xilinx Virtex-II) are very different from the older generation of FPGAs (e.g., Xilinx XC4000). The latest FPGA architectures have heterogeneous routing resources which include directly driven wires of different lengths and connectivity. Most of the FPGA routing algorithms have been implemented on XC4000 style architectures and not much work has been reported for architectures with directly driven heterogeneous routing resources. Since routing resources in FPGAs are fixed, it is very important for the routing algorithms to fully exploit the potential of new routing architectures. FPGA routing architectures are usually represented as a routing resource graph (RRG). The construction of RRG to accurately model all the routing resources of current FPGA architectures is not a trivial task. In this paper we present a simplified scheme to build the RRG for FPGA architectures with heterogeneous routing resources. Using our RRG construction scheme we have built a routability driven detailed FPGA router named Bison. We also present a dynamic weight update based heuristic which we have incorporated into the router, so that efficient utilization of routing resources can be achieved.
Deepak Rautela, Rajendra S. Katti
FPGA1