TY - CONF
T1 - Code generation for multiple mappings
T2 - Frontiers of Massively Parallel Computation, 1995. Proceedings. Frontiers '95., Fifth Symposium on the
Y1 - 1995
A1 - Kelly,W.
A1 - Pugh, William
A1 - Rosser,E.
KW - code generation
KW - Computer science
KW - Concurrent computing
KW - control overhead
KW - Educational institutions
KW - iteration reordering transformations
KW - Law
KW - Legal factors
KW - loop blocking
KW - multiple mappings
KW - optimisation
KW - optimising compilers
KW - Optimizing compilers
KW - PARALLEL PROCESSING
KW - Performance analysis
KW - program compilers
AB - 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
JA - Frontiers of Massively Parallel Computation, 1995. Proceedings. Frontiers '95., Fifth Symposium on the
PB - IEEE
SN - 0-8186-6965-9
M3 - 10.1109/FMPC.1995.380437
ER -