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

Weimin Zhen

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

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

Systems, architecture and hardware · 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
Memory systems · 57% Hardware reliability and fault tolerance · 38% Storage systems · 6%

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

TopicWeightPapersLastEvidence papers
Hardware reliability and fault tolerance
memory fault tolerance
0.212013
Aegis: partitioning data block for efficient recovery of stuck-at-faults in phase change memory · MICRO 2013
Memory systems
non-volatile memory
0.212013
Aegis: partitioning data block for efficient recovery of stuck-at-faults in phase change memory · MICRO 2013
Memory systems › non-volatile memory
phase change memory
0.212013
Aegis: partitioning data block for efficient recovery of stuck-at-faults in phase change memory · MICRO 2013
Hardware reliability and fault tolerance › memory reliability
stuck-at fault recovery
0.212013
Aegis: partitioning data block for efficient recovery of stuck-at-faults in phase change memory · MICRO 2013
Memory systems › non-volatile memory › write reliability
write endurance
0.212013
Aegis: partitioning data block for efficient recovery of stuck-at-faults in phase change memory · MICRO 2013
Storage systems
storage reliability
0.012013
Aegis: partitioning data block for efficient recovery of stuck-at-faults in phase change memory · MICRO 2013

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

data block partitioning · 0.2bit inversion · 0.2
YearPublicationVenuePosition
2013 Aegis: partitioning data block for efficient recovery of stuck-at-faults in phase change memory
abstract
While Phase Change Memory (PCM) holds a great promise as a complement or even replacement of DRAM-based memory and flash-based storage, it must effectively overcome its limit on write endurance to be a reliable device for an extended period of intensive use. The limited write endurance can lead to permanent stuck-at faults after a certain number of writes, which causes some memory cells permanently stuck at either '0' or '1'. State-of-the-art solutions apply a bit inversion technique on selected bit groups of a data block after its partitioning. The effectiveness of this approach hinges on how a data block is partitioned into bit groups. While all existing solutions can separate faults into different groups for error correction, they are inadequate on three fundamental capabilities desired for any partition scheme. First, it can maximize probability of successfully re-partitioning a block so that two faults currently in the same group are placed into two new groups. Second, it can partition a block into a small number of groups for space efficiency. Third, it should spread out faults across the groups as uniformly as possible, so that more faults can be accommodated within the same number of groups. A recovery solution with these capabilities can provide strong fault tolerance with minimal overhead.
Jie Fan 0004, Song Jiang 0001, Jiwu Shu, Youhui Zhang, Weimin Zhen
MICRO5