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

Fernando A. Endo

dblp:191/7821 · DBLP profile ↗
← Back
2ranked-venue papers
1as 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 · 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
2 papers
Processor architecture and microarchitecture · 100%
Software engineering, system software, and programming languages
1 paper
Compilers and program optimization · 100%

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

TopicWeightPapersLastEvidence papers
Processor architecture and microarchitecture
value prediction
0.522017
On the Interactions Between Value Prediction and Compiler Optimizations in the Context of EOLE · ACM Trans. Archit. Code Optim. 2017
Register sharing for equality prediction · MICRO 2016
Processor architecture and microarchitecture › out-of-order execution
register renaming
0.212016
Register sharing for equality prediction · MICRO 2016
Processor architecture and microarchitecture › speculative execution
speculative memory bypassing
0.212016
Register sharing for equality prediction · MICRO 2016
Processor architecture and microarchitecture
instruction-level parallelism
0.112017
On the Interactions Between Value Prediction and Compiler Optimizations in the Context of EOLE · ACM Trans. Archit. Code Optim. 2017

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

EOLE · 0.6D-VTAGE · 0.6simulation · 0.2
YearPublicationVenuePosition
2017 On the Interactions Between Value Prediction and Compiler Optimizations in the Context of EOLE
abstract
Increasing instruction-level parallelism is regaining attractiveness within the microprocessor industry. The {Early | Out-of-order | Late} Execution (EOLE) microarchitecture and Differential Value TAgged GEometric (D-VTAGE) value predictor were recently introduced to solve practical issues of Value Prediction (VP). In particular, they remove the most significant difficulties that forbade an effective VP hardware. In this study, we present a detailed evaluation of the potential of VP in the context of EOLE/D-VTAGE and different compiler options. Our study shows that if no single general rule always applies—more optimization might sometimes lead to more performance—unoptimized codes often get a large benefit from the prediction of redundant loads.
Fernando A. Endo, Arthur Perais, André Seznec
ACM Trans. Archit. Code Optim.1
2016 Register sharing for equality prediction
abstract
Recently, Value Prediction (VP) has been gaining renewed traction in the research community. VP speculates on the result of instructions to increase Instruction Level Parallelism (ILP). In most embodiments, VP requires large tables to track predictions for many static instructions. However, in many cases, it is possible to detect that the result of an instruction is produced by an older inflight instruction, but not to predict the result itself. Consequently it is possible to rely on predicting register equality and handle speculation through the renamer. To do so, we propose to use Distance Prediction, a technique that was previously used to perform Speculative Memory Bypassing (short-circuiting def-store-load-use chains). Distance Prediction attempts to determine how many instructions separate the instruction of interest and the most recent older instruction that produced the same result. With this information, the physical register identifier of the older instruction can be retrieved from the ROB and provided to the renamer. In this paper, we first quantify the performance gains brought by renaming-based register equality prediction and regular VP on SPEC benchmarks. Second, we study the overlap between the two different schemes and show that those mechanisms often capture different behavior.
Arthur Perais, Fernando A. Endo, André Seznec
MICRO2