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.

Shenghui Zhan

dblp:74/8380 · DBLP profile ↗
← Back
2ranked-venue papers
0as 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 · 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
Storage systems · 38% Memory systems · 38% Distributed systems · 19%

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

TopicWeightPapersLastEvidence papers
Memory systems
cache management
0.112011
Victim Disk First: An Asymmetric Cache to Boost the Performance of Disk Arrays under Faulty Conditions · USENIX ATC 2011
Storage systems
disk array
0.112011
Victim Disk First: An Asymmetric Cache to Boost the Performance of Disk Arrays under Faulty Conditions · USENIX ATC 2011
Distributed systems
fault tolerance
0.112011
Victim Disk First: An Asymmetric Cache to Boost the Performance of Disk Arrays under Faulty Conditions · USENIX ATC 2011
Memory systems › cache design
heterogeneous cache
0.112011
Victim Disk First: An Asymmetric Cache to Boost the Performance of Disk Arrays under Faulty Conditions · USENIX ATC 2011
Storage systems › storage reliability
RAID
0.112011
Victim Disk First: An Asymmetric Cache to Boost the Performance of Disk Arrays under Faulty Conditions · USENIX ATC 2011
Hardware reliability and fault tolerance › reliability analysis
disk array reliability
0.012011
Victim Disk First: An Asymmetric Cache to Boost the Performance of Disk Arrays under Faulty Conditions · USENIX ATC 2011
YearPublicationVenuePosition
2011 Victim Disk First: An Asymmetric Cache to Boost the Performance of Disk Arrays under Faulty Conditions
Shenggang Wan, Qiang Cao 0001, Jianzhong Huang 0001, Shenghui Zhan, Changsheng Xie 0001, Xubin He
USENIX ATC6
2010 An Evaluation of Two Typical RAID-6 Codes on Online Single Disk Failure Recovery
abstract
Redundant Arrays of Independent Disks RAID is a popular storage architecture with high performance and reliability. RAID-6 with a higher level of reliability based on MDS (Maximum Distance Separable) code is well studied, for its optimal storage efficiency. RAID-6 could offer continuous services in degraded mode, during the period of online failure recovery. However, the online recovery would bring a considerable I/O workflow to the storage system, that almost all the surviving data in the system need to be accessed. Due to the limitation of disk bandwidth, user response time would be significantly affected by the recovery workflow. In this paper, we examine the online recovery performance of two typical MDS RAID-6 codes RDP code and P-code. To our observation, P-code significiantly outperforms RDP in user response time and recovery duration during a single disk failure recovery. To our analysis, the difference comes from not only the parity layout but also the parity organization. Therefore, we propose a new categorization for existing MDS RAID-6 codes, based on the methodology of parity organization. By our approach, all the MDS RAID-6 codes could be categorized to Sym-codes with only one type of parity, and Asym-codes with at least two different types of parity.
Qiang Cao 0001, Shenggang Wan, Chentao Wu, Shenghui Zhan
NAS4