Parallel block-delayed sequences Article Swipe

PDF

Related Concepts

Computer science Compiler Parallel computing Block (permutation group theory) Parallelism (grammar) Context (archaeology) Set (abstract data type) Programming language Filter (signal processing) Mathematics Paleontology Geometry Computer vision Biology

Sam Westrick , Mike Rainey , Daniel Anderson , Guy E. Blelloch ·

YOU? · · 2022 · Open Access · · DOI: https://doi.org/10.1145/3503221.3508434 · OA: W4220876151

Programming languages using functions on collections of values, such as map, reduce, scan and filter, have been used for over fifty years. Such collections have proven to be particularly useful in the context of parallelism because such functions are naturally parallel. However, if implemented naively they lead to the generation of temporary intermediate collections that can significantly increase memory usage and runtime. To avoid this pitfall, many approaches use "fusion" to combine operations and avoid temporary results. However, most of these approaches involve significant changes to a compiler and are limited to a small set of functions, such as maps and reduces.