%0 Conference Paper
%B Frontiers of Massively Parallel Computation, 1995. Proceedings. Frontiers '95., Fifth Symposium on the
%D 1995
%T Code generation for multiple mappings
%A Kelly,W.
%A Pugh, William
%A Rosser,E.
%K code generation
%K Computer science
%K Concurrent computing
%K control overhead
%K Educational institutions
%K iteration reordering transformations
%K Law
%K Legal factors
%K loop blocking
%K multiple mappings
%K optimisation
%K optimising compilers
%K Optimizing compilers
%K PARALLEL PROCESSING
%K Performance analysis
%K program compilers
%X There has been a great amount of recent work toward unifying iteration reordering transformations. Many of these approaches represent transformations as affine mappings from the original iteration space to a new iteration space. These approaches show a great deal of promise, but they all rely on the ability to generate code that iterates over the points in these new iteration spaces in the appropriate order. This problem has been fairly well-studied in the case where all statements use the same mapping. We have developed an algorithm for the less well-studied case where each statement uses a potentially different mapping. Unlike many other approaches, our algorithm can also generate code from mappings corresponding to loop blocking. We address the important trade-off between reducing control overhead and duplicating code
%B Frontiers of Massively Parallel Computation, 1995. Proceedings. Frontiers '95., Fifth Symposium on the
%I IEEE
%P 332 - 341
%8 1995/02/06/9
%@ 0-8186-6965-9
%G eng
%R 10.1109/FMPC.1995.380437