Demo Data from EDBT 2026 / reviewers in the wild / expert
Christopher T. Weaver
dblp:93/5429
· DBLP profile ↗
9ranked-venue papers
4as first author
0since 2021 · last 2009
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 8 · 3 first-authorSoftware engineering, systems software and programming languages · 3 · 2 first-authorSecurity and privacy · 1 · 1 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
6 papers |
Hardware reliability and fault tolerance · 36% Reconfigurable computing and FPGAs · 23% Electronic design automation · 18% | |
| Network and information security
1 paper |
Topics — the 15 heaviest of 18, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Reconfigurable computing and FPGAs
FPGA prototyping |
0.1 | 1 | 2009 | Intel® atomTM processor core made FPGA-synthesizable · FPGA 2009 |
Reconfigurable computing and FPGAs
processor emulation |
0.1 | 1 | 2009 | Intel® atomTM processor core made FPGA-synthesizable · FPGA 2009 |
Hardware reliability and fault tolerance
soft errors |
0.1 | 2 | 2004 | Techniques to Reduce the Soft Error Rate of a High-Performance Microprocessor · ISCA 2004 A Systematic Methodology to Compute the Architectural Vulnerability Factors for a High-Performance Microprocessor · MICRO 2003 |
Electronic design automation › hardware verification and test
hardware verification |
0.1 | 2 | 2009 | Scalable Hybrid Verification of Complex Microprocessors · DAC 2001 Intel® atomTM processor core made FPGA-synthesizable · FPGA 2009 |
Hardware reliability and fault tolerance
error detection |
0.0 | 1 | 2004 | Techniques to Reduce the Soft Error Rate of a High-Performance Microprocessor · ISCA 2004 |
Hardware reliability and fault tolerance › soft errors
soft error rate reduction |
0.0 | 1 | 2004 | Techniques to Reduce the Soft Error Rate of a High-Performance Microprocessor · ISCA 2004 |
Hardware reliability and fault tolerance › soft errors
transient fault |
0.0 | 1 | 2004 | Techniques to Reduce the Soft Error Rate of a High-Performance Microprocessor · ISCA 2004 |
Hardware reliability and fault tolerance › soft errors
architectural vulnerability factor |
0.0 | 1 | 2003 | A Systematic Methodology to Compute the Architectural Vulnerability Factors for a High-Performance Microprocessor · MICRO 2003 |
Hardware accelerators and domain-specific architectures
cryptographic accelerator |
0.0 | 1 | 2001 | CryptoManiac: a fast flexible architecture for secure communication · ISCA 2001 |
Electronic design automation › hardware verification and test
formal verification |
0.0 | 1 | 2001 | Scalable Hybrid Verification of Complex Microprocessors · DAC 2001 |
Electronic design automation › hardware verification and test
processor verification |
0.0 | 1 | 2001 | Scalable Hybrid Verification of Complex Microprocessors · DAC 2001 |
Electronic design automation › hardware verification and test › functional verification
pre-silicon verification |
0.0 | 1 | 2009 | Intel® atomTM processor core made FPGA-synthesizable · FPGA 2009 |
Processor architecture and microarchitecture › front-end
instruction queue |
0.0 | 1 | 2004 | Techniques to Reduce the Soft Error Rate of a High-Performance Microprocessor · ISCA 2004 |
Performance modeling and evaluation › simulation › processor simulation
microarchitecture simulation |
0.0 | 1 | 2003 | A Systematic Methodology to Compute the Architectural Vulnerability Factors for a High-Performance Microprocessor · MICRO 2003 |
Performance modeling and evaluation
simulation |
0.0 | 1 | 2003 | A Systematic Methodology to Compute the Architectural Vulnerability Factors for a High-Performance Microprocessor · MICRO 2003 |
Methods — techniques the papers use, named apart from their topics
latch mapping · 0.1clock gating conversion · 0.1FPGA synthesis · 0.1instruction squashing · 0.0MITF metric · 0.0microarchitectural instrumentation · 0.0fault injection simulation · 0.0formal verification · 0.0cryptographic processing · 0.0checker processor · 0.0at-speed emulation · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2009 | Intel® atomTM processor core made FPGA-synthesizableabstractWe present an FPGA-synthesizable version of the Intel Atom processor core, synthesized to a Virtex-5 based FPGA emulation system. To make the production Atom design in SystemVerilog synthesizable through industry standard EDA tool flow, we transformed and mapped latches in the design, converted clock gating, and replaced nonsynthesizable constructs with FPGA-synthesizable counterparts. Additionally, as the target FPGA emulator is hosted on a PC platform with the Pentium-based CPU socket that supports a significantly different front side bus (FSB) protocol from that of the Atom processor, we replaced the existing bus control logic in the Atom core with an alternate FSB protocol to communicate with the rest of the PC platform. With these efforts, we succeeded in synthesizing the entire Atom processor core to fit within a single Virtex-5 LX330 FPGA. The synthesizable Atom core runs at 50Mhz on the Pentium PC motherboard with fully functional I/O peripherals. It is capable of booting off-the-shelf MS-DOS, Windows XP and Linux operating systems, and executing standard x86 workloads. Perry H. Wang, Jamison D. Collins, Christopher T. Weaver, Belliappa Kuttanna, Shahram Salamian, Gautham N. Chinya, Ethan Schuchman, Oliver Schilling, Thorsten Doil, Sebastian Steibl, Hong Wang 0003 |
FPGA | 3 |
| 2004 | Techniques to Reduce the Soft Error Rate of a High-Performance MicroprocessorabstractTransient faults due to neutron and alpha particle strikes pose a significant obstacle to increasing processor transistor counts in future technologies. Although fault rates of individual transistors may not rise significantly, incorporating more transistors into a device makes that device more likely to encounter a fault. Hence, maintaining processor error rates at acceptable levels will require increasing design effort. This paper proposes two simple approaches to reduce error rates and evaluates their application to a microprocessor instruction queue. The first technique reduces the time instructions sit in vulnerable storage structures by selectively squashing instructions when long delays are encountered. A fault is less likely to cause an error if the structure it affects does not contain valid instructions. We introduce a new metric, MITF (Mean Instructions To Failure), to capture the trade-off between performance and reliability introduced by this approach. The second technique addresses false detected errors. In the absence of a fault detection mechanism, such errors would not have affected the final outcome of a program. For example, a fault affecting the result of a dynamically dead instruction would not change the final program output, but could still be flagged by the hardware as an error. To avoid signalling such false errors, we modify a pipeline's error detection logic to mark affected instructions and data as possibly incorrect rather than immediately signaling an error. Then, we signal an error only if we determine later that the possibly incorrect value could have affected the program's output. Christopher T. Weaver, Joel S. Emer, Shubhendu S. Mukherjee, Steven K. Reinhardt |
ISCA | 1 |
| 2003 | A Systematic Methodology to Compute the Architectural Vulnerability Factors for a High-Performance MicroprocessorabstractSingle-event upsets from particle strikes have become a key challenge in microprocessor design. Techniques to deal with these transients faults exist, but come at a cost. Designers clearly require accurate estimates of processor error rates to make appropriate cost/reliability tradeoffs. This paper describes a method for generating these estimates. A key aspect of this analysis is that some single-bit faults (such as those occurring in the branch predictor) do not produce an error in a program's output. We define a structure's architectural vulnerability factor (AVF) as the probability that a fault in that particular structure do not result in an error. A structure's error rate is the product of its raw error rate, as determined by process and circuit technology, and the AVF. Unfortunately, computing AVFs of complex structures, such as the instruction queue, can be quite involved. We identify numerous cases, such as prefetches, dynamically dead code, and wrong-path instructions, in which a fault do not affect, correct execution. We instrument a detailed 1A64 processor simulator to map bit-level microarchitectural state to these cases, generating per-structure AVF estimates. This analysis shows AVFs of 28% and 9% for the instruction queue and execution units, respectively, averaged across dynamic sections of the entire CPU2000 benchmark suite. Shubhendu S. Mukherjee, Christopher T. Weaver, Joel S. Emer, Steven K. Reinhardt, Todd M. Austin |
MICRO | 2 |
| 2001 | Application specific architectures: a recipe for fast, flexible and power efficient designsabstractThe general purpose processor has long been the focus of intense optimization efforts that have resulted in an impressive doubling of performance every 18 months. However, recent evidence suggests that these efforts may be faltering as pipelining and ILP processing techniques experience diminishing returns. Application specific architectures hold great potential as an alternative means to continue scaling application performance. The approach works by specializing a design to a small domain of important applications, and it benefits from improved performance, greater power efficiency, and reduced area costs. This technique is well matched to embedded targets, where application domains are typically narrowIn this paper we present a case study of an application specific processor design. Our design, called the CryptoManiac processor, is an architecture specialized to efficiently execute cryptographic ciphers. We carefully highlight the domain specific application characteristics we identified and their accompanying optimizations in the CryptoManiac design. Detailed analyses of the design makes a strong case for application specific optimization. The CryptoManiac processor runs popular ciphers at twice the speed of a high-end general purpose processor, and the design renders nearly two orders-of-magnitude reduction in power consumption and area costs. Finally, we identify two key challenges that stand as barriers to wide spread adoption of application specific architectures. Christopher T. Weaver, Rajeev Krishna, Lisa Wu Wills, Todd M. Austin |
CASES | 1 |
| 2001 | Scalable Hybrid Verification of Complex MicroprocessorsabstractWe introduce a new verification methodology for modern micro-processors that uses a simple checker processor to validate the exe-cution of a companion high-performance processor. The checker can be viewed as an at-speed emulator that is formally verified to be compliant to an ISA specification. This verification approach en-ables the practical deployment of formal methods without impact-ing overall performance. Maher N. Mneimneh, Fadi A. Aloul, Christopher T. Weaver, Saugata Chatterjee, Karem A. Sakallah, Todd M. Austin |
DAC | 3 |
| 2001 | A Fault Tolerant Approach to Microprocessor DesignabstractWe propose a fault-tolerant approach to reliable microprocessor design. Our approach, based on the use of an online checker component in the processor pipeline, provides significant resistance to core processor design errors and operational faults such as supply voltage noise and energetic particle strikes. We show through cycle-accurate simulation and timing analysis of a physical checker design that our approach preserves system performance while keeping area overheads and power demands low. Furthermore, analyses suggest that the checker is a fairly simple state machine that can be formally verified, scaled in performance, and reused. Further simulation analyses show virtually no performance impacts when our simple checker design is coupled with a high-performance microprocessor model. Timing analyses indicate that a fully synthesized unpipelined 4-wide checker component in 0.25 /spl mu/m technology is capable of checking Alpha instructions at 288 MHz. Physical analyses also confirm that costs are quite modest; our prototype checker requires less than 6% the area and 1.5% the power of an Alpha 21264 processor in the same technology. Additional improvements to the checker component are described which allow for improved detection of design, fabrication and operational faults. Christopher T. Weaver, Todd M. Austin |
DSN | 1 |
| 2001 | CryptoManiac: a fast flexible architecture for secure communicationabstractThe growth of the Internet as a vehicle for secure communication and electronic commerce has brought cryptographic processing performance to the forefront of high throughput system design. This trend will be further underscored with the widespread adoption of secure protocols such as secure IP (IPSEC) and virtual private networks (VPNs). Lisa Wu Wills, Christopher T. Weaver, Todd M. Austin |
ISCA | 2 |
| 2001 | Performance analysis using pipeline visualizationabstractHigh-end microprocessors are increasing in complexity to push the limits of speed and performance. As a result, analyzing these complex system can be an arduous task. Architectural simulators, acting as sofrware processors, are able to run programs and give statistics about the performance of the code on the design. While these statistics are valuable for identifying problems, they often do not provide the fidelity necessary to diagnose the cause of sluggish performance. This paper presents a cross-platform tool that can be used to visualize the flow of instructions through an architectural processor pipeline model. The Graphical Pipeline Viewel; GPC: uses a colorized pipeline trace display to deliver an efJicient diagnostic and analysis environment. The resource view of the tool, which can display cycle statistics, aids in distinguishing possible bottlenecks and architectural trade-ogs. As such, the tool is able to suggest code and architectural modifications to increase program performance.’ Christopher T. Weaver, Kenneth C. Barr, Eric D. Marsman, Dan Ernst, Todd M. Austin |
ISPASS | 1 |
| 2000 | Efficient checker processor designabstractThe design and implementation of a modern microprocessor creates many reliability challenges. Designers must verify the correctness of large complex systems and construct implementations that work reliably in varied (and occasionally adverse) operating conditions. In our previous work, we proposed a solution to these problems by adding a simple, easily verifiable checker processor at pipeline retirement. Performance analyses of our initial design were promising, overall slowdowns due to checker processor hazards were less than 3%. However slowdowns for some outlier programs were larger. The authors closely examine the operation of the checker processor. We identify the specific reasons why the initial design works well for some programs, but slows others. Our analyses suggest a variety of improvements to the checker processor storage system. Through the addition of a 4 k checker cache and eight entry store queue, our optimized design eliminates virtually all core processor slowdowns. Moreover, we develop insights into why the optimized checker processor performs well, insights that suggest it should perform well for any program. Saugata Chatterjee, Christopher T. Weaver, Todd M. Austin |
MICRO | 2 |