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.

Sara Mahdizadeh-Shahri

dblp:216/7097 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
2since 2021 · last 2022
—ORCID · none

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

Systems, architecture and hardware · 3 · 1 first-author · 2 since 2021Software engineering, systems software and programming languages · 2 · 2 since 2021

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
2 papers
Processor architecture and microarchitecture · 55% Memory systems · 31% Storage systems · 6%

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

TopicWeightPapersLastEvidence papers
Processor architecture and microarchitecture
branch prediction
0.612022
Thermometer: profile-guided btb replacement for data center applications · ISCA 2022
Processor architecture and microarchitecture › branch prediction
branch target buffer
0.612022
Thermometer: profile-guided btb replacement for data center applications · ISCA 2022
Processor architecture and microarchitecture › instruction fetch › instruction prefetching
fetch directed instruction prefetching
0.612022
Thermometer: profile-guided btb replacement for data center applications · ISCA 2022
Processor architecture and microarchitecture
front-end
0.612022
Thermometer: profile-guided btb replacement for data center applications · ISCA 2022
Memory systems › non-volatile memory
memory persistency model
0.412020
(Almost) Fence-less Persist Ordering · MICRO 2020
Memory systems › non-volatile memory
persistent memory
0.412020
(Almost) Fence-less Persist Ordering · MICRO 2020
Memory systems › non-volatile memory
persist ordering
0.412020
(Almost) Fence-less Persist Ordering · MICRO 2020
Cloud and datacenter computing › datacenter workloads
datacenter applications
0.212022
Thermometer: profile-guided btb replacement for data center applications · ISCA 2022
Performance modeling and evaluation
workload characterization
0.212022
Thermometer: profile-guided btb replacement for data center applications · ISCA 2022
Storage systems
storage reliability
0.112020
(Almost) Fence-less Persist Ordering · MICRO 2020
Storage systems › logging
undo logging
0.112020
(Almost) Fence-less Persist Ordering · MICRO 2020

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

profile-guided optimization · 0.6fence-less ordering · 0.4
YearPublicationVenuePosition
2022 Achieving Crash Consistency by Employing Persistent L1 Cache
abstract
Emerging non-volatile memory technologies promise the opportunity for maintaining persistent data in memory. How-ever, providing crash-consistency in such systems can be costly as any update to the persistent data has to reach the persistent domain in a specific order, imposing high overhead. Prior works, proposed solutions both in software (SW) and hardware (HW) to address this problem but fall short to remove this overhead completely. In this work, we propose Non-Volatile Cache (NVC) architecture design that employs a hybrid volatile, non-volatile memory cell employing monolithic 3D and Ferroelectric technol-ogy in Ll data cache to guarantee crash consistency with almost no performance overhead. We show that NVC achieves up to 5.1x speedup over state-of-the-art (SOTA) SW undo logging and 11% improvement over SOTA HW solution without yielding the conventional architecture, while incurring 7% hardware overhead.
Akshay Krishna Ramanathan, Sara Mahdizadeh-Shahri, Yi Xiao 0008, Narayanan Vijaykrishnan
DATE2
2022 Thermometer: profile-guided btb replacement for data center applications
abstract
Modern processors employ a decoupled frontend with Fetch Directed Instruction Prefetching (FDIP) to avoid frontend stalls in data center applications. However, the large branch footprint of data center applications precipitates frequent Branch Target Buffer (BTB) misses that prohibit FDIP from eliminating more than 40% of all frontend stalls. We find that the state-of-the-art BTB optimization techniques (e.g., BTB prefetching and replacement mechanisms) cannot eliminate these misses due to their inadequate understanding of branch reuse behavior in data center applications.
Shixin Song, Tanvir Ahmed Khan 0001, Sara Mahdizadeh-Shahri, Akshitha Sriraman, Niranjan Soundararajan, Sreenivas Subramoney, Daniel A. Jiménez, Heiner Litz, Baris Kasikci
ISCA3
2020 (Almost) Fence-less Persist Ordering
abstract
The semantics and implementation of a memory persistency model can significantly impact the performance achieved on persistent memory systems. The only commercially available and widely used x86 persistency model causes significant performance losses by requiring redundant, expensive fence operations for commonly used undo logging programming patterns. In this work, we propose light-weight extensions to the x86 persistency model to provide some ordering guarantees without an intervening fence operation. Our extension, Themis, eliminates over 91.7% of the fence operations in undo-logging PM programs and improves average performance by 45.8% while incurring only 1.2% increase in data cache size.
Sara Mahdizadeh-Shahri, Seyed Armin Vakil-Ghahani, Aasheesh Kolli
MICRO1