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

Lvying Yu

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

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

Systems, architecture and hardware · 1

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 · 87% Distributed systems · 13%

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

TopicWeightPapersLastEvidence papers
Reconfigurable computing and FPGAs › FPGA architecture
asynchronous FPGA
0.412019
How to Accelerate FPGA Application in an Asynchronous Way? · FPGA 2019
Reconfigurable computing and FPGAs
FPGA design methodology
0.412019
How to Accelerate FPGA Application in an Asynchronous Way? · FPGA 2019
Distributed systems › operating system support › interprocess communication
asynchronous communication
0.112019
How to Accelerate FPGA Application in an Asynchronous Way? · FPGA 2019

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

delay matching · 0.4bundled bound data protocol · 0.4
YearPublicationVenuePosition
2019 How to Accelerate FPGA Application in an Asynchronous Way?
abstract
FPGA with massive customizable parallel computation capacity, is potentially good for fast time-to-market applications. However, its complex placing and routing lead to a relatively large latency and low frequency. Besides, the clock problems might make a design hard and slow, especially the one with complex control or variant computations. All of those defects seem to be from the essence of the synchronous design methodology and there does not exist an easy way to solve by clocks. Although the FPGA vendors do not supply an asynchronous design routine, flow or tool, it is still possible to implement a clockless design with a concrete FPGA chip and then harness lots of benefits that synchronous one misses, which is shown in this paper. We adopt link-joint as the asynchronous communication mechanism that discards clock limitation, but equips high throughput due to the fast handshake among neighbor clicks. The simplest link-joint circuit is click that conforms to Bundled Bound Data (BBD) protocol for local communication. Multiple clicks can be constructed and trimmed to types of micro-pipeline structures, feasibly and flexibly. With above considerations, we propose an innovative asynchronous design method for Xilinx FPGA applications, as well as the asynchronous control framework by dedicated micro-pipeline structures. Furthermore, we introduce delay maching technologies as well as whole design flow and tool-chain. All of these supply an applicable way of accelerating an asynchronous design for a FPGA. The case-studies show that communication between neighbor clicks is less than 1.1ns and the asynchronous method accelerates FPGA latency extremely.
Anping He, Jinlin Zhang, Lvying Yu
FPGA3