[wlcpc93.abs] B. Yang, J. Webb, J. Stichnoth, D. O'Hallaron, and T. Gross, "Do&Merge: Integrating parallel loops and reductions", In Proc. Sixth Workshop on Languages and Compilers for Parallel Computing, volume 768 of Lecture Notes in Computer Science, pages 169-183, Portland, OR, August 1993. Springer Verlag. Abstract: Many computations perform operations that match this pattern: first, a loop iterates over an input array, producing an array of (partial) results. The loop iterations are independent of each other and can be done in parallel. Second, a reduction operation combines the elements of the partial result array to produce the single final result. We call these two steps a Do&Merge computation. The most common way to effectively parallelize such a computation is for the programmer to apply a DOALL operation across the input array, and then to apply a reduction operator to the partial results. We show that combining the Do phase and the Merge phase into a single Do\&Merge computation can lead to improved execution time and memory usage. In this paper we describe a simple and efficient construct (called the Pdo loop) that is included in an experimental HPF-like compiler for private-memory parallel systems. @incollection{yang93, author = "B. Yang and J. Webb and J. Stichnoth and D. O'Hallaron and T. Gross", title = "{D}o\&{M}erge: Integrating Parallel Loops and Reductions", pages = "169--183", booktitle = "Proc. Sixth Workshop on Languages and Compilers for Parallel Computing", series = "Lecture Notes in Computer Science", volume = "768", month = aug, year = 1993, address = "Portland, OR", publisher = "Springer Verlag", }