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

Alex Rodionov

dblp:48/9286 · DBLP profile ↗
← Back
5ranked-venue papers
5as first author
0since 2021 · last 2018
—ORCID · none

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

Systems, architecture and hardware · 5 · 5 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
2 papers
Electronic design automation · 86% Reconfigurable computing and FPGAs · 14%

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

TopicWeightPapersLastEvidence papers
Electronic design automation › physical design
interconnect synthesis
0.522017
Synchronization Constraints for Interconnect Synthesis · FPGA 2017
Fine-Grained Interconnect Synthesis · FPGA 2015
Electronic design automation
synchronization constraints
0.312017
Synchronization Constraints for Interconnect Synthesis · FPGA 2017
Reconfigurable computing and FPGAs
FPGA routing architecture
0.222017
Synchronization Constraints for Interconnect Synthesis · FPGA 2017
Fine-Grained Interconnect Synthesis · FPGA 2015
Electronic design automation
high-level synthesis
0.112015
Fine-Grained Interconnect Synthesis · FPGA 2015
Electronic design automation › design methodology
latency-insensitive design
0.112015
Fine-Grained Interconnect Synthesis · FPGA 2015

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

deterministic latency synthesis · 0.2arbitration avoidance · 0.2
YearPublicationVenuePosition
2018 Automatic Topology Optimization for FPGA Interconnect Synthesis
abstract
The goal of FPGA interconnect synthesis is to generate a physical network that connects user-supplied functional modules according to a logical specification of the desired connectivity. In this paper, we augment an existing FPGA interconnect synthesis flow with the ability to automatically design the topology of the generated network while reducing its area subject to user-supplied performance specifications. The key specification is a per-transmission importance value representing the designer's willingness to have a transmission contend with other transmissions. The designer may also optionally specify that certain transmissions will never temporally overlap. We present an iterative algorithm that generates a topology which respects these specifications, with the goal of reducing area. Optimization decisions are guided by pre-characterized area models of interconnect primitives and an analytical worst-case traffic contention model. We apply our approach to a case study of an FPGA-based linear algebra application, where we successfully optimize the topologies of two of its sub-networks resulting in area savings of 60% and 75% with no overall performance degredation.
Alex Rodionov, Jonathan Rose
FPL1
2017 Synchronization Constraints for Interconnect Synthesis
Alex Rodionov, Jonathan Rose
FPGA1
2016 Fine-Grained Interconnect Synthesis
abstract
One of the key challenges for the FPGA industry going forward is to make the task of designing hardware easier. A significant portion of that design task is the creation of the interconnect pathways between functional structures. We present a synthesis tool that automates this process and focuses on the interconnect needs in the fine-grained (sub-IP-block) design space. Here there are several issues that prior research and tools do not address well: the need to have fixed, deterministic latency between communicating units (to enable high-performance local communication without the area overheads of latency insensitivity), and the ability to avoid generating unnecessary arbitration hardware when the application design can avoid it. Using a design example, our tool generates interconnect that requires 69% fewer lines of specification code than a handwritten Verilog implementation, which is a 32% overall reduction for the entire application. The resulting system, while requiring 6% more total functional and interconnect area, achieves the same performance. We also show a quantitative and qualitative advantages against an existing commercial interconnect synthesis tool, over which we achieve a 25% performance advantage and 15%/57% logic/memory area savings.
Alex Rodionov, David Biancolin, Jonathan Rose
ACM Trans. Reconfigurable Technol. Syst.1
2015 Fine-Grained Interconnect Synthesis
abstract
One of the key challenges for the FPGA industry going forward is to make the task of designing hardware easier. A significant portion of that design task is the creation of the interconnect pathways between functional structures. We present a synthesis tool that automates this process and focuses on the interconnect needs in the fine-grained (sub-IP-block) design space. Here there are several issues that prior research and tools do not address well: the need to have fixed, deterministic latency between communicating units (to enable high-performance local communication without the area overheads of latency-insensitivity), and the ability to avoid generating un-necessary arbitration hardware when the application design can avoid it. Using a design example, our tool generates interconnect that requires 72% fewer lines of specification code than a hand-written Verilog implementation, which is a 33% overall reduction for the entire application. The resulting system, while requiring 4% more total functional and interconnect area, achieves the same performance. We also show a quantitative and qualitative advantages against an existing commercial interconnect synthesis tool, over which we achieve a 25% performance advantage and 17%/57% logic/memory area savings.
Alex Rodionov, David Biancolin, Jonathan Rose
FPGA1
2015 Automatic FPGA system and interconnect construction with multicast and customizable topology
abstract
Modern FPGA system integration tools, such as Qsys and Vivado, seek to help designers easily instantiate and connect IP cores. These tools require the cores to ascribe to a specific interconnect abstraction, which is either a high-level memory-mapped or low-level point-to-point streaming protocol. We present a system-level construction tool that gives the designer more control over the nature of the interconnect - specifically permitting multicast communication and the ability to easily construct custom network topologies. Our tool requires less user input than Qsys and yields a 5% area savings and 35% reduction in simulated execution time for a large and complex linear algebra application. The primary goal of this work is to make the designer's job easier by automating the design of interconnect, including exploration of alternative structures and communication patterns.
Alex Rodionov, Jonathan Rose
FPT1