Scan

Motivation

Scan, also known as parallel prefix, is a fundamental and useful operation in parallel programming. We will gain experience in building Hillis & Steele scan with an optional work efficient Blellock scan.

Further, the dependencies in scan:

$y_{i}=y_{i-1}+x_{i}$

make it seem to have little hope for parallelism. However, simple yet clever approaches can achieve $\log ^{k}n$ critical path lengths.

While we will simply implement prefix sum, scan can be used for other associative operations.

Background

Prefix Sum

Hillis and Steele Algorithm

Data parallel algorithms

Video: Hillis and Steele Scan

Lecture

slides

Visualization

class:	ScanViz.java	VIZ
package:	scan.viz
source folder:	student/src/main/java

Warmup

Sequential Sum Scan

Client

class:	StepEfficientParallelSumScannerClient.java	CLIENT
package:	scan.client
source folder:	student/src/main/java

StepEfficientParallelSumScannerClient
OutOfPlaceSumScanner sumScanner = new StepEfficientParallelSumScanner(); int[] data = {1, 2, 3, 4, 5, 6, 7, 8}; System.out.println(Arrays.toString(data)); int[] result = sumScanner.sumScan(data); System.out.println(Arrays.toString(result));

StepEfficientParallelSumScannerClient Output
[1, 2, 3, 4, 5, 6, 7, 8] [1, 3, 6, 10, 15, 21, 28, 36]

Code To Use

PowersOf2Iterable

This exercise should come in handy here. Recall that we implemented a PowersOfTwoLessThan class in this exercise.

for(int v : new PowersOfTwoLessThan(71)) {
    System.out.println(v);
}

PhasableIntArrays

class PhasableIntArrays extends AbstractPhasable

srcForPhase(phaseIndex)

drcForPhase(phaseIndex)

One of the downsides to parallel scan requires memory. For our scans we add the additional requirement that we will not mutate the incoming array parameter. We could create log(n) arrays, one for each level but that would be wasteful. If we create two array buffers and switch which is the source to read from and which is the destination to write to at each power-of-two level of the scan, we should be good to go. Re-assigning two buffers back and forth as they switch between source and destination roles raises finality issues when attempting to access them inside of lambdas.

This is what PhasableIntArrays helps us with. By using its dstForPhase(int phaseIndex) and srcForPhase(int phaseIndex), we can get the source and destination array corresponding to the phase.

The table below shows which of the two buffer arrays, a or b, will be passed back for each phase index as the source or the destination array.

phase	src	dst	power of 2
0	data	a	1
1	a	b	2
2	b	a	4
3	a	b	8
4	b	a	16
5	a	b	32
6	b	a	64

NOTE: think about which array is the correct one to return from your scan method given how you write your code.

Code To Implement

class:	StepEfficientParallelSumScanner.java
methods:	sumScan
package:	scan.exercise
source folder:	student/src/main/java

method: int[] sumScan(int[] data) (parallel implementation required)

Challenge Problem

Blelloch (Work-efficient) Scan

Testing Your Solution

class:	__ScanTestSuite.java
package:	scan.exercise
source folder:	testing/src/test/java

Pledge, Acknowledgments, Citations

file:

exercise-scan-pledge-acknowledgments-citations.txt

More info about the Honor Pledge