Piecewise Execution of Nested Data-Parallel Programs

Abstract. The technique of flattening nested data parallelism combines all the independent operations in nested apply-to-all constructs and generates large amounts of potential parallelism for both regular and irregular expressions. However, the resulting data-parallel programs can have enormous memory requirements, limiting their utility. In this paper, we present piecewise execution, an automatic method of partially serializing data-parallel programs so that they achieve maximum parallelism within storage limitations. By computing large intermediate sequences in pieces, our approach requires asymptotically less memory to perform the same amount of work. By using characteristics of the underlying parallel architecture to drive the computation size, we retain effective use of a parallel machine at each step. This dramatically expands the class of nested data-parallel programs that can be executed using the flattening technique. With the addition of piecewise I/O operations, these tec...

• Type: Conference
• Year: 1995
• Where: LCPC
• Authors: Daniel W. Palmer, Jan Prins, Siddhartha Chatterjee, Rickard E. Faith
• Keywords: Data-parallel Programs, LCPC 1995, Nested Apply-to-all Constructs, Nested Data Parallelism, System Software