Abstract

Many data parallel algorithms – Fast Fourier Transform, Batcher’s sorting schemes and prefixsum – exhibit recursive structure. We propose a data structure, powerlist, that permits succinct descriptions of such algorithms, highlighting the roles of both parallelism and recursion. Simple algebraic properties of this data structure can be exploited to derive properties of these algorithms and establish equivalence of different algorithms that solve the same problem.

Citations

1497	The Definition of Standard ML - Milner, Tofte, et al. - 1990
1225	The essence of functional programming - Wadler - 1992
1206	Introduction to Parallel Algorithms and Architectures: Arrays - Leighton - 1992
708	Parallel Program Design - a Foundation - Chandy, Misra - 1989
445	An algorithm for the machine calculation of complex fourier series - Cooley, Tukey - 1965
430	Sorting Networks and Their Applications - Batcher - 1968
408	Can programming be liberated from the von neumann style ? A functional style and its algebra of programs - Backus
290	The calculi of lambda-conversion - Church - 1941
259	Parallel prefix computation - Ladner, Fischer - 1980
244	Sorting and Searching, volume 3 of The Art of Computer Programming - Knuth - 1973
234	Vector models for data-parallel computing - Blelloch - 1990
195	A programming language - Iverson - 1962
191	The Cube Connected Cycles: A Versatile Network for Parallel Computers - Preparata, Vuillemin - 1981
180	Chandy and Jayadev Misra. Parallel Program Design: A Foundation - Mani - 1988
127	NESL: A Nested Data-Parallel Language - Blelloch - 1992
98	Parallel algorithms for shared memory machines - Karp, Ramachandran
95	An overview of Miranda - Turner - 1986
77	Circuit design in ruby - Jones, Sheeran - 1990
35	Connection machine lisp: Fine-grained parallel symbolic processing - Steele, Hillis - 1986
28	and Vijaya Ramachandran. Parallel algorithms for sharedmemory machines - Karp - 1990
15	An algebraic model for divide-and-conquer algorithms and its parallelism - Mou, Hudak - 1988
12	Divacon: A parallel language for scientific computing based on divide-and-conquer - Mou - 1990
8	Automated reasoning about parallel algorithms using powerlists - Kapur, Subramaniam - 1995
6	Verifying adder circuits using powerlists - Adams - 1994
6	Mapping powerlists onto hypercubes - Kornerup - 1994
4	Pulse code communication, U.S. Patent 2632058 - Gray - 1953
3	A divide-and-conquer method of solving tridiagonal systems on hypercube massively parallel computers - Wang, Mou - 1991
1	Mapping powerlists onto hypercubes (in preparation - Kornerup - 1994
1	Connection Machine Lisp: Fine-grained parallel symbolic processing - Jr, L, et al. - 1986