A Code Generation Algorithm for Affine Partitioning Framework

• Published in: 11th International Conference on Parallel and Distributed Systems (ICPADS'05) Vol. 2; pp. 17 - 21
• Main Authors: Liao, S.-W., Du, Z., Wu, G., Lueh, G.-Y.
• Format: Conference Proceeding
• Language: English
• Published: IEEE 2005
• Subjects: Application software; Central Processing Unit; Concurrent computing; Educational institutions; Microprocessors; Multicore processing; Parallel processing; Partitioning algorithms; Program processors; Programming profession
• ISBN: 9780769522814; 0769522815
• ISSN: 1521-9097
• DOI: 10.1109/ICPADS.2005.12

Multiprocessors are about to become prevalent in the PC world. Major CPU vendors such as Intel and Advanced Micro Devices have recently announced their imminent migration to multicore processors. Affine partitioning provides a systematic framework to find asymptotically optimal computation and data decomposition for multiprocessors, including multicore processors. This affine framework uniformly models a large class of high-level optimizations such as loop interchange, reversal, skewing, fusion, fission, re-indexing, scaling, and statement reordering. However, the resulting code after applying affine transformations tends to contain more loop levels and complex conditional expressions. This impacts performance, code readability and debuggability for both programmers and compiler developers. To facilitate the adoption of affine partitioning in industry, we address the above practical issues by proposing a salient two-step algorithm: coalesce and optimize. The coalescing algorithm maintains valid code throughout and improves readability and debuggability. We demonstrate with examples that the optimization algorithm simplifies the resulting loop structures, conditional expressions and array access functions and generates efficient code