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

Chris McKinsey

dblp:68/1922 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1999
—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.

Software engineering, system software, and programming languages
1 paper
Compilers and program optimization · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Processor architecture and microarchitecture · 100%

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

TopicWeightPapersLastEvidence papers
Compilers and program optimization › instruction scheduling
global instruction scheduling
0.011999
Wavefront Scheduling: Path based Data Representation and Scheduling of Subgraphs · MICRO 1999
Compilers and program optimization
instruction scheduling
0.011999
Wavefront Scheduling: Path based Data Representation and Scheduling of Subgraphs · MICRO 1999
Processor architecture and microarchitecture
instruction-level parallelism
0.011999
Wavefront Scheduling: Path based Data Representation and Scheduling of Subgraphs · MICRO 1999

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

path-based data dependence representation · 0.0p-ready code motion · 0.0deferred compensation · 0.0
YearPublicationVenuePosition
1999 Wavefront Scheduling: Path based Data Representation and Scheduling of Subgraphs
abstract
The IA-64 architecture is rich with features that enable aggressive exploitation of instruction-level parallelism. Features such as speculation, predication, multiway branches and others provide compilers with new opportunities for the extraction of parallelism in programs. Code scheduling is a central component in any compiler for the IA-64 architecture. This paper describes the implementation of the global code scheduler (GCS) in Intel's reference compiler for the IA-64 architecture. GCS schedules code over acyclic regions of control flow. There is a tight coupling between the formation and scheduling of regions. GCS employs a new path based data dependence representation that combines control flow and data dependence information to make data analysis easy and accurate. This paper provides details of this representation. The scheduler uses a novel instruction scheduling technique called Wavefront scheduling. The concepts of wavefront scheduling and deferred compensation are explained to demonstrate the efficient generation of compensation code while scheduling. This paper also presents P-ready code motion, an opportunistic instruction level tail duplication which aims to strike a balance between code expansion and performance potential. Performance results show greater than 30% improvement in speedup for wavefront scheduling over basic block scheduling on the Merced microarchitecture.
Jay Bharadwaj, Kishore N. Menezes, Chris McKinsey
MICRO3