Reduction of Parallel Computation in the Parallel Model for Ada
Tucker Taft, Brad J. Moore, Luís Miguel Pinho, Stephen Michell · ACM SIGAda Ada Letters · 2016
One of the most common program constructs to be parallelized (and where most of the times gains are obtained) is parallel loops. This paper discusses different approaches to support loop parallelization in the fine-grained parallelism model for Ada currently being proposed, focusing in particular in the issues related to reducing operations.