Automatic Optimization of Python Skeletal Parallel Programs

Frédéric Loulergue (1, 2) , Jolan Philippe (1, 3)

1 Northern Arizona University [Flagstaff]
2 LIFO - Laboratoire d'Informatique Fondamentale d'Orléans
3 LS2N - Laboratoire des Sciences du Numérique de Nantes

Skeletal parallelism is a model of parallelism where parallel constructs are provided to the programmer as usual patterns of parallel algorithms. High-level skeleton libraries often offer a global view of programs instead of the common Single Program Multiple Data view in parallel programming. A program is written as a sequential program but operates on parallel data structures. Most of the time, skeletons on a parallel data structure have counterparts on a sequential data structure. For example, the map function that applies a given function to all the elements of a sequential collection (e.g., a list) has a map skeleton counterpart that applies a sequential function to all the elements of a distributed collection. Two of the challenges a programmer faces when using a skeleton library that provides a wide variety of skeletons are: which are the skeletons to use, and how to compose them? These design decisions may have a large impact on the performance of the parallel programs. However, skeletons, especially when they do not mutate the data structure they operate on, but are rather implemented as pure functions , possess algebraic properties that allow to transform compositions of skeletons into more efficient compositions of skeletons. In this paper, we present such an automatic transformation framework for the Python skeleton library PySke and evaluate it on several example applications.

Domaines: Langage de programmation [cs.PL]

Frédéric Loulergue, Jolan Philippe. Automatic Optimization of Python Skeletal Parallel Programs. 19th International Conference on Algorithms and Architectures for Parallel Processing (ICA3PP), Dec 2019, Melbourne, Australia. ⟨10.1007/978-3-030-38991-8_13⟩. ⟨hal-02317123⟩