Analysis of Parallelism in Recursive Functions on Recursive Data Structures.pdfVIP

Analysis of Parallelism in Recursive Functions on Recursive Data Structures Jo onseon Ahn and Taiso ok Han Computer Science Department and AITrc Korea Advanced Institute of Science and Technology Kusungdong Yusunggu Taejon Republic of Korea jsahnpllabkaistackr hancskaistackr Abstract In functional languages iterative op erations on data collec tions are naturally expressed using recursive functions on recursive data structures In this pap er we present a metho d to extract data parallelism from recursive functions and generate data parallel programs As the parallel mo del for ob ject programs we use p olytypic parallel skeletons This mo del can express data parallel op erations on general re cursive data structures With this mo del we can extract data parallelism from recursive functions on general recursive structures such as trees and lists To extract appropriate computations for each parallel skeleton from an input function we classify all sub expressions in the function b o dy based on their conditions of parallel execution Then a data parallel program is generated from the classied expressions of the function Comparing our analytical approach with previous calculational approaches our ap proach can parallelize more general recursive functions with complex data ow Intro duction Data parallelism implements parallel computation by simultaneously applying the same op eration to each element of a data collection This paradigm is consid ered as a parallel mo del which can solve many diculties of parallel programming A single stream of program execution