Further Results for Improving Loop Interchange in Non-Adjacent and Imperfectly Nested Loops
نویسندگان
چکیده
Abstract Loop interchange is a powerful restructuring technique for supporting vectorization and parallelization. In this paper, we propose a technique which is better to determine whether loops can be interchanged between two non-adjacent loops. We also present a method for determining whether we can directly make loop interchange on an imperfectly nested loop. Some experimental results are also presented to show the effectiveness.
منابع مشابه
Affine-by-Statement Transformations of Imperfectly Nested Loops
A majority of loop restructuring techniques developed so far assume that loops are perfectly nested. The unimodular approach unifies three individual transformations – loop interchange, skewing and reversal – but is still limited to perfect loop nests. This paper outlines a framework that enables the use of unimodular transformations to restructure imperfect loop nests. The concepts previously ...
متن کاملImproving Memory Hierarchy Performance through Combined Loop Interchange and Multi-Level Fusion
Because of the increasing gap between the speeds of processors and main memories, compilers must enhance the locality of applications to achieve high performance. Loop fusion enhances locality by fusing loops that access similar sets of data. Typically, it is applied to loops at the same level after loop interchange, which first attains the best nesting order for each local loop nest. However, ...
متن کاملA Scheme for Detecting the Termination of a Parallel Loop Nest
One central problem in the execution of parallel nested loops with non-aane bounds is the precise scanning (i.e., enumeration) of the points in their iteration space and the detection of their termination. Scanning schemes have been proposed for both shared-memory and distributed-memory implementations. However, these schemes work only for perfectly nested while loops. We propose a scheme which...
متن کاملSolving the tandem AGV network design problem using tabu search: Cases of maximum workload and workload balance with fixed and non-fixed number of loops
A tandem AGV configuration connects all cells of a manufacturing area by means of non-overlapping, sin-gle-vehicle closed loops. Each loop has at least one additional P/D station, provided as an interface between adjacent loops. This study describes the development of three tabu search algorithms for the design of tandem AGV systems. The first algorithm was developed based on the basic definiti...
متن کاملStatement-Level Communication-Free Hyperplane Partitioning Techniques for Parallelizing Compilers on Multicomputers
This paper addresses the problems of communication free partitions of statement-iterations of nested loops and data accessed by these statement-iterations. Communication-free hyperplane partitions of disjoint subsets of data and statement-iterations are considered. This approach is more possible than existing methods in nding the data and program distribution patterns that can cause the process...
متن کامل