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.

Kevin Dawallu

dblp:30/3437 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 1995
—ORCID · none

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

Systems, architecture and hardware · 2

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
Memory systems · 66% Hardware reliability and fault tolerance · 34%

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

TopicWeightPapersLastEvidence papers
Hardware reliability and fault tolerance › error detection and correction
concurrent error detection and correction
0.011995
Fault-Tolerant Features in the HaL Memory Management Unit · IEEE Trans. Computers 1995
Memory systems › memory management
memory management unit
0.011995
Fault-Tolerant Features in the HaL Memory Management Unit · IEEE Trans. Computers 1995
Memory systems › memory management › virtual memory
address translation
0.011995
Fault-Tolerant Features in the HaL Memory Management Unit · IEEE Trans. Computers 1995
Memory systems
cache coherence
0.011995
Fault-Tolerant Features in the HaL Memory Management Unit · IEEE Trans. Computers 1995
Memory systems › cache design
virtually-indexed cache
0.011995
Fault-Tolerant Features in the HaL Memory Management Unit · IEEE Trans. Computers 1995

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

transient error recovery · 0.0linear polynomial codes · 0.0
YearPublicationVenuePosition
1995 Fault-Tolerant Features in the HaL Memory Management Unit
abstract
This paper describes fault-tolerant and error detection features in HaL's memory management unit (MMU). The proposed fault-tolerant features allow recovery from transient errors in the MMU. It is shown that these features were natural choices considering the architectural and implementation constraints in the MMU's design environment. Three concurrent error detection and correction methods employed in address translation and coherence tables in the MMU are described. Virtually-indexed and virtually-tagged cache architecture is exploited to provide an almost fault-secure hardware coherence mechanism in the MMU, with very small performance overhead (less than 0.01% in the instruction throughput). Low overhead linear polynomial codes have been chosen in these designs to minimize both the hardware and software instrumentation impact.>
Nirmal Saxena, David Chih-Wei Chang, Kevin Dawallu, Jaspal Kohli, Pat Helland
IEEE Trans. Computers3
1989 A VLSI module for IEEE floating-point multiplication/division/square root
abstract
The major objective of this VLSI module design is to determine how to modify a fast floating-point multiplier so that it can perform division and square root in accordance with IEEE standards. This has been achieved by applying the Newton-Ralphson iteration only on the mantissa and adjusting the iterated result by a rounding algorithm. Using 1.0- mu m CMOS standard cell technology, the total area of this module is approximately 7.0 mm*6.5 mm, which is just 25% larger than the floating-point multiplier. The module can compute multiplication, division, and square root in 3, 31, and 43 cycles, respectively. The cycle time, under nominal conditions, is expected to be 20 ns.>
Paul Y. Lu, Kevin Dawallu
ICCD2