DOACROSS parallelism

DOACROSS parallelism is a parallelization technique used to perform Loop-level parallelism by utilizing synchronisation primitives between statements in a loop. This technique is used when a loop cannot be fully parallelized by DOALL parallelism due to data dependencies between loop iterations, typically loop-carried dependencies. The sections of the loop which contain loop-carried dependence are synchronized, while treating each section as a parallel task on its own. Therefore, DOACROSS parallelism can be used to complement DOALL parallelism to reduce loop execution times.

## Contents

* 1 Description
* 1.1 Example
* 2 Drawbacks
* 3 See also
* 4 References

## Description

DOACROSS parallelism is particularly useful when one statement depends on the values generated by another statement. In such a loop, DOALL parallelism can not be implemented in a straightforward manner. If the first statement blocks the execution of the second statement until the required value has been produced, then the two statements would be able to execute independent of each other (i.e.), each of the aforementioned statements would be parallelized for simultaneous execution[1] using DOALL parallelism.

The following pseudocode illustrates the operation of DOACROSS parallelism in such a situation.[2]

### Example

for (int i = 0; i < N; i++) {
a[i] = a[i-2] + b[i]*c[i] + d[i]/e[i] + 1;

In this example, each iteration of the loop requires the value written into a by the previous iteration. However, the entire statement is not dependent on the previous iteration, but only a portion of it. The statement is split into two blocks to illustrate this.

post (0);
for (int i = 0; i < N; i++) {
temp = b[i]*c[i] + d[i]/e[i] + 1;
wait (i-2);
a[i] = a[i-2] + temp;
post (i);

The first statement has no loop carried dependence now, and the result of this statement is stored in the variable temp. The post () command is used to signal that the required result has been produced for utilization by other threads. The wait (i-2) command waits for the value a[i-2] before unblocking. The execution time of DOACROSS parallelism largely depends on what fraction of the program suffers from loop-carried dependence. Larger gains are observed when a sizable portion of the loop is affected by loop-carried dependence.[2]

## Drawbacks

DOACROSS parallelism suffers from significant space and granularity overheads due to the synchronization primitives used. Modern day compilers often overlook this method because of this major disadvantage.[1] The overheads may be reduced by reducing the frequency of synchronization across the loop, by applying the primitives for groups of statements at a time.[2]

## See also

* Data parallelism
* Task parallelism

## References

1. ↑ 1.0 1.1 Unnikrishnan, Priya; Shirako, Jun; Barton, Kit; Chatterjee, Sanjay; Silvera, Raul; Sarkar, Vivek (2012-08-27). Kaklamanis, Christos. ed (in en). Euro-Par 2012 Parallel Processing. Lecture Notes in Computer Science. Springer Berlin Heidelberg. pp. 219–231. doi:10.1007/978-3-642-32820-6_23. ISBN 9783642328190.
2. ↑ 2.0 2.1 2.2 Solihin, Yan (2009). Fundamentals of Parallel Multicore Architecture. Chapman and Hall/CRC.

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/DOACROSS parallelism. Read more

|

Retrieved from "https://handwiki.org/wiki/index.php?title=DOACROSS_parallelism&oldid=175850"