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

Tarun Nakra

dblp:10/2746 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 2020
—ORCID · none

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

Systems, architecture and hardware · 3 · 2 first-authorSoftware engineering, systems software and programming languages · 2 · 1 first-author

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
3 papers
Processor architecture and microarchitecture · 78% Memory systems · 22%
Software engineering, system software, and programming languages
1 paper
Compilers and program optimization · 100%

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

TopicWeightPapersLastEvidence papers
Processor architecture and microarchitecture
branch prediction
0.412020
Evolution of the Samsung Exynos CPU Microarchitecture · ISCA 2020
Memory systems
memory latency reduction
0.412020
Evolution of the Samsung Exynos CPU Microarchitecture · ISCA 2020
Processor architecture and microarchitecture › front-end
micro-op cache
0.412020
Evolution of the Samsung Exynos CPU Microarchitecture · ISCA 2020
Processor architecture and microarchitecture › branch prediction
neural branch prediction
0.412020
Evolution of the Samsung Exynos CPU Microarchitecture · ISCA 2020
Processor architecture and microarchitecture › speculative execution
speculative execution security
0.112020
Evolution of the Samsung Exynos CPU Microarchitecture · ISCA 2020
Processor architecture and microarchitecture
value prediction
0.021999
Value Prediction in VLIW Machines · ISCA 1999
Global Context-Based Value Prediction · HPCA 1999
Processor architecture and microarchitecture › instruction-level parallelism
VLIW
0.011999
Value Prediction in VLIW Machines · ISCA 1999
Compilers and program optimization › instruction scheduling
instruction-level parallelism
0.011999
Value Prediction in VLIW Machines · ISCA 1999
Compilers and program optimization
instruction scheduling
0.011999
Value Prediction in VLIW Machines · ISCA 1999
Processor architecture and microarchitecture
data dependence
0.011999
Global Context-Based Value Prediction · HPCA 1999
Processor architecture and microarchitecture
instruction-level parallelism
0.011999
Global Context-Based Value Prediction · HPCA 1999

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

compiler infrastructure · 0.0
YearPublicationVenuePosition
2020 Evolution of the Samsung Exynos CPU Microarchitecture
abstract
The Samsung Exynos family of cores are highperformance “big” processors developed at the Samsung Austin Research & Design Center (SARC) starting in late 2011. This paper discusses selected aspects of the microarchitecture of these cores - specifically perceptron-based branch prediction, Spectre v2 security enhancements, micro-operation cache algorithms, prefetcher advancements, and memory latency optimizations. Each micro-architecture item evolved over time, both as part of continuous yearly improvement, and in reaction to changing mobile workloads.
Brian Grayson, Jeff Rupley, Gerald D. Zuraski, Eric Quinnell, Daniel A. Jiménez, Tarun Nakra, Paul Kitchin, Ryan Hensley, Edward Brekelbaum, Vikas Sinha, Ankit Ghiya
ISCA6
1999 Global Context-Based Value Prediction
abstract
Various methods for value prediction have been proposed to overcome the limits imposed by data dependencies within programs. Using a value prediction scheme, an instruction's computed value is predicted during the fetch stage and forwarded to all dependent instructions to speed up execution. Value prediction schemes have been based on a local context by predicting values using the values generated by the same instruction. This paper presents techniques that predict values of an instruction based on a global context where the behavior of other instructions is used in prediction. The global context includes the path along which an instruction is executed and the values computed by other previously completed instructions. We present techniques that augment conventional last value and stride predictors with global context information. Experiments performed using path-based techniques with realistic table sizes resulted in an increase in prediction of 6.4-8.4% over the current prediction schemes. Prediction using values computed by other instructions resulted in a further improvement of 7.2% prediction accuracy over the best path-based predictor.
Tarun Nakra, Rajiv Gupta 0001, Mary Lou Soffa
HPCA1
1999 Value Prediction in VLIW Machines
abstract
The performance of VLIW architectures is dependent on the capability of the compiler to detect and exploit instruction-level parallelism during instruction scheduling. To exploit the detected parallelism, instructions are reordered to reduce the length of the code schedule and minimize the cycle count for execution. Code reordering is limited by the dependencies among instructions arising from both control flow and data flow. In this paper, we present the design of a VLIW architecture that uses value prediction to remove data dependencies and improve the instruction schedule. Our architecture consists of two execution engines, one for executing the original VLIW code, and the other for executing compensation code after a misprediction. Any code executed due to mispredictions is executed in parallel with the VLIW instructions. The instruction set and hardware of a traditional VLIW machine are modified accordingly to support this type of concurrent execution. The efficacy of the proposed architecture is demonstrated by implementing the prediction model in the Trimaran compiler infrastructure and studying the speedups that result due to the parallel execution of compensation code.
Tarun Nakra, Rajiv Gupta 0001, Mary Lou Soffa
ISCA1