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

Kubra Eris

dblp:312/6846 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2023
0000-0003-4325-7060ORCID · 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 · 50% Processor architecture and microarchitecture · 38% Performance modeling and evaluation · 12%

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

TopicWeightPapersLastEvidence papers
Memory systems › cache
prefetching
0.712023
Puppeteer: A Random Forest Based Manager for Hardware Prefetchers Across the Memory Hierarchy · ACM Trans. Archit. Code Optim. 2023
Processor architecture and microarchitecture › multithreading
simultaneous multithreading
0.712023
Puppeteer: A Random Forest Based Manager for Hardware Prefetchers Across the Memory Hierarchy · ACM Trans. Archit. Code Optim. 2023
Memory systems › memory hierarchy
memory hierarchy performance
0.212023
Puppeteer: A Random Forest Based Manager for Hardware Prefetchers Across the Memory Hierarchy · ACM Trans. Archit. Code Optim. 2023
Performance modeling and evaluation
workload characterization
0.212023
Puppeteer: A Random Forest Based Manager for Hardware Prefetchers Across the Memory Hierarchy · ACM Trans. Archit. Code Optim. 2023

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

random forest regression · 0.7
YearPublicationVenuePosition
2023 Puppeteer: A Random Forest Based Manager for Hardware Prefetchers Across the Memory Hierarchy
abstract
Over the years, processor throughput has steadily increased. However, the memory throughput has not increased at the same rate, which has led to the memory wall problem in turn increasing the gap between effective and theoretical peak processor performance. To cope with this, there has been an abundance of work in the area of data/instruction prefetcher designs. Broadly, prefetchers predict future data/instruction address accesses and proactively fetch data/instructions in the memory hierarchy with the goal of lowering data/instruction access latency. To this end, one or more prefetchers are deployed at each level of the memory hierarchy, but typically, each prefetcher gets designed in isolation without comprehensively accounting for other prefetchers in the system. As a result, individual prefetchers do not always complement each other, and that leads to lower average performance gains and/or many negative outliers. In this work, we propose Puppeteer, which is a hardware prefetcher manager that uses a suite of random forest regressors to determine at runtime which prefetcher should be ON at each level in the memory hierarchy, such that the prefetchers complement each other and we reduce the data/instruction access latency. Compared to a design with no prefetchers, using Puppeteer we improve IPC by 46.0% in 1 one-core, 25.8% in four-core, and 11.9% in eight-core processors on average across traces generated from SPEC2017, SPEC2006, and Cloud suites with ~11-KB overhead. Moreover, we also reduce the number of negative outliers by more than 89%, and the performance loss of the worst-case negative outlier from 25% to only 5% compared to the state of the art.
Furkan Eris, Marcia S. Louis, Kubra Eris, José L. Abellán, Ajay Joshi
ACM Trans. Archit. Code Optim.3