Maximum loop distribution and fusion for two-level loops considering code size

@inproceedings{Liu05, abstract = {In this paper, we propose a technique combining loop distribution with loop fusion to improve the timing performance without increasing the code size of the transformed loops. We first develop the loop distribution theorems that state the conditions distributing any two-level nested loop in the maximum way. Based on the loop distribution theorems, we design an algorithm to conduct maximum loop distribution. Then we propose a technique of maximum loop distribution with direct loop fusion, which performs maximum loop distribution followed by direct loop fusion. The experimental results show that the execution time of the transformed loops by our technique is reduced 41.9\% on average compared to the original loops without the increase of the code size.}, author = {Liu, M. and Zhuge, Q. and Shao, Z. and Xue, C. and Qiu, M. and Sha, E. H. M. }, booktitle = {Parallel Architectures,Algorithms and Networks, 2005. ISPAN 2005. Proceedings. 8th International Symposium on}, citeulike-article-id = {2758521}, doi = {10.1109/ISPAN.2005.58}, journal = {Parallel Architectures,Algorithms and Networks, 2005. ISPAN 2005. Proceedings. 8th International Symposium on}, pages = {6 pp.+}, posted-at = {2008-05-05 19:11:45}, priority = {2}, title = {Maximum loop distribution and fusion for two-level loops considering code size}, url = {http://dx.doi.org/10.1109/ISPAN.2005.58}, year = {2005} }

TY - CONF ID - Liu05 L3 - citeulike-article-id:2758521 TI - Maximum loop distribution and fusion for two-level loops considering code size T2 - Parallel Architectures,Algorithms and Networks, 2005. ISPAN 2005. Proceedings. 8th International Symposium on JF - Parallel Architectures,Algorithms and Networks, 2005. ISPAN 2005. Proceedings. 8th International Symposium on SP - 6 pp. N2 - In this paper, we propose a technique combining loop distribution with loop fusion to improve the timing performance without increasing the code size of the transformed loops. We first develop the loop distribution theorems that state the conditions distributing any two-level nested loop in the maximum way. Based on the loop distribution theorems, we design an algorithm to conduct maximum loop distribution. Then we propose a technique of maximum loop distribution with direct loop fusion, which performs maximum loop distribution followed by direct loop fusion. The experimental results show that the execution time of the transformed loops by our technique is reduced 41.9% on average compared to the original loops without the increase of the code size. AU - Liu, M AU - Zhuge, Q AU - Shao, Z AU - Xue, C AU - Qiu, M AU - Sha, EHM PY - 2005/// UR - http://dx.doi.org/10.1109/ISPAN.2005.58 ER -