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

John Teifel

dblp:04/1666 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
0since 2021 · last 2005
0000-0003-1682-4672ORCID · corroborated

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

Systems, architecture and hardware · 5 · 3 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
3 papers
Reconfigurable computing and FPGAs · 54% Electronic design automation · 30% Processor architecture and microarchitecture · 13%

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

TopicWeightPapersLastEvidence papers
Reconfigurable computing and FPGAs › FPGA architecture
asynchronous FPGA
0.132005
Automated synthesis for asynchronous FPGAs · FPGA 2005
An Asynchronous Dataflow FPGA Architecture · IEEE Trans. Computers 2004
Highly pipelined asynchronous FPGAs · FPGA 2004
Electronic design automation › logic synthesis
asynchronous circuit synthesis
0.112005
Automated synthesis for asynchronous FPGAs · FPGA 2005
Electronic design automation
logic synthesis
0.112005
Automated synthesis for asynchronous FPGAs · FPGA 2005
Processor architecture and microarchitecture
dataflow architecture
0.012004
An Asynchronous Dataflow FPGA Architecture · IEEE Trans. Computers 2004
Reconfigurable computing and FPGAs
FPGA architecture
0.012004
An Asynchronous Dataflow FPGA Architecture · IEEE Trans. Computers 2004
Integrated circuit design
asynchronous circuit design
0.012004
Highly pipelined asynchronous FPGAs · FPGA 2004

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

token-based compute model · 0.0self-pipelining · 0.0fine-grain pipelining · 0.0asynchronous circuit design · 0.0
YearPublicationVenuePosition
2005 A High-Performance Asynchronous FPGA: Test Results
abstract
We report test results from a prototype asynchronous FPGA (AFPGA) implemented in TSMC's 0.18 /spl mu/m CMOS process. The AFPGA uses SRAM-based configuration bits with pipelined logic blocks and switch boxes. Test results demonstrate a throughput of 674 MHz at 1.8 V.
David Fang, John Teifel, Rajit Manohar
FCCM2
2005 Automated synthesis for asynchronous FPGAs
abstract
We present an automatic logic synthesis method targeted for high-performance asynchronous FPGA (AFPGA) architectures. Our method transforms sequential programs as well as high-level descriptions of asynchronous circuits into fine-grain asynchronous process netlists suitable for an AFPGA. The resulting circuits are inherently pipelined, and can be physically mapped onto our AFPGA with standard partitioning and place-and-route algorithms. For a wide variety of benchmarks, our automatic synthesis method not only yields comparable logic densities and performance to those achieved by hand placement, but also attains a throughput close to the peak performance of the FPGA.
David Fang, John Teifel, Rajit Manohar
FPGA3
2004 Highly pipelined asynchronous FPGAs
abstract
We present the design of a high-performance, highly pipelined asynchronous FPGA. We describe a very fine-grain pipelined logic block and routing interconnect architecture, and show how asynchronous logic can efficiently take advantage of this large amount of pipelining. Our FPGA, which does not use a clock to sequence computations, automatically self-pipelines" its logic without the designer needing to be explicitly aware of all pipelining details. This property makes our FPGA ideal for throughput-intensive applications and we require minimal place and route support to achieve good performance. Benchmark circuits taken from both the asynchronous and clocked design communities yield throughputs in the neighborhood of 300--400 MHz in a TSMC 0.25m process and 500--700 MHz in a TSMC 0.18m process.
John Teifel, Rajit Manohar
FPGA1
2004 An Asynchronous Dataflow FPGA Architecture
abstract
We discuss the design of a high-performance field programmable gate array (FPGA) architecture that efficiently prototypes asynchronous (clockless) logic. In this FPGA architecture, low-level application logic is described using asynchronous dataflow functions that obey a token-based compute model. We implement these dataflow functions using finely pipelined asynchronous circuits that achieve high computation rates. This asynchronous dataflow FPGA architecture maintains most of the performance benefits of a custom asynchronous design, while also providing postfabrication logic reconfigurability. We report results for two asynchronous dataflow FPGA designs that operate at up to 400 MHz in a typical TSMC 0.25 /spl mu/m CMOS process.
John Teifel, Rajit Manohar
IEEE Trans. Computers1
2003 Programmable Asynchronous Pipeline Arrays
John Teifel, Rajit Manohar
FPL1