# Parsl: Pervasive Parallel Programming in Python

**Authors:** Yadu Babuji, Anna Woodard, Zhuozhao Li, Daniel S. Katz, Ben Clifford,, Rohan Kumar, Lukasz Lacinski, Ryan Chard, Justin M. Wozniak, Ian Foster,, Michael Wilde, Kyle Chard

arXiv: 1905.02158 · 2019-05-21

## TL;DR

Parsl is a Python library that simplifies parallel programming by enabling scalable, flexible, and efficient execution of complex workflows on supercomputers, supporting diverse scientific applications.

## Contribution

It introduces a scalable, flexible parallel scripting library for Python that constructs dynamic dependency graphs for efficient execution on large-scale systems.

## Key findings

- Achieves as low as 5 ms overhead per component execution
- Scales to over 250,000 workers across 8,000 nodes
- Processes more than 1,200 tasks per second

## Abstract

High-level programming languages such as Python are increasingly used to provide intuitive interfaces to libraries written in lower-level languages and for assembling applications from various components. This migration towards orchestration rather than implementation, coupled with the growing need for parallel computing (e.g., due to big data and the end of Moore's law), necessitates rethinking how parallelism is expressed in programs. Here, we present Parsl, a parallel scripting library that augments Python with simple, scalable, and flexible constructs for encoding parallelism. These constructs allow Parsl to construct a dynamic dependency graph of components that it can then execute efficiently on one or many processors. Parsl is designed for scalability, with an extensible set of executors tailored to different use cases, such as low-latency, high-throughput, or extreme-scale execution. We show, via experiments on the Blue Waters supercomputer, that Parsl executors can allow Python scripts to execute components with as little as 5 ms of overhead, scale to more than 250 000 workers across more than 8000 nodes, and process upward of 1200 tasks per second. Other Parsl features simplify the construction and execution of composite programs by supporting elastic provisioning and scaling of infrastructure, fault-tolerant execution, and integrated wide-area data management. We show that these capabilities satisfy the needs of many-task, interactive, online, and machine learning applications in fields such as biology, cosmology, and materials science.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1905.02158/full.md

## Figures

12 figures with captions in the complete paper: https://tomesphere.com/paper/1905.02158/full.md

## References

40 references — full list in the complete paper: https://tomesphere.com/paper/1905.02158/full.md

---
Source: https://tomesphere.com/paper/1905.02158