Extended Abstract Submission for PLDI’97 Near-optimal Intraprocedural Branch Alignment (2008)
Cliff Young, David S. Johnson, David R. Karger, Michael D. Smith
Branch alignment reorders the basic blocks of a program to minimize pipeline penalties due to control-transfer instructions. Prior work in branch alignment has produced useful heuristic methods. We...
1 A Comparative Analysis of Schemes for Correlated Branch Prediction (2007)
Cliff Young, Nicolas Gloy, Michael D. Smith
Modern high-performance architectures require extremely accurate branch prediction to overcome the performance limitations of conditional branches. We present a framework that categorizes branch...
1 A Comparative Analysis of Schemes for Correlated Branch Prediction (2007)
Cliff Young, Nicolas Gloy, Michael D. Smith
Modern high-performance architectures require extremely accurate branch prediction to overcome the performance limitations of conditional branches. We present a framework that categorizes branch...
1 Performance Issues in Correlated Branch Prediction Schemes (2007)
Nicolas Gloy, Michael D. Smith, Cliff Young
Accurate static branch prediction is the key to many techniques for exposing, enhancing, and exploiting Instruction Level Parallelism (ILP). The initial work on static correlated branch prediction...
1 An Instruction Scheduling Library for SUIF (2007)
We present a library that supports scheduling in machine SUIF. The library builds on existing control-flow graph, data flow analysis, and memory disambiguation infrastructure from the SUIF system...
1 Performance Issues in Correlated Branch Prediction Schemes (2007)
Nicolas Gloy, Michael D. Smith, Cliff Young
Accurate static branch prediction is the key to many techniques for exposing, enhancing, and exploiting Instruction Level Parallelism (ILP). The initial work on static correlated branch prediction...
Comparing and Combining Profiles (2000)
How much do two profiles of the same program differ? When has a profile changed enough to warrant reexamination of the profiled program? And how should two or more profiles be combined to make a...
Static correlated branch prediction (1999)
Recent work in history-based branch prediction uses novel hardware structures to capture branch correlation and increase branch prediction accuracy. Branch correlation occurs when the outcome of a...
Comparing and Combining Profiles (1999)
this paper to branch profiles; much of the relevant scholarly work also relates to branch profiling. Our first two problems, comparing profiles and determining when program behavior has changed,...
Static Correlated Branch Prediction (1999)
this article, we show how to instrument a program so that it is practical to collect run-time statistics that indicate where branch correlation occurs, and we then show how to use these statistics to...
Page 1 of 10 Comparing and Combining Profiles (1999)
Serap Savari And, Serap Savari, Cliff Young
this paper to branch profiles; much of the relevant scholarly work also relates to branch profiling. Our first two problems, comparing profiles and determining when program behavior has changed,...
Comparing And Combining, Serap Savari, Cliff Young
How much do two profiles of the same program differ? When has a profile changed enough to warrant reexamination of the profiled program? And how should two or more profiles be combined to make a...
Better Global Scheduling Using Path Profiles (1998)
Path profiles record the frequencies of execution paths through a program. Until now, the best global instruction schedulers have relied upon profile-gathered frequencies of conditional branch...
Better Global Scheduling Using Path Profiles (1998)
Path profiles record the frequencies of execution paths through a program. Until now, the best global instruction schedulers have relied upon profile-gathered frequencies of conditional branch...
Better Global Scheduling Using Path Profiles (1998)
Path profiles record the frequencies of execution paths through a program. Until now, the best global instruction schedulers have relied upon profile-gathered frequencies of conditional branch...
Practical and Profitable Alternatives to Greedy, Single-path Scheduling (1998)
Gang Chen, Cliff Young, Michael D. Smith
Compiler writers continue to search for ways to use the ever-increasing number of parallel functional units in modern microarchitectures. The most popular approach today is to build a tracebased...
The Harvard Atom-like Tool (Halt) Manual (1998)
Researchers need tools to observe program behavior. Many hot research topics, including just-in-time compilation, run-time code generation, instruction set emulation and translation, and walk-time...
The SUIF Control Flow Graph Library (1998)
This document discusses the SUIF control flow graph (CFG) library. It discusses design goals, the interface to the library, implementation decisions, current status, and planned updates. The SUIF CFG...
The flow analysis and transformation libraries of Machine SUIF (1997)
Machine SUIF [6] is an extension of the SUIF compiler framework that facilitates experiments with machine-specific optimizations. Just as base SUIF [7] is built on a rich collection of libraries for...
An Instruction Scheduling Library for SUIF (1997)
Gang Chen And, Gang Chen, Cliff Young
We present a library that supports scheduling in machine SUIF. The library builds on existing control-flow graph, data flow analysis, and memory disambiguation infrastructure from the SUIF system...
Near-optimal Intraprocedural Branch Alignment (1997)
Cliff Young, David S. Johnson, David R. Karger, Michael D. Smith
Branch alignment reorders the basic blocks of a program to minimize pipeline penalties due to control-transfer instructions. Prior work in branch alignment has produced useful heuristic methods. We...
Near-Optimal Intraprocedural Branch Alignment (1997)
Cliff Young, David S. Johnson, David R. Karger, Michael D. Smith
Branch alignment reorders the basic blocks of a program to minimize pipeline penalties due to control-transfer instructions. Prior work in branch alignment has produced useful heuristic methods. We...
Near-Optimal Intraprocedural Branch Alignment (1997)
Cliff Young, David S. Johnson, David R. Karger, Michael D. Smith
Branch alignment reorders the basic blocks of a program to minimize pipeline penalties due to control-transfer instructions. Prior work in branch alignment has produced useful heuristic methods. We...
Branch instrumentation in SUIF (1996)
Conditional branches limit the speed of modern microprocessors. Researchers need tools to examine program branch behavior. HALT, the Harvard Atom-Like Tool, allows SUIF users to instrument...
An Analysis of Dynamic Branch Prediction Schemes on System Workloads (1996)
Nicolas Gloy, Cliff Young, J. Bradley Chen, Michael D. Smith
Recent studies of dynamic branch prediction schemes rely almost exclusively on user-only simulations to evaluate performance. We find that an evaluation of these schemes with user and kernel...
Branch instrumentation in SUIF (1996)
Conditional branches limit the speed of modern microprocessors. Researchers need tools to examine program branch behavior. HALT, the Harvard Atom-Like Tool, allows SUIF users to instrument...
An Analysis of Dynamic Branch Prediction Schemes on System Workloads (1996)
On System Workloads, Nicolas Gloy, Cliff Young, J. Bradley Chen, Michael D. Smith
Recent studies of dynamic branch prediction schemes rely almost exclusively on user-only simulations to evaluate performance. We find that an evaluation of these schemes with user and kernel...
An Analysis of Dynamic Branch Prediction Schemes on System Workloads (1996)
On System Workloads, Nicolas Gloy, Cliff Young, J. Bradley Chen, Michael D. Smith
Recent studies of dynamic branch prediction schemes rely almost exclusively on user-only simulations to evaluate performance. We find that an evaluation of these schemes with user and kernel...
An Analysis of Dynamic Branch Prediction Schemes on System Workloads (1996)
On System Workloads, Nicolas Gloy, Cliff Young, J. Bradley Chen, Michael D. Smith
Recent studies of dynamic branch prediction schemes rely almost exclusively on user-only simulations to evaluate performance. We find that an evaluation of these schemes with user and kernel...
Improving the Accuracy of Static. . . (1994)
Recent work in history-based branch prediction uses novel hardware structures to capture branch correlation and increase branch prediction accuracy. We present a profile-based code transformation...