Extracting coarse-grained parallelism for affine perfectly nested quasi-uniform loops

  • Authors:
  • Włodzimierz Bielecki;Krzysztof Kraska

  • Affiliations:
  • Faculty of Computer Science and Information Technology, West Pomeranian University of Technology, Szczecin, Poland;Faculty of Computer Science and Information Technology, West Pomeranian University of Technology, Szczecin, Poland

  • Venue:
  • PPAM'11 Proceedings of the 9th international conference on Parallel Processing and Applied Mathematics - Volume Part I
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents a new approach for the extraction of coarse---grained parallelism available in program loops. The approach permits for extracting parallelism for both uniform and quasi---uniform perfectly nested parameterized loops, where the loop bounds and data accesses are affine functions of loop indices and symbolic parameters. It extracts a set of synchronization---free code fragments. The procedure has a polynomial time complexity except for one step of calculations. The effectiveness and time complexity of the approach are evaluated by means of loops of the NAS Parallel Benchmark suite.