Parallelism for Single Loops with Multiple Dependences

We review some loop partitioning techniques such as loop splitting method by thresholds and Polychronopoulos' loop splitting method for exploiting parallelism from single loop which already developed. We propose improved loop splitting method for maximizing parallelism of single loops with non-constant dependence distances. By using the iteration and distance for the source of the first dependence, and by our defined theorems, we present generalized and optimal algorithms for single loops with non-uniform dependences. The algorithms generalize how to transform general single loops with one dependence as well as with multiple dependences into parallel loops.

keywords: Parallelizing Compiler, Loop Splitting, Loop, Multiple Dependences, Non-uniform Dependences

바로가기메뉴

Article Contents

Vol.3 No.3

Abstract

INTERNATIONAL JOURNAL OF CONTENTS