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

Abhijit Paithankar

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

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

Systems, architecture and hardware · 1Software engineering, systems software and programming languages · 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 · 80% Parallel and multicore computing · 20%

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

TopicWeightPapersLastEvidence papers
Parallel and multicore computing
eager execution
0.011998
Selective Eager Execution on the PolyPath Architecture · ISCA 1998
Processor architecture and microarchitecture
instruction-level parallelism
0.011998
Selective Eager Execution on the PolyPath Architecture · ISCA 1998
Processor architecture and microarchitecture › speculative execution
multi-path execution
0.011998
Selective Eager Execution on the PolyPath Architecture · ISCA 1998
Processor architecture and microarchitecture
speculative execution
0.011998
Selective Eager Execution on the PolyPath Architecture · ISCA 1998
Processor architecture and microarchitecture
superscalar processor
0.011998
Selective Eager Execution on the PolyPath Architecture · ISCA 1998

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

register renaming · 0.0instruction tagging · 0.0execution-driven simulation · 0.0
YearPublicationVenuePosition
1998 Selective Eager Execution on the PolyPath Architecture
abstract
Control-flow misprediction penalties are a major impediment to high performance in wide-issue superscalar processors. In this paper we present Selective Eager Execution (SEE), an execution model to overcome mis-speculation penalties by executing both paths after diffident branches. We present the micro-architecture of the PolyPath processor which is an extension of an aggressive superscalar out-of-order architecture. The PolyPath architecture uses a novel instruction tagging and register renaming mechanism to execute instructions from multiple paths simultaneously in the same processor pipeline, while retaining maximum resource availability for single-path code sequences. Results of our execution-driven, pipeline-level simulations show that SEE can improve performance by as much as 36% for the go benchmark, and an average of 14% on SPECint95, when compared to a normal superscalar, out-of-order speculative execution, monopath processor. Moreover our architectural model is both elegant and practical to implement, using a small amount of additional state and control logic.
Artur Klauser, Abhijit Paithankar, Dirk Grunwald
ISCA2