John C. Ramirez

dblp:03/1708 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 1999
—ORCID · none

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

Systems, architecture and hardware · 3 · 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 · 84% Reconfigurable computing and FPGAs · 16%

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

TopicWeightPapersLastEvidence papers
Hardware reliability and fault tolerance
fault-tolerant architecture
0.011994
Computational Arrays with Flexible Redundancy · IEEE Trans. Computers 1994
Reconfigurable computing and FPGAs
dynamic reconfiguration
0.011994
Computational Arrays with Flexible Redundancy · IEEE Trans. Computers 1994
Hardware reliability and fault tolerance
fault detection and correction
0.011994
Computational Arrays with Flexible Redundancy · IEEE Trans. Computers 1994
Hardware reliability and fault tolerance
majority voting
0.011994
Computational Arrays with Flexible Redundancy · IEEE Trans. Computers 1994

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

simulation · 0.0markov chain analysis · 0.0
YearPublicationVenuePosition
1999 Reducing Message Overhead in TMR Systems
abstract
Traditional TMR protocols assume either single, reliable voters for each triple-modular redundant unit (TMRU) or triplicated voters (one for each processor) for each TMRU. In the first case a voter is a single point of failure for the system. In the second case, many physical messages must be sent across the communication network for each logical data item. We examine some protocols which attempt to maintain the functionality of the triplicated voter TMR protocol while reducing the number of physical messages required by one third. Possible solutions are examined to the many issues that result from this reduction in communication. Three different reduced-communication triple-modular redundant (RTMR) protocols are considered, each of which makes different assumptions about the nature of the underlying computation.
John C. Ramirez, Rami G. Melhem
ICDCS1
1994 Computational Arrays with Flexible Redundancy
abstract
Different multiple redundancy schemes for fault detection and correction in computational arrays are proposed and analyzed. The basic idea is to embed a logical array of nodes onto a processor/switch array such that d processors, 1/spl les/d/spl les/4, are dedicated to the computation associated with each node. The input to a node is directed to the d processors constituting that node, and the output of the node is computed by taking a majority vote among the outputs of the d processors. The proposed processor/switch array (PSVA) is versatile in the sense that it may be configured as a nonredundant system or as a system which supports double, triple or quadruple redundancy. It also allows for spares to be distributed in the PSVA in a way that permits spare sharing among nodes, thus enhancing the overall system reliability. In addition to choosing the required degree of redundancy, the flexibility of the PSVA architecture allows for the embedding of redundant arrays onto defective PSVA's and for run-time reconfiguration to avoid faulty processors and switches. Different embedding and reconfiguration algorithms are presented and analyzed using Markov chain techniques, using probability arguments, and via simulation.>
John C. Ramirez, Rami G. Melhem
IEEE Trans. Computers1
1991 Reconfiguration of Computational Arrays with Multiple Redundancy
Rami G. Melhem, John C. Ramirez
ICPP (1)2