Automatic data allocation to minimize communication on SIMD machines
暂无分享,去创建一个
[1] Guy L. Steele,et al. Massively parallel data optimization , 1988, Proceedings., 2nd Symposium on the Frontiers of Massively Parallel Computation.
[2] Ken Kennedy,et al. Compiling programs for distributed-memory multiprocessors , 2004, The Journal of Supercomputing.
[3] Guy L. Steele,et al. Data Optimization: Allocation of Arrays to Reduce Communication on SIMD Machines , 1990, J. Parallel Distributed Comput..
[4] Thomas R. Gross,et al. Structured dataflow analysis for arrays and its use in an optimizing compiler , 1990, Softw. Pract. Exp..
[5] Micha Sharir,et al. Structural Analysis: A New Approach to Flow Analysis in Optimizing Compilers , 2015 .
[6] Ken Kennedy,et al. Automatic Data Layout for Distributed-Memory Machines in the D Programming Environment , 1994, Automatic Parallelization.
[7] K. Timson,et al. Center for research on parallel computation , 1992 .
[8] Thinking Machines. Getting started in cm-fortran , 1990 .
[9] Jan F. Ens. A Framework for Efficient Execution of Array-Based Languages on SIMD Computers? , 1990 .
[10] Michael Weiss. Strip mining on SIMD architectures , 1991, ICS '91.
[11] Utpal Banerjee,et al. Dependence analysis for supercomputing , 1988, The Kluwer international series in engineering and computer science.
[12] David A. Padua,et al. Dependence graphs and compiler optimizations , 1981, POPL '81.
[13] Jingke Li,et al. Index domain alignment: minimizing cost of cross-referencing between distributed arrays , 1990, [1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation.