Code generation for multiple mappings
暂无分享,去创建一个
W. Kelly | Evan Rosser | William Pugh | W. Pugh | W. Kelly | Evan Rosser
[1] P. Feautrier. Some Eecient Solutions to the Aane Scheduling Problem Part I One-dimensional Time , 1996 .
[2] William Pugh,et al. Determining schedules based on performance estimation , 1993 .
[3] William Pugh,et al. Finding Legal Reordering Transformations Using Mappings , 1994, LCPC.
[4] Corinne Ancourt,et al. Scanning polyhedra with DO loops , 1991, PPOPP '91.
[5] Jordi Torres,et al. Partitioning the statement per iteration space using non-singular matrices , 1993, ICS '93.
[6] Yves Robert,et al. Constructive Methods for Scheduling Uniform Loop Nests , 1994, IEEE Trans. Parallel Distributed Syst..
[7] Monica S. Lam,et al. A data locality optimizing algorithm , 1991, PLDI '91.
[8] William Pugh,et al. The Omega test: A fast and practical integer programming algorithm for dependence analysis , 1991, Proceedings of the 1991 ACM/IEEE Conference on Supercomputing (Supercomputing '91).
[9] William Pugh,et al. Going Beyond Integer Programming with the Omega Test to Eliminate False Data Dependences , 1995, IEEE Trans. Parallel Distributed Syst..
[10] Zbigniew Chamski,et al. Nested loop sequences: towards efficient loop structures in automatic parallelization , 1994, 1994 Proceedings of the Twenty-Seventh Hawaii International Conference on System Sciences.
[11] Patrice Quinton,et al. A Language-oriented Approach to the Design of Systolic Chips , 1991 .
[12] William Pugh,et al. Experiences with Constraint-based Array Dependence Analysis , 1994, PPCP.
[13] William Pugh,et al. Counting solutions to Presburger formulas: how and why , 1994, PLDI '94.
[14] W. Pugh,et al. A framework for unifying reordering transformations , 1993 .
[15] Zbigniew Chamski,et al. Fast and Efficient Generation of Loop Bounds , 1993, PARCO.