EDBT 2026 Demo / reviewers in the wild / expert
W. Lynn Gallagher
dblp:49/3295
· DBLP profile ↗
2ranked-venue papers
2as first author
0since 2021 · last 2000
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 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
1 paper |
Hardware reliability and fault tolerance · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Hardware reliability and fault tolerance
fault-tolerant arithmetic |
0.0 | 1 | 2000 | Fault-Tolerant Newton-Raphson and Goldschmidt Dividers Using Time Shared TMR · IEEE Trans. Computers 2000 |
Hardware reliability and fault tolerance
redundancy |
0.0 | 1 | 2000 | Fault-Tolerant Newton-Raphson and Goldschmidt Dividers Using Time Shared TMR · IEEE Trans. Computers 2000 |
Hardware reliability and fault tolerance › redundancy › modular redundancy
triple modular redundancy |
0.0 | 1 | 2000 | Fault-Tolerant Newton-Raphson and Goldschmidt Dividers Using Time Shared TMR · IEEE Trans. Computers 2000 |
Methods — techniques the papers use, named apart from their topics
precision reduction · 0.0newton-raphson iteration · 0.0goldschmidt algorithm · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2000 | Fault-Tolerant Newton-Raphson and Goldschmidt Dividers Using Time Shared TMRabstractIterative division algorithms based on multiplication are popular because they are fast and may utilize an already existing hardware multiplier. Two popular methods based on multiplication are Newton-Raphson and Goldschmidt's algorithm. To achieve concurrent error correction, Time Shared Triple Modular Redundancy (TSTMR) may be applied to both kinds of dividers. The hardware multiplier is divided into thirds, and the rest of the divider logic replicated around each part, to provide three independent dividers. While this reduces the size of the fault-tolerant dividers over that of traditional TMR, latency may be increased. However, both division algorithms can be modified to use lower precision multiplications during the early iterations. This saves multiply cycles and, hence, produces a faster divider. W. Lynn Gallagher, Earl E. Swartzlander Jr. |
IEEE Trans. Computers | 1 |
| 1997 | Evaluation of a memory hierarchy for the MTS multithreaded processorabstractExecuting multiple threads simultaneously on superscalar processor can improve hardware resource utilization and instruction throughput. The Multi-Threaded Superscalar (MTS) processor efficiently achieves the concurrent execution of multiple instruction streams using a VLIW, multiple functional unit architecture. However, the limitations of the memory system may impede the potential performance of the MTS processor. An interactive, parameter-driven simulator of the MTS architecture was developed using SES/workbench. A set of numerical benchmarks was run on it with varying memory system configurations. Assuming a single instruction cache, a single data cache, and one instruction queue per thread, varied parameters included the size of the instruction queues, the number of ports to the instruction cache, main memory latency, and cache hit rates. Based on simulation results, optimal values were chosen for certain parameters. To reasonably utilize the MTS processor, the memory system must provide at least 64 instruction bytes per cycle, though the demands for data access are far less severe. For reasonable memory speeds, this requires a roughly IMB three-ported instruction cache capable of providing 128 bits per port per cycle, as well as an IMB single-ported 32-bit wide data cache. A more realistic multilevel cache hierarchy is proposed. W. Lynn Gallagher, Chuan-lin Wu |
ICPADS | 1 |