Trailblazing: A Hierarchical Approach to Percolation Scheduling

Percolation Scheduling (PS) is a system for performing parallelizing transformations for the VLIW and super-scalar cumputation models.

[1]  Toshio Nakatani,et al.  A new compilation technique for parallelizing loops with unpredictable branches on a VLIW architecture , 1990 .

[2]  Roni Potasman.  Percolation-based compiling for evaluation of parallelism and hardware design trade-offs , 1991 .

[3]  Hugo Krawczyk,et al.  Code duplication: an assist for global instruction scheduling , 1991, MICRO 24.

[4]  K. Ebcioğlu,et al.  An Efficient Resource-constrained Global Scheduling Technique For Superscalar And Vliw Processors , 1992, [1992] Proceedings the 25th Annual International Symposium on Microarchitecture MICRO 25.

[5]  Milind Girkar,et al.  Automatic Extraction of Functional Parallelism from Ordinary Programs , 1992, IEEE Trans. Parallel Distributed Syst..

[6]  John Paul Shen,et al.  Architecture synthesis of high-performance application-specific processors , 1991, DAC '90.

[7]  Alexandru Nicolau,et al.  Uniform Parallelism Exploitation in Ordinary Programs , 1985, ICPP.

[8]  Rajiv Gupta,et al.  Region Scheduling: An Approach for Detecting and Redistributing Parallelism , 1990, IEEE Trans. Software Eng..

[9]  Keshav Pingali,et al.  Dependence flow graphs: an algebraic approach to program dependencies , 1991, POPL '91.

[10]  Alexandru Nicolau,et al.  An Efficient Global Resource Constrained Technique for Exploiting Instruction Level Parallelism , 1992, ICPP.

[11]  R. Shprintzen,et al.  What's in a name? , 1990, The Cleft palate journal.

[12]  Alex Aiken,et al.  Compaction-Based Parallelization , 1988 .

[13]  Alexander Aiken,et al.  Perfect Pipelining: A New Loop Parallelization Technique , 1988, ESOP.

[14]  Joe D. Warren,et al.  The program dependence graph and its use in optimization , 1984, TOPL.