Seyed Armin Vakil-Ghahani

dblp:216/7346 · also Armin Vakil-Ghahani · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
2since 2021 · last 2024
0000-0002-4365-8932ORCID · verified

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

Systems, architecture and hardware · 3 · 1 first-author · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 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
1 paper
Memory systems · 83% Storage systems · 17%
Software engineering, system software, and programming languages
1 paper
Requirements engineering and software design · 100%

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

TopicWeightPapersLastEvidence papers
Requirements engineering and software design
formal specification
0.812024
IronSpec: Increasing the Reliability of Formal Specifications · OSDI 2024
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
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

fence-less ordering · 0.4
YearPublicationVenuePosition
2024 IronSpec: Increasing the Reliability of Formal Specifications
Eli Goldweber, Weixin Yu, Seyed Armin Vakil-Ghahani, Manos Kapritsos
OSDI3
2022 Athena: An Early-Fetch Architecture to Reduce on-Chip Page Walk Latencies
abstract
Large-scale applications from various domains are becoming increasingly irregular, posing significant strains on virtual memory performance. On the other hand, increasing hardware SRAM structures like TLB is becoming challenging due to technology scaling constraints imposed by the limitations of Moore's law. This emerging trend in applications, coupled with the lack of technology scaling in hardware, requires innovations at the hardware level to avoid expensive memory accesses for traversing page tables to keep page walk latencies in check.
Seyed Armin Vakil-Ghahani, Soheil Khadirsharbiyani, Jagadish Kotra, Mahmut T. Kandemir
PACT1
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
MICRO2
2019 Reducing Writebacks Through In-Cache Displacement
abstract
Non-Volatile Memory (NVM) technology is a promising solution to fulfill the ever-growing need for higher capacity in the main memory of modern systems. Despite having many great features, however, NVM’s poor write performance remains a severe obstacle, preventing it from being used as a DRAM alternative in the main memory. Most of the prior work targeted optimizing writes at the main memory side and neglected the decisive role of upper-level cache management policies on reducing the number of writes. In this article, we propose a novel cache management policy that attempts to maximize write-coalescing in the on-chip SRAM last-level cache (LLC) for the sake of reducing the number of costly writes to the off-chip NVM. We decouple a few physical ways of the LLC to have a dedicated and exclusive storage for the dirty blocks after being evicted from the cache and before being sent to the off-chip memory. By displacing dirty blocks in exclusive storage, they are kept in the cache based on their rewrite distance and are evicted when they are unlikely to be reused shortly. To maximize the effectiveness of exclusive storage, we manage it as a Cuckoo Cache to offer associativity based on the various applications’ demands. Through detailed evaluations targeting various single- and multi-threaded applications, we show that our proposal reduces the number of writebacks by 21%, on average, over the state-of-the-art method and enhances both performance and energy efficiency.
Mohammad Bakhshalipour, Aydin Faraji, Seyed Armin Vakil-Ghahani, Farid Samandi, Pejman Lotfi-Kamran, Hamid Sarbazi-Azad
ACM Trans. Design Autom. Electr. Syst.3