Data-Dependency Graph Transformations for Instruction Scheduling

Authors:
Mark Heffernan;Kent Wilken
Affiliations:
Department of Electrical and Computer Engineering, University of California, Davis 95616;Department of Electrical and Computer Engineering, University of California, Davis 95616
Venue:
Journal of Scheduling
Year:
2005

Citing 16
Cited 3

The superblock: an effective technique for VLIW and superscalar compilation

The Journal of Supercomputing - Special issue on instruction-level parallelism
An Optimal Instruction Scheduler for Superscalar Processor

IEEE Transactions on Parallel and Distributed Systems
Advanced compiler design and implementation

Advanced compiler design and implementation
The Power of Dominance Relations in Branch-and-Bound Algorithms

Journal of the ACM (JACM)
Postpass Code Optimization of Pipeline Constraints

ACM Transactions on Programming Languages and Systems (TOPLAS)
Scheduling of resource constrained projects

Scheduling of resource constrained projects
Scheduling time-constrained instructions on pipelined processors

ACM Transactions on Programming Languages and Systems (TOPLAS)
A fast approach to computing exact solutions to the resource-constrained scheduling problem

ACM Transactions on Design Automation of Electronic Systems (TODAES)
Computer architecture: a quantitative approach

Computer architecture: a quantitative approach
Introduction to Algorithms

Introduction to Algorithms
SPEC CPU2000: Measuring CPU Performance in the New Millennium

Computer
Minimum Register Instruction Sequencing to Reduce Register Spills in Out-of-Order Issue Superscalar Architectures

IEEE Transactions on Computers
Minimum Register Instruction Sequence Problem: Revisiting Optimal Code Generation for DAGs

IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Resource Spackling: A Framework for Integrating Register Allocation in Local and Global Schedulers

PACT '94 Proceedings of the IFIP WG10.3 Working Conference on Parallel Architectures and Compilation Techniques
Integrated prepass scheduling for a Java Just-In-Time compiler on the IA-64 architecture

Proceedings of the international symposium on Code generation and optimization: feedback-directed and runtime optimization
Critical path scheduling of task systems with resource and processor constraints (Extended Abstract)

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing

Data-Dependency Graph Transformations for Superblock Scheduling

Proceedings of the 39th Annual IEEE/ACM International Symposium on Microarchitecture
An Application of Constraint Programming to Superblock Instruction Scheduling

CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
A constraint programming approach for integrated spatial and temporal scheduling for clustered architectures

ACM Transactions on Embedded Computing Systems (TECS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a set of efficient graph transformations for local instruction scheduling. These transformations to the data-dependency graph prune redundant and inferior schedules from the solution space of the problem. Optimally scheduling the transformed problems using an enumerative scheduler is faster and the number of problems solved to optimality within a bounded time is increased. Furthermore, heuristic scheduling of the transformed problems often yields improved schedules for hard problems. The basic node-based transformation runs in O(ne) time, where n is the number of nodes and e is the number of edges in the graph. A generalized subgraph-based transformation runs in O(n2 e) time. The transformations are implemented within the Gnu Compiler Collection (GCC) and are evaluated experimentally using the SPEC CPU2000 floating-point benchmarks targeted to various processor models. The results show that the transformations are fast and improve the results of both heuristic and optimal scheduling.