Fred A. Bower

Learn More
We develop a microprocessor design that tolerates hard faults, including fabrication defects and in-field faults, by leveraging existing microprocessor redundancy. To do this, we must: detect and correct errors, diagnose hard faults at the field deconfigurable unit (FDU) granularity, and deconfigure FDUs with hard faults. In our reliable microprocessor(More)
In this paper, we present a hardware technique, called Self-Repairing Array Structures (SRAS), for masking hard faults in microprocessor array structures, such as the reorder buffer and branch history table. SRAS masks errors that could otherwise lead to slow system recoveries. To detect row errors, every write to a row is mirrored to a dedicated “check(More)
......Moore’s law provides computer architects with more transistors than they can effectively use to extract instructionlevel parallelism (ILP) in a single core. Thus, all current and future high-performance processor chips are multicore processors, also known as chip multiprocessors (CMPs). These multicore processors include the Cell Broadband Engine,(More)
To achieve high reliability despite hard faults that occur during operation and to achieve high yield despite defects introduced at fabrication, a microprocessor must be able to tolerate hard faults. In this paper, we present a framework for autonomic self-repair of the array structures in microprocessors (e.g., reorder buffer, instruction window, etc.).(More)
In this paper, we present a new metric, Hard-Fault Architectural Vulnerability Factor (H-AVF), to allow designers to more effectively compare alternate hard-fault tolerance schemes. In order to provide intuition on the use of H-AVF as a metric, we evaluate fault-tolerant level-1 data cache and register file implementations using error correcting codes and a(More)
Numerical simulations of crack initiation which use a cohesive zone law to model a weak interface in the solid are often limited by the occurrence of an elastic snap-back instability. At the point of instability, quasi-static finite element computations are unable to converge to an equilibrium solution, which usually terminates the calculation and makes it(More)