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

Jim Cortney

dblp:16/2612 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1993
—ORCID · none

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

Systems, architecture and hardware · 1Software engineering, systems software and programming languages · 1

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
Storage systems · 30% Distributed systems · 30% Memory systems · 30%

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

TopicWeightPapersLastEvidence papers
Distributed systems
fault tolerance
0.011993
The Architecture of a Fault-Tolerant Cached RAID Controller · ISCA 1993
Memory systems › cache management › storage caching
non-volatile cache
0.011993
The Architecture of a Fault-Tolerant Cached RAID Controller · ISCA 1993
Storage systems › storage reliability
RAID
0.011993
The Architecture of a Fault-Tolerant Cached RAID Controller · ISCA 1993
Hardware reliability and fault tolerance › reliability analysis
disk array reliability
0.011993
The Architecture of a Fault-Tolerant Cached RAID Controller · ISCA 1993

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

performance modeling · 0.0
YearPublicationVenuePosition
1993 The Architecture of a Fault-Tolerant Cached RAID Controller
abstract
RAID-5 arrays need 4 disk accesses to update a data block—2 to read old data and parity, and 2 to write new data and parity. Schemes previously proposed to improve the update performance of such arrays are the Log-Structured File System [10] and the Floating Parity Approach [6]. Here, we consider a third approach, called Fast Write, which eliminates disk time from the host response time to a write, by using a Non-Volatile Cache in the disk array controller. We examine three alternatives for handling Fast Writes and describe a hierarchy of destage algorithms with increasing robustness to failures. These destage algorithms are compared against those that would be used by a disk controller employing mirroring. We show that array controllers require considerably more (2 to 3 times more) bus bandwidth and memory bandwidth than do disk controllers that employ mirroring. So, array controllers that use parity are likely to be more expensive than controllers that do mirroring, though mirroring is more expensive when both controllers and disks are considered.
Jai Menon 0001, Jim Cortney
ISCA2