论文信息 - Locality optimization for program instances

Locality optimization for program instances

The degree of locality of a program reflects the level of temporal and spatial concentration of related data and computations. Locality optimization can speed up programs by reducing the communication costs. A possible human approach to locality optimization is to consider several small program instances of a given program, find optimal or close to optimal mappings of data and computations for the program instances, and generalize them to the program.

Claudia Leopold

[1] Yves Crama,et al. Local Search in Combinatorial Optimization , 2018, Artificial Neural Networks.

[2] Wei Li,et al. Unifying data and control transformations for distributed shared-memory machines , 1995, PLDI '95.

[3] Richard E. Ladner,et al. The influence of caches on the performance of sorting , 1997, SODA '97.

[4] Mahmut T. Kandemir,et al. A compiler algorithm for optimizing locality in loop nests , 1997, ICS '97.

[5] Hesham H. Ali,et al. Task scheduling in parallel and distributed systems , 1994, Prentice Hall series in innovative technology.

[6] Monica S. Lam,et al. Data and computation transformations for multiprocessors , 1995, PPOPP '95.

[7] J. K. Lenstra,et al. Local Search in Combinatorial Optimisation. , 1997 .

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