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

Fred A. Bower

dblp:70/1347 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
0since 2021 · last 2007
—ORCID · none

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

Systems, architecture and hardware · 3 · 3 first-authorSecurity and privacy · 2 · 2 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
Hardware reliability and fault tolerance · 40% Electronic design automation · 19% Distributed systems · 16%

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

TopicWeightPapersLastEvidence papers
Electronic design automation › hardware verification and test
fault diagnosis
0.122007
Online diagnosis of hard faults in microprocessors · ACM Trans. Archit. Code Optim. 2007
A Mechanism for Online Diagnosis of Hard Faults in Microprocessors · MICRO 2005
Distributed systems
fault tolerance
0.122005
Autonomic Microprocessor Execution via Self-Repairing Arrays · IEEE Trans. Dependable Secur. Comput. 2005
A Mechanism for Online Diagnosis of Hard Faults in Microprocessors · MICRO 2005
Embedded and real-time systems › runtime monitoring
runtime verification
0.122007
A Mechanism for Online Diagnosis of Hard Faults in Microprocessors · MICRO 2005
Online diagnosis of hard faults in microprocessors · ACM Trans. Archit. Code Optim. 2007
Processor architecture and microarchitecture
microprocessor design
0.112007
Online diagnosis of hard faults in microprocessors · ACM Trans. Archit. Code Optim. 2007
Hardware reliability and fault tolerance
permanent fault tolerance
0.112007
Online diagnosis of hard faults in microprocessors · ACM Trans. Archit. Code Optim. 2007
Hardware reliability and fault tolerance
redundancy
0.112007
Online diagnosis of hard faults in microprocessors · ACM Trans. Archit. Code Optim. 2007
Hardware reliability and fault tolerance
error detection and correction
0.112005
A Mechanism for Online Diagnosis of Hard Faults in Microprocessors · MICRO 2005
Hardware reliability and fault tolerance › redundancy
redundant execution
0.012005
A Mechanism for Online Diagnosis of Hard Faults in Microprocessors · MICRO 2005
Processor architecture and microarchitecture
reorder buffer
0.012005
Autonomic Microprocessor Execution via Self-Repairing Arrays · IEEE Trans. Dependable Secur. Comput. 2005

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

error counters · 0.1DIVA dynamic verification · 0.1simulation · 0.1
YearPublicationVenuePosition
2007 Online diagnosis of hard faults in microprocessors
abstract
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 design, we use DIVA dynamic verification to detect and correct errors. Our new scheme for diagnosing hard faults tracks instructions' core structure occupancy from decode until commit. If a DIVA checker detects an error in an instruction, it increments a small saturating error counter for every FDU used by that instruction, including that DIVA checker. A hard fault in an FDU quickly leads to an above-threshold error counter for that FDU and thus diagnoses the fault. For deconfiguration, we use previously developed schemes for functional units and buffers and present a scheme for deconfiguring DIVA checkers. Experimental results show that our reliable microprocessor quickly and accurately diagnoses each hard fault that is injected and continues to function, albeit with somewhat degraded performance.
Fred A. Bower, Daniel J. Sorin, Sule Ozev
ACM Trans. Archit. Code Optim.1
2005 A Mechanism for Online Diagnosis of Hard Faults in Microprocessors
abstract
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 design, we use DIVA dynamic verification to detect and correct errors. Our new scheme for diagnosing hard faults tracks instructions' core structure occupancy from decode until commit. If a DIVA checker detects an error in an instruction, it increments a small saturating error counter for every FDU used by that instruction, including that DIVA checker. A hard fault in an FDU quickly leads to an above-threshold error counter for that FDU and thus diagnoses the fault. For deconfiguration, we use previously developed schemes for functional units and buffers, and we present a scheme for deconfiguring DIVA checkers. Experimental results show that our reliable microprocessor quickly and accurately diagnoses each hard fault that is injected and continues to function, albeit with somewhat degraded performance.
Fred A. Bower, Daniel J. Sorin, Sule Ozev
MICRO1
2005 Autonomic Microprocessor Execution via Self-Repairing Arrays
abstract
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.). The framework consists of three aspects: 1) detecting/diagnosing the fault, 2) recovering from the resultant error, and 3) mapping out the faulty portion of the array. For each aspect, we present design options. Based on this framework, we develop two particular schemes for self-repairing array structures (SRAS). Simulation results show that one of our SRAS schemes adds some performance overhead in the fault-free case, but that both of them mask hard faults 1) with less hardware overhead cost than higher-level redundancy (e.g., IBM mainframes) and 2) without the per-error performance penalty of existing low-cost techniques that combine error detection with pipeline flushes for backward error recovery (BER). When hard faults are present in arrays, due to operational faults or fabrication defects, SRAS schemes outperform BER due to not having to frequently flush the pipeline.
Fred A. Bower, Sule Ozev, Daniel J. Sorin
IEEE Trans. Dependable Secur. Comput.1
2004 Tolerating Hard Faults in Microprocessor Array Structures
abstract
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 row". We then read out both the written row and check row and compare their results. To correct errors, SRAS maps out faulty array rows with a level of indirection.
Fred A. Bower, Paul G. Shealy, Sule Ozev, Daniel J. Sorin
DSN1