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

Meilin Liu, Qingfeng Zhuge, Zili Shao, Chun Xue, Meikang Qiu, Edwin H.M. Sha

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

3 Citations (Scopus)

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.
Original languageEnglish
Title of host publicationProceedings - 8th International Symposium on Parallel Architectures, Algorithms and Networks, I-Span 2005
Pages126-131
Number of pages6
Volume2005
DOIs
Publication statusPublished - 1 Dec 2005
Event8th International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN 2005 - Las Vegas, NV, United States
Duration: 7 Dec 20059 Dec 2005

Conference

Conference8th International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN 2005
CountryUnited States
CityLas Vegas, NV
Period7/12/059/12/05

ASJC Scopus subject areas

  • Computer Science(all)

Cite this