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

W. C. Fischer

dblp:21/3708 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 1994
—ORCID · none

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

Systems, architecture and hardware · 1Computer networks · 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
2 papers
Electronic design automation · 32% Hardware accelerators and domain-specific architectures · 30% Reconfigurable computing and FPGAs · 30%
Computer networks
1 paper
Internet architecture and protocols · 100%

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

TopicWeightPapersLastEvidence papers
Internet architecture and protocols
protocol implementation
0.011994
The programmable protocol VLSI engine (PROVE) · IEEE Trans. Commun. 1994
Reconfigurable computing and FPGAs › reconfigurable architecture
reconfigurable processor
0.011987
Architecture and Design of the MARS Hardware Accelerator · DAC 1987
Hardware accelerators and domain-specific architectures › scientific computing accelerator
simulation accelerator
0.011987
Architecture and Design of the MARS Hardware Accelerator · DAC 1987
Electronic design automation
hardware description language
0.011994
The programmable protocol VLSI engine (PROVE) · IEEE Trans. Commun. 1994
Electronic design automation
circuit simulation
0.011987
Architecture and Design of the MARS Hardware Accelerator · DAC 1987
Performance modeling and evaluation › simulation
discrete-event simulation
0.011987
Architecture and Design of the MARS Hardware Accelerator · DAC 1987

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

microcode generation · 0.0compiler · 0.0microprogramming · 0.0
YearPublicationVenuePosition
1994 The programmable protocol VLSI engine (PROVE)
abstract
The protocol VLSI engine (PROVE) is programmable VLSI chipset which can be used to implement several standard communication protocols. The protocol to be implemented is described in a formal specification language called the augmented protocol specification language (APSL). From these formal descriptions, a compiler generates microcode for PROVE. PROVE can process 50000 packets/s for standard protocols such as LAPD and LLC Class 2. It consists of a message parser (MP), message assembler (MA), central controller unit (CCU), and interface with the upper layer. It supports efficient multiplexing operation with zero-overhead context-switching and support for timer maintenance. The paper describes the architectural features of the CCU, the MP, and the MA. A typical protocol implementation using the PROVE chipset is also described. The authors also compare it with other proposals for protocol engines. The first generation of the PROVE chipset has been built and tested.>
A. S. Krishnakumar, W. C. Fischer, Krishan K. Sabnani
IEEE Trans. Commun.2
1987 Architecture and Design of the MARS Hardware Accelerator
abstract
MARS (Microprogrammable Accelerator for Rapid Simulations) is a multiprocessor based hardware accelerator capable of efficiently implementing a wide range of computationally complex algorithms. Its architecture is ideally suited for performing event driven simulations of VLSI circuits. The highly pipelined and parallel architecture of MARS provides a performance comparable to existing hardware simulation engines while its highly flexible architecture supports a wide range of applications. Flexibility is achieved through custom designed microprogrammable and reconfigurable VLSI processors. Logic simulation performance of about one million events per second is easily achievable.
Prathima Agrawal, William J. Dally, Ahmed K. Ezzat, W. C. Fischer, H. V. Jagadish, A. S. Krishnakumar
DAC4