Article

Data-Dependency Graph Transformations for Superblock Scheduling

Authors:

Mark Heffernan,

Ghassan ShobakiAuthors Info & Claims

MICRO 39: Proceedings of the 39th Annual IEEE/ACM International Symposium on Microarchitecture

Pages 77 - 88

https://doi.org/10.1109/MICRO.2006.16

Published: 09 December 2006 Publication History

Abstract

The superblock is a scheduling region which exposes instruction level parallelism beyond the basic block through speculative execution of instructions. In gen- eral, scheduling superblocks is an NP-Hard optimiza- tion and prior work includes both heuristic (polynomial- time) and optimal (enumerative) scheduling techniques. This paper presents a set of transformations to the data-dependency graph which significantly improves the results of heuristic and enumerative superblock scheduling. The graph transformations prune redun- dant and inferior schedules from the problem solution space. Heuristically scheduling the transformed data- dependency graphs yields significant reduction in ex- pected execution time for hard superblocks. Also, enu- meratively scheduling the transformed graphs is faster, and an optimal schedule is found for more problem in- stances within a bounded time. The transformations are applied to superblocks generated with the GNU Compiler Collection (GCC) using the SPEC CPU2000 benchmarks targeted to various processor models. The experimental results confirm that the transformations significantly improve the results for heuristic and enu- merative superblock scheduling.

References

[1]

{1} S. Banerjia, W. A. Havanki, and T. M. Conte. Treegion scheduling for highly parallel processors. In European Conference on Parallel Processing, pages 1074-1078, 1997.

Digital Library

[2]

{2} D. Berson, R. Gupta, and M. L. Soffa. Resource spackling: A framework for integrating register allocation in local and global schedulers. In Proceedings of the Conference on Parallel Architectures and Compilation Techniques , 1994.

Digital Library

[3]

{3} R. A. Bringmann. Compiler-Controlled Speculation. PhD thesis, Department of Computer Science, University of Illinois, Urbana, IL, 1995.

[4]

{4} C. Chekuri, R. Johnson, R. Motwani, B. Natarajan, B. R. Rau, and M. S. Schlansker. Profile-driven instruction level parallel scheduling with application to super blocks. In Proceedings of the 29th Annual International Symposium on Microarchitecture, pages 58-67, December 1996.

Digital Library

[5]

{5} H.-C. Chou and C.-P. Chung. An optimal instruction scheduler for superscalar processor. IEEE Transactions on Parallel and Distributed Systems, 6(3):303-313, March 1995.

Digital Library

[6]

{6} B. L. Deitrich and W. W. Hwu. Speculative hedge: Regulating compile-time speculation against profile variations. In Proceedings of the 29th International Symposium on Microarchitecture, pages 70-79, December 1996.

Digital Library

[7]

{7} A. E. Eichenberger and W. Meleis. Balance scheduling: Weighing branch tradeoffs in superblocks. In Proceedings of the 32nd Annual International Symposium on Microarchitecture , pages 272-283, December 1999.

Digital Library

[8]

{8} J. Fisher. Trace scheduling: A technique for global microcode compaction. IEEE Transactions on Computers, 30(7):478-490, July 1981.

Digital Library

[9]

{9} M. Heffernan. Graph Transforma tions for Instruction Scheduling. PhD thesis, Department of Electrical and Computer Engineering, University of California, Davis, 2006.

[10]

{10} M. Heffernan and K. Wilken. Data-dependency graph transformations for instruction scheduling. Journal of Scheduling, 8(5):427-451, 2005.

Digital Library

[11]

{11} J. Hennessy and D. Patterson. Computer Architecture: A Quantitative Approach. Morgan Kaufmann, third edition, 2002.

Digital Library

[12]

{12} J. Henning. SPEC CPU2000: Measuring CPU performance in the new millennium. IEEE Computer, 33(7):28-35, 2000.

Digital Library

[13]

{13} W. Hwu, S. Mahlke, W. Chen, P. Chang, N. Warter, R. Bringmann, R. Ouellette, R. Hank, T. Kiyohara, G. Haab, J. Holm, and D. Lavery. The superblock: An effective technique for VLIW and superscalar compilation. The Journal of Supercomputing, 7(1), January 1993.

Digital Library

[14]

{14} A. Leung, K. Palem, and A. Pnueli. Scheduling time-constrained instructions on pipelined processors. ACM Transactions on Programming Languages and Systems, 23(1):73-103, 2001.

Digital Library

[15]

{15} S. Muchnick. Advanced Compiler Design and Implementation . Morgan Kaufmann, 1997.

Digital Library

[16]

{16} C. Ramamoorthy, K. Chandy, and M. Gonzalez, Jr. Optimal scheduling strategies in a multiprocessor system. IEEE Transactions on Computers, 21(2):137-146, February 1972.

Digital Library

[17]

{17} G. Shobaki and K. Wilken. Optimal superblock scheduling using enumeration. In Proceedings of the 37th Annual International Symposium on Microarchitecture, pages 283-293, December 2004.

Digital Library

Cited By

Shobaki GGordon VMcHugh PDubois TKerbow A(2022)Register-Pressure-Aware Instruction Scheduling Using Ant Colony OptimizationACM Transactions on Architecture and Code Optimization10.1145/350555819:2(1-23)Online publication date: 30-Jun-2022
https://dl.acm.org/doi/10.1145/3505558
Shobaki GBassett JHeffernan MKerbow AEgger BSmith A(2022)Graph transformations for register-pressure-aware instruction schedulingProceedings of the 31st ACM SIGPLAN International Conference on Compiler Construction10.1145/3497776.3517771(41-53)Online publication date: 19-Mar-2022
https://dl.acm.org/doi/10.1145/3497776.3517771
Shobaki GKerbow APulido CDobson W(2019)Exploring an Alternative Cost Function for Combinatorial Register-Pressure-Aware Instruction SchedulingACM Transactions on Architecture and Code Optimization10.1145/330148916:1(1-30)Online publication date: 27-Feb-2019
https://dl.acm.org/doi/10.1145/3301489
Show More Cited By

Index Terms

Data-Dependency Graph Transformations for Superblock Scheduling
1. Hardware
  1. Electronic design automation
    1. Physical design (EDA)
  2. Hardware validation

Recommendations

Graph transformations for register-pressure-aware instruction scheduling
CC 2022: Proceedings of the 31st ACM SIGPLAN International Conference on Compiler Construction

This paper presents graph transformation algorithms for register-pressure-aware instruction scheduling. The proposed transformations add edges to the data dependence graph (DDG) to eliminate solutions that are either redundant or sub-optimal. Register-...
Data-Dependency Graph Transformations for Instruction Scheduling

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 ...
Learning Heuristics for the Superblock Instruction Scheduling Problem

Modern processors have multiple pipelined functional units and can issue more than one instruction per clock cycle. This places a burden on the compiler to schedule the instructions to take maximum advantage of the underlying hardware. Superblocks—a ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

MICRO 39: Proceedings of the 39th Annual IEEE/ACM International Symposium on Microarchitecture

December 2006

493 pages

ISBN:0769527329

Sponsors

SIGMICRO: ACM Special Interest Group on Microarchitectural Research and Processing

Publisher

IEEE Computer Society

United States

Publication History

Published: 09 December 2006

Check for updates

Qualifiers

Article

Conference

Micro-39

Sponsor:

SIGMICRO

Micro-39: The 39th Annual IEEE/ACM International Symposium on Microarchitecture

December 9 - 13, 2006

Acceptance Rates

MICRO 39 Paper Acceptance Rate 42 of 174 submissions, 24%;

Overall Acceptance Rate 484 of 2,242 submissions, 22%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
442
Total Downloads

Downloads (Last 12 months)4
Downloads (Last 6 weeks)1

Reflects downloads up to 08 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Shobaki GGordon VMcHugh PDubois TKerbow A(2022)Register-Pressure-Aware Instruction Scheduling Using Ant Colony OptimizationACM Transactions on Architecture and Code Optimization10.1145/350555819:2(1-23)Online publication date: 30-Jun-2022
https://dl.acm.org/doi/10.1145/3505558
Shobaki GBassett JHeffernan MKerbow AEgger BSmith A(2022)Graph transformations for register-pressure-aware instruction schedulingProceedings of the 31st ACM SIGPLAN International Conference on Compiler Construction10.1145/3497776.3517771(41-53)Online publication date: 19-Mar-2022
https://dl.acm.org/doi/10.1145/3497776.3517771
Shobaki GKerbow APulido CDobson W(2019)Exploring an Alternative Cost Function for Combinatorial Register-Pressure-Aware Instruction SchedulingACM Transactions on Architecture and Code Optimization10.1145/330148916:1(1-30)Online publication date: 27-Feb-2019
https://dl.acm.org/doi/10.1145/3301489
Beg MBeek P(2013)A constraint programming approach for integrated spatial and temporal scheduling for clustered architecturesACM Transactions on Embedded Computing Systems10.1145/251247013:1(1-23)Online publication date: 5-Sep-2013
https://dl.acm.org/doi/10.1145/2512470

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten