论文信息 - Locality Optimizations for Parallel Machines

Locality Optimizations for Parallel Machines

This paper focuses on the problem of locality optimizations for high-performance uniprocessor and multiprocessor systems. It shows that the problems of minimizing interprocessor communication and optimizing cache locality can be formulated in a similar manner. It outlines the algorithms to optimize for the various levels of the memory hierarchy simultaneously.

Monica S. Lam | M. Lam

[1] Anoop Gupta,et al. Design and evaluation of a compiler algorithm for prefetching , 1992, ASPLOS V.

[2] D LamMonica,et al. The cache performance and optimizations of blocked algorithms , 1991 .

[3] Rice UniversityCORPORATE,et al. High performance Fortran language specification , 1993 .

[4] David A. Patterson,et al. Computer Architecture: A Quantitative Approach , 1969 .

[5] Anoop Gupta,et al. The Stanford Dash multiprocessor , 1992, Computer.

[6] Monica S. Lam,et al. A data locality optimizing algorithm , 1991, PLDI '91.

[7] Michael E. Wolf,et al. Improving locality and parallelism in nested loops , 1992 .

[8] Monica S. Lam,et al. Global optimizations for parallelism and locality on scalable parallel machines , 1993, PLDI '93.

[9] Monica S. Lam,et al. The cache performance and optimizations of blocked algorithms , 1991, ASPLOS IV.

[10] Monica S. Lam,et al. Communication optimization and code generation for distributed memory machines , 1993, PLDI '93.

[11] Monica S. Lam,et al. A Loop Transformation Theory and an Algorithm to Maximize Parallelism , 1991, IEEE Trans. Parallel Distributed Syst..

[12] Corinne Ancourt,et al. Scanning polyhedra with DO loops , 1991, PPOPP '91.

[13] Rainer Hoch,et al. From paper to office document standard representation , 1992, Computer.

[14] book,et al. Computer Architecture , a Quantitative Approach , 1995 .