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 R. Hauser

dblp:82/2756 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
0since 2021 · last 2004
—ORCID · unresolved

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

Systems, architecture and hardware · 2 · 1 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1Applied, interdisciplinary, general and emerging computing · 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 · 56% Integrated circuit design · 25% Reconfigurable computing and FPGAs · 19%
Software engineering, system software, and programming languages
1 paper
Programming languages and type systems · 56% Compilers and program optimization · 44%

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

TopicWeightPapersLastEvidence papers
Reconfigurable computing and FPGAs
FPGA architecture
0.012004
The SFRA: a corner-turn FPGA architecture · FPGA 2004
Integrated circuit design
interconnect
0.012004
The SFRA: a corner-turn FPGA architecture · FPGA 2004
Electronic design automation
physical design
0.012004
The SFRA: a corner-turn FPGA architecture · FPGA 2004
Electronic design automation › physical design
routing
0.012004
The SFRA: a corner-turn FPGA architecture · FPGA 2004
Electronic design automation › physical design › interconnect optimization
wire pipelining
0.012004
The SFRA: a corner-turn FPGA architecture · FPGA 2004
Programming languages and type systems › control structures
exception handling
0.011996
Handling Floating-Point Exceptions in Numeric Programs · ACM Trans. Program. Lang. Syst. 1996
Compilers and program optimization
floating-point arithmetic
0.011996
Handling Floating-Point Exceptions in Numeric Programs · ACM Trans. Program. Lang. Syst. 1996
Integrated circuit design
microelectronics manufacturing
0.011993
Cener for advanced electronic materials processing · Proc. IEEE 1993
Programming languages and type systems
language design
0.011996
Handling Floating-Point Exceptions in Numeric Programs · ACM Trans. Program. Lang. Syst. 1996
Integrated circuit design › 3d integration
3-D stacked IC
0.011993
Cener for advanced electronic materials processing · Proc. IEEE 1993
Integrated circuit design › semiconductor devices › heterostructure devices
heterojunction device
0.011993
Cener for advanced electronic materials processing · Proc. IEEE 1993

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

retiming · 0.0scaling · 0.0gradual underflow · 0.0extended range reevaluation · 0.0
YearPublicationVenuePosition
2004 The SFRA: a corner-turn FPGA architecture
abstract
FPGAs normally operate at whatever clock rate is appropriate for the loaded configuration. When FPGAs are used as computational devices in a larger system, however, it is better to employ fixed-frequency FPGAs operating at a high clock frequency. Such fixed-frequency arrays require pipelined interconnect structures, which are difficult to support in a traditional FPGA architecture. We have developed a novel approach, called a interconnect, based on a Manhattan array of logically depopulated S-boxes with full connectivity but limited routability. This interconnect supports new polynomial-time routing techniques while maintaining conventional placement and other upstream toolflow. We have used the corner-turn interconnect to define a fixed-frequency FPGA architecture, the SFRA, that is largely compatible with the Xilinx Virtex while providing higher speed, pipelined operation. Our tools automatically repipeline designs to operate at the SFRA's intrinsic clock frequency. Since the arrays are largely compatible, we directly compare the SFRA with the Virtex on four benchmark designs. On these benchmarks, the SFRA offers higher throughput and competitive throughput per area. The SFRA routing and retiming tools also run one to two orders of magnitude faster than their Xilinx counterparts.
Nicholas Weaver, John R. Hauser, John Wawrzynek
FPGA2
1999 A fixed-point recursive digital oscillator for additive synthesis of audio
abstract
This paper summarizes our work adapting a recursive digital resonator for use on sixteen-bit fixed-point hardware. Our modified oscillator is a two-pole filter that maintains frequency precision at a cost of two additional operations per filter sample. The new filter's error properties are expressly matched to use in the range of frequencies relevant to additive synthesis of digital audio and sinusoidal modelling of speech in order to minimize the additional computational overhead. We present the algorithm, an error analysis, a performance analysis, and measurements of an implementation on a fixed-point vector microprocessor system.
Todd D. Hodes, John R. Hauser, John Wawrzynek, Adrian Freed, David Wessel
ICASSP2
1997 Garp: a MIPS processor with a reconfigurable coprocessor
abstract
Typical reconfigurable machines exhibit shortcomings that make them less than ideal for general-purpose computing. The Garp Architecture combines reconfigurable hardware with a standard MIPS processor on the same die to retain the better features of both. Novel aspects of the architecture are presented, as well as a prototype software environment and preliminary performance results. Compared to an UltraSPARC, a Garp of similar technology could achieve speedups ranging from a factor of 2 to as high as a factor of 24 for some useful applications.
John R. Hauser, John Wawrzynek
FCCM1
1996 Handling Floating-Point Exceptions in Numeric Programs
abstract
There are a number of schemes for handling arithmetic exceptions that can be used to improve the speed (or alternatively the reliability) of numeric code. Overflow and underflow are the most troublesome exceptions, and depending on the context in which the exception can occur, they may be addressed either: (1) through a “brute force” reevaluation with extended range, (2) by reevaluating using a technique known as scaling , (3) by substituting an infinity or zero, or (4) in the case of underflow, with gradual underflow. In the first two of these cases, the offending computation is simply reevaluated using a safer but slower method. The latter two cases are cheaper, more automated schemes that ideally are built in as options within the computer system. Other arithmetic exceptions can be handled with similar methods. These and some other techniques are examined with an eye toward determining the support programming languages and computer systems ought to provide for floating-point exception handling. It is argued that the cheapest short-term solution would be to give full support to most of the required (as opposed to recommended) special features of the IEC/IEEE Standard for Binary Floating-Point Arithmetic. An essential part of this support would include standardized access from high-level languages to the exception flags defined by the standard. Some possibilities outside the IEEE Standard are also considered, and a few thought on possible better-structured support within programming languages are discussed.
John R. Hauser
ACM Trans. Program. Lang. Syst.1
1993 Cener for advanced electronic materials processing
abstract
Microelectronics manufacturing technology is rapidly moving toward integrated circuits with submicron minimum feature sizes. This is being driven by the development of devices and circuits with reduced device lateral dimensions, increased density per chip, thinner material layers, increased use of the vertical dimension (three-dimensional circuits), low volume/fast tumaround design (ASIC's), increased use of heterojunctions, mixed material technologies, and quantum-based device structures. These trends require precise control of thin layers processed on wafers and a need for lower temperature processing or a lower overall thermal budget
Nino A. Masnari, John R. Hauser, Gerald Lucovsky, Dennis M. Maher, Robert J. Markunas, Mehmet C. Bztork, Jimmie J. Wortman
Proc. IEEE2