Affiliation:
1. Department of Computer Science, Faculty of Mathematical Sciences, University of Tabriz, Tabriz, Iran
Abstract
Abstract
Most important scientific and engineering applications have complex computations or large data. In all these applications, a huge amount of time is consumed by nested loops. Therefore, loops are the main source of the parallelization of scientific and engineering programs. Many parallelizing compilers focus on parallelization of nested loops with uniform dependences, and parallelization of nested loops with non-uniform dependences has not been extensively investigated. This paper addresses the problem of parallelizing two-level nested loops with non-uniform dependences. The aim is to minimize the execution time by improving the load balancing and minimizing the inter-processor communication. We propose a new tiling algorithm, k-StepIntraTiling, using bin packing problem to minimize the execution time. We demonstrate the effectiveness of the proposed method in several experiments. Simulation and experimental results show that the algorithm effectively reduces the total execution time of several benchmarks compared to the other tiling methods.
Publisher
Oxford University Press (OUP)
Reference62 articles.
1. Dynamic Scheduling of Nested Loops With Uniform Dependencies in Heterogeneous Networks of Workstations;Riakiotakis,2005
2. 3-d data partitioning for 3-level perfectly nested loops on heterogeneous distributed systems;Zefreh,2017
3. An intelligent parallel loop scheduling for parallelizing compilers;Fann,2000
4. Automatic Transformations for Communication-Minimized Parallelization and Locality Optimization in the Polyhedral Model;Bondhugula,2008
5. A new genetic algorithm for loop tiling;Parsa;J. Supercomput.,2006
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献