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

Daniel Carlson

dblp:354/5462 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2023
0009-0009-0199-5293ORCID · reported

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

Systems, architecture and hardware · 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 · 100%

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

TopicWeightPapersLastEvidence papers
Memory systems › tiered memory
dynamic tiering
0.712023
Allocation Policies Matter for Hybrid Memory Systems · HPDC 2023
Memory systems
hybrid memory
0.712023
Allocation Policies Matter for Hybrid Memory Systems · HPDC 2023
Memory systems
non-volatile memory
0.712023
Allocation Policies Matter for Hybrid Memory Systems · HPDC 2023
Memory systems › non-volatile memory
persistent memory
0.712023
Allocation Policies Matter for Hybrid Memory Systems · HPDC 2023
Memory systems
tiered memory
0.712023
Allocation Policies Matter for Hybrid Memory Systems · HPDC 2023
Memory systems
DRAM
0.212023
Allocation Policies Matter for Hybrid Memory Systems · HPDC 2023
Memory systems › memory management › memory allocation
page allocation
0.212023
Allocation Policies Matter for Hybrid Memory Systems · HPDC 2023

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

page allocation policies · 0.7
YearPublicationVenuePosition
2023 Allocation Policies Matter for Hybrid Memory Systems
abstract
Existing tiered memory systems all use DRAM-Preferred as their allocation policy, whereby pages get allocated from higher-performing DRAM until it is filled, after which all future allocations are made from lower-performing persistent memory (PM). The novel insight of this work is that the right page allocation policy for a workload can help to lower the access latencies for the newly allocated pages. We design, implement, and evaluate three page allocation policies within the real system deployment of the state-of-the-art dynamic tiering system. We observe that the right page allocation policy can improve the performance of a tiered memory system by as much as 17x for certain workloads.
Adnan Maruf, Daniel Carlson, Ashikee Ghosh, Manoj Pravakar Saha, Janki Bhimani, Raju Rangaswami
HPDC2