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

Suhas K. Vittal

dblp:319/5248 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2026
—ORCID · none

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

Systems, architecture and hardware · 1 · 1 first-author · 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 · 93% Hardware reliability and fault tolerance · 7%

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

TopicWeightPapersLastEvidence papers
Memory systems › cache management
cache replacement
1.012026
BARD: Reducing Write Latency of DDR5 Memory by Exploiting Bank-Parallelism · HPCA 2026
Memory systems
DRAM
1.012026
BARD: Reducing Write Latency of DDR5 Memory by Exploiting Bank-Parallelism · HPCA 2026
Memory systems
memory controller
1.012026
BARD: Reducing Write Latency of DDR5 Memory by Exploiting Bank-Parallelism · HPCA 2026
Memory systems › memory controller
write scheduling
1.012026
BARD: Reducing Write Latency of DDR5 Memory by Exploiting Bank-Parallelism · HPCA 2026
Hardware reliability and fault tolerance › error-correcting codes for memory
on-die ECC
0.312026
BARD: Reducing Write Latency of DDR5 Memory by Exploiting Bank-Parallelism · HPCA 2026

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

workload trace evaluation · 1.0
YearPublicationVenuePosition
2026 BARD: Reducing Write Latency of DDR5 Memory by Exploiting Bank-Parallelism
abstract
This paper studies the impact of DRAM writes on DDR5-based system. To efficiently perform DRAM writes, modern systems buffer write requests and try to complete multiple write operations whenever the DRAM mode is switched from read to write. When the DRAM system is performing writes, it is not available to service read requests, thus increasing read latency and reducing performance. We observe that, given the presence of on-die ECC in DDR5 devices, the time to perform a write operation varies significantly: from 1x (for writes to banks of different bankgroups) to 6x (for writes to banks within the same bankgroup) to 24 x (for conflicting requests to the same bank). If we can orchestrate the write stream to favor write requests that incur lower latency, then we can reduce the stall time from DRAM writes and improve performance. However, for current systems, the write stream is dictated by the cache replacement policy, which makes eviction decisions without being aware of the variable latency of DRAM writes. The key insight of our work is to improve performance by modifying the cache replacement policy to increase bank-parallelism of DRAM writes. Our paper proposes BARD (Bank-Aware Replacement Decisions), which modifies the cache replacement policy to favor dirty lines that belong to banks without pending writes. We analyze two variants of BARD: BARD-E (Eviction-based), which changes the eviction policy to evict low-cost dirty lines, and BARD-C (Cleansing-Based), which proactively cleans low-cost dirty lines without modifying the eviction decisions. Both BARD-E and BARD-C increase bank-parallelism of DRAM writes by 30 %. As both versions of BARD have differing impact, extra misses or extra writebacks, there is no single policy that works well across all the workloads. We develop a hybrid policy (BARDH), which uses a selective combination of both eviction and writeback. Our evaluations across workloads from SPEC2017, LIGRA, STREAM, and Google server traces show that BARDH improves performance by 4.3 % on average and up-to 8.5 %. BARD requires only 8 bytes of SRAM per LLC slice.
Suhas K. Vittal, Moinuddin K. Qureshi
HPCA1