Аннотация
Variable Privatization is an important technique that has been
used by compilers to parallelize loops by eliminating
storage-related dependences. In this paper, we present an
approach that combines extracting synchronization-free slices
available in program loops with variable privatization. This
permits us to reduce the number of dependence relations and as a
consequence to reduce the time complexity of algorithms aimed at
extracting synchronization-free slices. This leads to enlarging
the scope of the applicability of those algorithms and reducing
the time required to parallelize loops. The scope of the
applicability of the approach is illustrated by means of the NAS
Parallel Benchmark suite. Results of a performance analysis for
parallelized loops executed on a multi-core computer are
presented. Received results are compared with those obtained by
other loop parallelization techniques. The future work is
outlined.
Пользователи данного ресурса
Пожалуйста,
войдите в систему, чтобы принять участие в дискуссии (добавить собственные рецензию, или комментарий)