Finding Synchronization-Free Parallelism Represented with
Trees of Dependent Operations
Algorithms and Architectures for Parallel Processing, Springer Berlin Heidelberg, (2008)Abstract
Algorithms are presented for extracting synchronization-free
parallelism available in arbitrarily nested parameterized loops.
The parallelism is represented with synchronization-free trees
of dependent operations. Sets representing trees can be
described with non-linear expressions. The main idea is to
firstly extract sources of synchronization-free trees and next
to generate parallel code based on a while loop. Experimental
results are presented exposing speed-up and efficiency of
parallel programs written in the OpenMP standard on the basis of
code generated by the algorithms proposed.
Links and resources
Tags
community
@christophv's tags highlighted