A CORRECTNESS PROOF OF PARALLEL SCAN
1994 ◽
Vol 04
(03)
◽
pp. 329-338
◽
Keyword(s):
The parallel scan algorithm plays an important role in parallel programming, but previous explanations of it generally rely on informal methods that fail to establish its correctness. Equational reasoning in a pure functional language provides a formal vehicle for stating the parallel scan algorithm and proving that a parallel architecture executes it correctly. The two key ideas in the proof are (1) a collection of lemmas that show how folds and scans can be decomposed into smaller problems, supporting a divide-and-conquer strategy, and (2) a formal specification of the abstract parallel architecture in the same language used to specify the problem, making it possible to reason formally about how the architecture executes the algorithm.
2000 ◽
Vol 10
(02n03)
◽
pp. 239-250
◽
2005 ◽
Vol 168
(1)
◽
pp. 178-191
◽
2019 ◽
2005 ◽
Vol 15
(3)
◽
pp. 431-475
◽
2013 ◽
Vol 7
(2)
◽
pp. 227-236
◽
1999 ◽
Vol 09
(03)
◽
pp. 335-345
◽
2013 ◽
Vol 756-759
◽
pp. 2825-2828
1985 ◽
Vol 23
(4)
◽
pp. 403-416