Demo Data from EDBT 2026 / reviewers in the wild / expert
Amna Shahab
dblp:232/0124
· DBLP profile ↗
3ranked-venue papers
1as first author
2since 2021 · last 2021
0000-0001-9896-1763ORCID · corroborated
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 · 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
2 papers |
Memory systems · 71% Cloud and datacenter computing · 29% |
Topics — the 8 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Memory systems › memory management › virtual memory
address translation |
0.5 | 1 | 2021 | PTEMagnet: fine-grained physical memory reservation for faster page walks in public clouds · ASPLOS 2021 |
Cloud and datacenter computing › virtualization
nested paging |
0.5 | 1 | 2021 | PTEMagnet: fine-grained physical memory reservation for faster page walks in public clouds · ASPLOS 2021 |
Memory systems › memory management › virtual memory
page table walk |
0.5 | 1 | 2021 | PTEMagnet: fine-grained physical memory reservation for faster page walks in public clouds · ASPLOS 2021 |
Cloud and datacenter computing
virtualization |
0.5 | 1 | 2021 | PTEMagnet: fine-grained physical memory reservation for faster page walks in public clouds · ASPLOS 2021 |
Memory systems › memory management
virtual memory |
0.5 | 1 | 2021 | PTEMagnet: fine-grained physical memory reservation for faster page walks in public clouds · ASPLOS 2021 |
Memory systems
cache design |
0.3 | 1 | 2018 | Farewell My Shared LLC! A Case for Private Die-Stacked DRAM Caches for Servers · MICRO 2018 |
Memory systems › cache › DRAM cache
die-stacked DRAM cache |
0.3 | 1 | 2018 | Farewell My Shared LLC! A Case for Private Die-Stacked DRAM Caches for Servers · MICRO 2018 |
Memory systems › memory hierarchy › cache hierarchy
last-level cache |
0.3 | 1 | 2018 | Farewell My Shared LLC! A Case for Private Die-Stacked DRAM Caches for Servers · MICRO 2018 |
Methods — techniques the papers use, named apart from their topics
memory fragmentation analysis · 0.5die-stacking · 0.3DRAM latency engineering · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2021 | Invalidate or Update? Revisiting Coherence for Tomorrow's Cache HierarchiesabstractShared on-chip last-level caches (LLCs) play a key role in capturing the large working sets of today's data-intensive workloads. However, they pose a fundamental scalability challenge in the transistor-limited post-Moore regime. Recent work has argued for Next-Generation LLCs (NG-LLC) based on private caches in die-stacked DRAM, which can provide hundreds of MBs of per-core LLC capacity at similar access latency to today's shared LLCs. While NG-LLCs offer a number of advantages, their private design exposes long-latency inter-core reads for read/write shared data, which hurt performance in parallel workloads. One way to eliminate the long latency of reads to read/write shared data is through the use of updating coherence protocols that eagerly push updates from a writer core into caches of recent readers. Alas, these protocols are known to generate excess cache and interconnect traffic that can be detrimental to overall performance. While hybrid protocols that try to alleviate the problem by combining invalidating and updating protocols have been proposed, we find their performance benefit to be small for NG-LLCs. This work observes that the number of writes to a read/write shared cache block is likely to be stable over several consecutive write/read iterations. Based on this insight, we propose the 1-Update protocol that records the number of writes without an intervening read by a sharer, and subsequently uses the recorded value to send at most one update after that number of writes has taken place. We have formally verified 1-Update and show that it achieves high efficacy in covering remote misses for read/write shared cache blocks while minimizing excess cache and interconnect traffic. Mingcan Zhu, Amna Shahab, Antonios Katsarakis, Boris Grot |
PACT | 2 |
| 2021 | PTEMagnet: fine-grained physical memory reservation for faster page walks in public cloudsabstractThe last few years have seen a rapid adoption of cloud computing for data-intensive tasks. In the cloud environment, it is common for applications to run under virtualization and to share a virtual machine with other applications (e.g., in a virtual private cloud setup). In this setting, our work identifies a new address translation bottleneck caused by memory fragmentation stemming from the interaction of virtualization, colocation, and the Linux memory allocator. The fragmentation results in the effective cache footprint of the host PT being larger than that of the guest PT. The bloated footprint of the host PT leads to frequent cache misses during nested page walks, increasing page walk latency. Artemiy Margaritov, Dmitrii Ustiugov, Amna Shahab, Boris Grot |
ASPLOS | 3 |
| 2018 | Farewell My Shared LLC! A Case for Private Die-Stacked DRAM Caches for ServersabstractThe slowdown in technology scaling mandates rethinking of conventional CPU architectures in a quest for higher performance and new capabilities. This work takes a step in this direction by questioning the value of on-chip shared last-level caches (LLCs) in server processors and argues for a better alternative. Shared LLCs have a number of limitations, including on-chip area constraints that limit storage capacity, long planar interconnect spans that increase access latency, and contention for the shared cache capacity that hurts performance under workload colocation. To overcome these limitations, we propose a Die-Stacked Private LLC Organization (SILO), which combines conventional on-chip private L1 (and optionally, L2) caches with a per-core private LLC in die-stacked DRAM. By stacking LLC slices directly above each core, SILO avoids long planar wire spans. The use of private caches inherently avoids inter-core cache contention. Last but not the least, engineering the DRAM for latency affords low access delays while still providing over 100MB of capacity per core in today's technology. Evaluation results show that SILO outperforms state-of-the-art conventional cache architectures on a range of scale-out and traditional workloads while delivering strong performance isolation under colocation. Amna Shahab, Mingcan Zhu, Artemiy Margaritov, Boris Grot |
MICRO | 1 |