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

K. K. Rao

dblp:85/1083 · DBLP profile ↗
← Back
6ranked-venue papers
2as first author
0since 2021 · last 2011
—ORCID · none

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

Systems, architecture and hardware · 4 · 1 first-authorSecurity and privacy · 3 · 2 first-authorArtificial intelligence and machine learning · 1Databases, data management, data science and information retrieval · 1Graphics, computer vision, multimedia, augmented reality and games · 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
3 papers
Storage systems · 82% Hardware reliability and fault tolerance · 14% Distributed systems · 4%
Theoretical computer science
2 papers
Coding theory · 100%

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

TopicWeightPapersLastEvidence papers
Storage systems
storage reliability
0.332011
Reliability for Networked Storage Nodes · IEEE Trans. Dependable Secur. Comput. 2011
A new intra-disk redundancy scheme for high-reliability RAID storage systems in the presence of unrecoverable errors · ACM Trans. Storage 2008
Matrix Methods for Lost Data Reconstruction in Erasure Codes · FAST 2005
Storage systems
distributed storage
0.112011
Reliability for Networked Storage Nodes · IEEE Trans. Dependable Secur. Comput. 2011
Storage systems
networked storage
0.112011
Reliability for Networked Storage Nodes · IEEE Trans. Dependable Secur. Comput. 2011
Hardware reliability and fault tolerance
reliability modeling
0.112011
Reliability for Networked Storage Nodes · IEEE Trans. Dependable Secur. Comput. 2011
Storage systems › data redundancy
intra-disk redundancy
0.112008
A new intra-disk redundancy scheme for high-reliability RAID storage systems in the presence of unrecoverable errors · ACM Trans. Storage 2008
Storage systems › storage reliability
RAID
0.112008
A new intra-disk redundancy scheme for high-reliability RAID storage systems in the presence of unrecoverable errors · ACM Trans. Storage 2008
Storage systems › storage reliability
erasure coding
0.112005
Matrix Methods for Lost Data Reconstruction in Erasure Codes · FAST 2005
Distributed systems
fault tolerance
0.012011
Reliability for Networked Storage Nodes · IEEE Trans. Dependable Secur. Comput. 2011
Coding theory › error-correcting codes › block codes › linear code
parity-check codes
0.012008
A new intra-disk redundancy scheme for high-reliability RAID storage systems in the presence of unrecoverable errors · ACM Trans. Storage 2008
Coding theory › error-correcting codes
erasure coding
0.012005
Matrix Methods for Lost Data Reconstruction in Erasure Codes · FAST 2005

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

reed-solomon codes · 0.2event-driven simulation · 0.2analytical modeling · 0.2sensitivity analysis · 0.1reliability modeling · 0.1matrix methods · 0.1
YearPublicationVenuePosition
2011 Reliability for Networked Storage Nodes
abstract
High-end enterprise storage has traditionally consisted of monolithic systems with customized hardware, multiple redundant components and paths, and no single point of failure. Distributed storage systems realized through networked storage nodes offer several advantages over monolithic systems such as lower cost and increased scalability. In order to achieve reliability goals associated with enterprise-class storage systems, redundancy will have to be distributed across the collection of nodes to tolerate both node and drive failures. In this paper, we present alternatives for distributing this redundancy, and models to determine the reliability of such systems. We specify a reliability target and determine the configurations that meet this target. Further, we perform sensitivity analyses, where selected parameters are varied to observe their effect on reliability.
K. K. Rao, James Lee Hafner, Richard A. Golding
IEEE Trans. Dependable Secur. Comput.1
2009 Evaluating the impact of Undetected Disk Errors in RAID systems
abstract
Despite the reliability of modern disks, recent studies have made it clear that a new class of faults, UndetectedDisk Errors (UDEs) also known as silent data corruption events, become a real challenge as storage capacity scales. While RAID systems have proven effective in protecting data from traditional disk failures, silent data corruption events remain a significant problem unaddressed by RAID. We present a fault model for UDEs, and a hybrid framework for simulating UDEs in large-scale systems. The framework combines a multi-resolution discrete event simulator with numerical solvers. Our implementation enables us to model arbitrary storage systems and workloads and estimate the rate of undetected data corruptions. We present results for several systems and workloads, from gigascale to petascale. These results indicate that corruption from UDEs is a significant problem in the absence of protection schemes and that such schemes dramatically decrease the rate of undetected data corruption.
Eric William Davis, Wendy Belluomini, Veera Deenadhayalan, James Lee Hafner, K. K. Rao, Pin Zhou
DSN5
2008 A new intra-disk redundancy scheme for high-reliability RAID storage systems in the presence of unrecoverable errors
abstract
Today's data storage systems are increasingly adopting low-cost disk drives that have higher capacity but lower reliability, leading to more frequent rebuilds and to a higher risk of unrecoverable media errors. We propose an efficient intradisk redundancy scheme to enhance the reliability of RAID systems. This scheme introduces an additional level of redundancy inside each disk, on top of the RAID redundancy across multiple disks. The RAID parity provides protection against disk failures, whereas the proposed scheme aims to protect against media-related unrecoverable errors. In particular, we consider an intradisk redundancy architecture that is based on an interleaved parity-check coding scheme, which incurs only negligible I/O performance degradation. A comparison between this coding scheme and schemes based on traditional Reed--Solomon codes and single-parity-check codes is conducted by analytical means. A new model is developed to capture the effect of correlated unrecoverable sector errors. The probability of an unrecoverable failure associated with these schemes is derived for the new correlated model, as well as for the simpler independent error model. We also derive closed-form expressions for the mean time to data loss of RAID-5 and RAID-6 systems in the presence of unrecoverable errors and disk failures. We then combine these results to characterize the reliability of RAID systems that incorporate the intradisk redundancy scheme. Our results show that in the practical case of correlated errors, the interleaved parity-check scheme provides the same reliability as the optimum, albeit more complex, Reed--Solomon coding scheme. Finally, the I/O and throughput performances are evaluated by means of analysis and event-driven simulation.
Ajay Dholakia, Evangelos Eleftheriou, Xiao-Yu Hu, Ilias Iliadis, Jai Menon 0001, K. K. Rao
ACM Trans. Storage6
2006 Reliability for Networked Storage Nodes
abstract
High-end enterprise storage has traditionally consisted of monolithic systems with customized hardware, multiple redundant components and paths, and no single point of failure. Distributed storage systems realized through networked storage nodes offer several advantages over monolithic systems such as lower cost and increased scalability. In order to achieve reliability goals associated with enterprise-class storage systems, redundancy has to be distributed across the collection of nodes to tolerate both node and drive failures. In this paper, we present alternatives for distributing this redundancy, and models to determine the reliability of such systems. We specify a reliability target and determine the configurations that meet this target. Further, we perform sensitivity analyses where selected parameters are varied to observe their effect on reliability
K. K. Rao, James Lee Hafner, Richard A. Golding
DSN1
2005 Matrix Methods for Lost Data Reconstruction in Erasure Codes
James Lee Hafner, Veera Deenadhayalan, K. K. Rao, John A. Tomlin
FAST3
1994 Detection of linear features in satellite imagery using robust estimation
abstract
The paper presents a method for detecting linear features in a satellite image. For enhancing these features, a local operation based algorithm is proposed which uses a certain multiplicative score rather than the commonly used additive score. The main contribution is in segmenting the linear features in the enhanced image where an adaptive segmentation technique is proposed on the basis of statistical models. A robust parameter estimation is done for this purpose.
Amar Mukherjee, Swapan K. Parui, Bidyut B. Chaudhuri, K. K. Rao
ICPR (1)5