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

Masoume Zabihi

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

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

Security and privacy · 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
Hardware reliability and fault tolerance · 91% Memory systems · 9%

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

TopicWeightPapersLastEvidence papers
Hardware reliability and fault tolerance › memory reliability
cache reliability
0.412019
RAW-Tag: Replicating in Altered Cache Ways for Correcting Multiple-Bit Errors in Tag Array · IEEE Trans. Dependable Secur. Comput. 2019
Hardware reliability and fault tolerance › error correction
multi-bit error correction
0.412019
RAW-Tag: Replicating in Altered Cache Ways for Correcting Multiple-Bit Errors in Tag Array · IEEE Trans. Dependable Secur. Comput. 2019
Hardware reliability and fault tolerance
soft errors
0.412019
RAW-Tag: Replicating in Altered Cache Ways for Correcting Multiple-Bit Errors in Tag Array · IEEE Trans. Dependable Secur. Comput. 2019
Memory systems › cache management
cache replacement
0.112019
RAW-Tag: Replicating in Altered Cache Ways for Correcting Multiple-Bit Errors in Tag Array · IEEE Trans. Dependable Secur. Comput. 2019

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

simulation · 0.4replication · 0.4parity check · 0.4
YearPublicationVenuePosition
2019 RAW-Tag: Replicating in Altered Cache Ways for Correcting Multiple-Bit Errors in Tag Array
abstract
Tag array in on-chip caches is one of the most vulnerable components to radiation-induced soft errors. Protecting the tag array in some processors is limited to error detection using the parity check, since the overheads of error correcting codes are not affordable in this component. State-of-the-art tag protection schemes combine the parity check with replication to provide error correction capability. Classifying these replication-based schemes into partial-replication and full-replication, the former offers a low overhead protection in which a large fraction of detectable errors remain uncorrectable, whereas the latter imposes a significant overhead to correct all of the errors. This paper proposes a low overhead full-replication scheme, so called Replicating in Altered Ways of Tag (RAW-Tag), to correct all detectable errors. RAW-Tag manipulates the cache replacement algorithm and keeps track of the incoming/evicting cache lines to not only provide a replica for all tags, but also eliminate the simultaneous susceptibility of both a tag and its replica to a single Multiple-Bit Upset (MBU). The simulation results show that RAW-Tag imposes no performance overhead and increases the energy consumption of L1 and L2 caches by only 6.6 and 0.3 percent, respectively, as compared with the baseline.
Hamed Farbeh, Fereshte Mozafari, Masoume Zabihi, Seyed Ghassem Miremadi
IEEE Trans. Dependable Secur. Comput.3