- Stefan M. Freudenberger
- … show all 1 hide
Trace scheduling is a global acyclic instruction scheduling technique in which the scheduling region consists of a linear acyclic sequence of basic blocks embedded in the control flow graph. Trace scheduling differs from other global acyclic scheduling techniques by allowing the scheduling region to be entered after the first instruction.
Trace scheduling was the first global instruction scheduling technique that was proposed and successfully implemented in both research and commercial compilers. By demonstrating that simple microcode operations could be statically compacted and scheduled on multi-issue hardware, trace scheduling provided the basis for making large amounts of instruction-level parallelism practical. Its first commercial implementation demonstrated that commercial codes could be statically compiled for multi-issue architectures, and thus greatly influenced and contributed to the performance of superscalar architectures. Today, the ideas of trace sched ...
- Aiken A, Nicolau A (1988) Optimal loop parallelization. In: Proceedings of the SIGPLAN 1988 conference on programming language design and implementation, June 1988, pp 308–317
- Chang PP, Warter NJ, Mahlke SA, Chen WY, Hwu WW (1991) Three superblock scheduling models for superscalar and superpipelined processors. Technical Report CRHC-91-29. Center for Reliable and High-Performance Computing, University of Illinois at Urbana-Champaign
- Chang, PP, Mahlke, SA, Chen, WY, Warter, NJ, Hwu, WW (1991) IMPACT: an architectural framework for multiple-instruction-issue processors.
- Ellis JR (1985) Bulldog: a compiler for VLIW architectures. PhD thesis, Yale University
- Fisher JA (1993) Global code generation for instruction-level parallelism: trace scheduling-2. Technical Report HPL-93-43. Hewlett-Packard Laboratories
- Fisher, JA (1981) Trace scheduling: a technique for global microcode compaction. IEEE Trans Comput 30: pp. 478-490
- Fisher, JA (1979) The optimization of horizontal microcode within and beyond basic blocks. PhD dissertation. Technical Report COO-3077-161. New York University, New York, NY
- Freudenberger SM, Gross TR, Lowney PG (1994) Avoidance and suppression of compensation code in a trace scheduling compiler, ACM Trans Program Lang Syst, July 1994, 16(4):1156–1214
- Havanki, WA (1997) Treegion scheduling for VLIW processors. Department of Electrical and Computer Engineering, North Carolina State University, Raleigh, NC
- Havanki, WA, Banerjia, S, Conte, TM (1998) Treegion scheduling for wide issue processors.
- Hwu, WW, Mahlke, SA, Chen, WY, Chang, PP, Warter, NJ, Bringmann, RA, Ouellette, RG, Hank, RE, Kiyohara, T, Haab, GE, Holm, JG, Lavery, DM (1993) The superblock: an effective technique for VLIW and superscalar compilation. J Supercomput 7: pp. 229-248
- Lowney PG, Freudenberger SM, Karzes TJ, Lichtenstein WD, Nix RP, O’Donnell JS, Ruttenberg JC (1993) The Multiflow trace scheduling compiler, J Supercomput, May 1993, 7(1-2):51–142
- Mahlke, SA, Lin, DC, Chen, WY, Hank, RE, Bringmann, RA (1992) Effective compiler support for predicated execution using the hyperblock.
- Mahlke, SA, Chen, WY, Bringmann, RA, Hank, RE, Hwu, WW, Rau, BR, Schlansker, MS (1993) Sentinel scheduling: a model for compiler-controlled speculative execution. ACM Trans Comput Syst 11: pp. 376-408
- Moon, SM, Ebcioglu, K (1997) Parallelizing nonnumerical code with selective scheduling and software pipelining. ACM Trans Program Lang Syst 19: pp. 853-898
- Zhou, H, Conte, TM (2002) Code size efficiency in global scheduling for ILP processors.
- Zhou, H, Jennings, MD, Conte, TM (2001) Tree traversal scheduling: a global scheduling technique for VLIW/EPIC processors.
- Trace Scheduling
- Reference Work Title
- Encyclopedia of Parallel Computing
- pp 2062-2071
- Print ISBN
- Online ISBN
- Springer US
- Copyright Holder
- Springer Science+Business Media, LLC
- Additional Links
- Industry Sectors
- eBook Packages
To view the rest of this content please follow the download PDF link above.