Sat 22 Jun 2019 15:00 - 15:30 at 106C - Session 4 Chair(s): Tze Meng Low

We present a higher-order programmer-level technique for compiling particular kinds of irregular data-parallel problems to parallel hardware. The technique, which we have named “flattening-by-expansion” builds on a number of segmented data-parallel operations but is itself implemented as a higher-order generic function, which makes it useful for many irregular problems. Concretely, the implementation is given in Futhark and we demonstrate the usefulness of the functionality for a number of irregular problems and show that, in practice, the irregular problems are compiled to efficient parallel code that can be executed on GPUs. The technique is useful in any data-parallel language that provides a key set of primitives.

Sat 22 Jun
Times are displayed in time zone: (GMT-07:00) Tijuana, Baja California change

14:00 - 15:30: ARRAY 2019 - Session 4 at 106C
Chair(s): Tze Meng LowCMU
ARRAY-2019-papers14:00 - 14:30
Norman A. RinkTU Dresden, Germany, Jeronimo CastrillonTU Dresden, Germany
ARRAY-2019-papers14:30 - 15:00
Justin SlepakNortheastern University, Olin ShiversNortheastern University, USA, Panagiotis ManoliosNortheastern University
ARRAY-2019-papers15:00 - 15:30
Martin ElsmanUniversity of Copenhagen, Denmark, Troels HenriksenUniversity of Copenhagen, Denmark, Niels G. W. SerupDIKU, University of Copenhagen