The prefix sum problem can be solved intuitively in the serial programming context. However, the algorithm at first glance seems to have a dependence on previous results, hence, at first glance a ...

This project was the second coursework for the Parallel Programming Languages and Systems class in my 5th year at The University of Edinburgh. The original requirements and brief are found at ex2.pdf.

Parallel prefix sum has come up a number of times so far in the course, and will come up again. It is a fundamental building block for a lot of parallel algorithms. There are good materials on it in ...

Note that you will have the option of what parallel prefix sum algorithm to implement. The version we used in class to motivate barrier discussion is the Hillis-Steele algorithm, which has a lot of ...

Abstract: This paper presents a novel and efficient method to compute one of the simplest and most useful building block for parallel algorithms: the parallel prefix sum operation. Besides its ...

This paper presents a novel parallel prefix sum algorithm on n numbers by p processors. A parallel time analysis shows that this proposed algorithm is more efficient and easy-scalable than Blelloch's ...

Additionally, parallel design patterns and algorithms can provide reusable solutions for common parallel problems such as divide and conquer, map reduce, pipeline, or parallel prefix. Finally ...