Coarse-grained loop parallelization: Iteration Space Slicing vs affine transformations-Reference-Cited by-同舟云学术

Coarse-grained loop parallelization: Iteration Space Slicing vs affine transformations

Published:2011-08 Issue:8 Volume:37 Page:479-497
ISSN:0167-8191
Container-title:Parallel Computing
language:en
Short-container-title:Parallel Computing

Author:

Beletska Anna,Bielecki Wlodzimierz,Cohen Albert,Palkowski Marek,Siedlecki Krzysztof

Publisher

Elsevier BV

Subject

Artificial Intelligence,Computer Graphics and Computer-Aided Design,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software

Reference32 articles.

1. Using message passing for developing coarse-grained applications in openmp;Bielecki,2008

2. Putting polyhedral transformations to work;Bastoul,2003

3. A practical automatic polyhedral parallelizer and locality optimizer;Bondhugula,2008

4. Scheduling and Automatic Parallelization;Darte,2000

5. P. Feautrier, Toward automatic distribution 4 (1994) 233–244.

Cited by 32 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Optimal uniformization for non-uniform two-level loops using a hybrid method;The Journal of Supercomputing;2023-03-19

2. TLP: Towards three‐level loop parallelisation;IET Computers & Digital Techniques;2022-08-09

3. Intra-Tile Parallelization for Two-Level Perfectly Nested Loops With Non-Uniform Dependences;The Computer Journal;2020-05-28

4. Architecture, challenges and applications of dynamic reconfigurable computing;Journal of Semiconductors;2020-02-01

5. Transitive Closure Based Schedule of Loop Nest Statement Instances;Advances in Soft and Hard Computing;2018-12-12