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

Dick Mattson

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

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

Systems, architecture and hardware · 2Software 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 · 62% Distributed systems · 38%

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

TopicWeightPapersLastEvidence papers
Distributed systems › fault tolerance
distributed sparing
0.011992
Comparison of Sparing Alternatives for Disk Arrays · ISCA 1992
Storage systems › storage reliability
RAID
0.011992
Comparison of Sparing Alternatives for Disk Arrays · ISCA 1992
Storage systems › disk array
degraded mode operation
0.011992
Comparison of Sparing Alternatives for Disk Arrays · ISCA 1992
Storage systems › disk array
disk array performance
0.011992
Comparison of Sparing Alternatives for Disk Arrays · ISCA 1992

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

trace-driven simulation · 0.0
YearPublicationVenuePosition
1992 Performance of Disk Arrays in Transaction Processing Environments
abstract
Analytical models for evaluating the performance of arrayed disk subsystems in normal, degraded, and rebuild mode are developed. Models for estimating rebuild time under the assumption that user requests get priority and can preempt rebuild activity are also developed. It is found that uncached disk arrays perform much worse than uncached nonarrays. It is determined that caches are necessary in arrayed subsystems. Furthermore, in degraded and rebuild modes, large building blocks minimize the worst response time seen by any user, whereas small building blocks minimize the average response time.>
Jai Menon 0001, Dick Mattson
ICDCS2
1992 Comparison of Sparing Alternatives for Disk Arrays
abstract
This paper explores how choice of sparing methods impacts the performance of RAID level 5 (or parity striped) disk arrays. The three sparing methods examined are dedicated sparing, distributed sparing, and parity sparing. For database type workloads with random single block reads and writes, array performance is compared in four different modes - normal mode (no disks have failed), degraded mode (a disk has failed and its data has not been reconstructed), rebuild mode (a disk has failed and its data is being reconstructed), and copyback mode(which is needed for distributed sparing and parity sparing when failed disks are replaced with new disks). Attention is concentrated on small disk subsystems (fewer than 32 disks) where choice of sparing method has significant impact on array performance, rather than large disk subsystems (64 or more disks). It is concluded that, for disk subsystems with a small number of disks, distributed sparing offers major advantages over dedicated sparing in normal, degraded and rebuild modes of operation, even if one has to pay a copyback penalty. Furthermore, it is better than parity sparing in rebuild mode and similar to it in other operating modes, making it the sparing method of choice.
Jai Menon 0001, Dick Mattson
ISCA2