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

Raguram Damodaran

dblp:23/5273 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2017
—ORCID · none

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

Systems, architecture and hardware · 1

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
Processor architecture and microarchitecture · 87% Memory systems · 13%

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

TopicWeightPapersLastEvidence papers
Processor architecture and microarchitecture › value prediction
load value prediction
0.312017
Load value prediction via path-based address prediction: avoiding mispredictions due to conflicting stores · MICRO 2017
Processor architecture and microarchitecture
value prediction
0.312017
Load value prediction via path-based address prediction: avoiding mispredictions due to conflicting stores · MICRO 2017
Memory systems
cache
0.112017
Load value prediction via path-based address prediction: avoiding mispredictions due to conflicting stores · MICRO 2017

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

pipeline flush reduction · 0.3confidence estimation · 0.3
YearPublicationVenuePosition
2017 Load value prediction via path-based address prediction: avoiding mispredictions due to conflicting stores
abstract
Current flagship processors excel at extracting instruction-level-parallelism (ILP) by forming large instruction windows. Even then, extracting ILP is inherently limited by true data dependencies. Value prediction was proposed to address this limitation. Many challenges face value prediction, in this work we focus on two of them. Challenge #1: store instructions change the values in memory, rendering the values in the value predictor stale, and resulting in value mispredictions and a retraining penalty. Challenge #2: value mispredictions trigger costly pipeline flushes. To minimize the number of pipeline flushes, value predictors employ stringent, yet necessary, high confidence requirements to guarantee high prediction accuracy. Such requirements can negatively impact training time and coverage.
Rami Sheikh, Harold W. Cain, Raguram Damodaran
MICRO3