ICFP 2021
Sun 22 - Sat 28 August 2021
Mon 23 Aug 2021 00:30 - 01:00 at FHPNC - Session 2

We present a massively parallel algorithm for computing persistent homology, a concept within the field of topological data analysis, and we implement it in the purely functional array-based language Futhark, which has an efficient compiler targeting GPUs. Computing persistent homology consists of bringing a certain sparse matrix to a reduced form. We compare our implementation with OpenPH, an existing library for computing persistent homology on GPUs, and on large matrices we achieve speedups of 2.3 to 5. Our work shows both that persistent homology can be computed efficiently entirely on GPU hardware, and that Futhark can be used for this kind of sparse matrix manipulation.

Sun 22 Aug

Displayed time zone: Seoul change

23:30 - 01:00
Session 2FHPNC at FHPNC
23:30
30m
Talk
Parallelism-preserving automatic differentiation for second-order array languages
FHPNC
Adam Paszke Google Research, Matthew J. Johnson Google Research, Roy Frostig Google Research, Dougal Maclaurin Google Research
00:00
30m
Talk
Reverse Automatic Differentiation for Accelerate (Extended Abstract)
FHPNC
Tom Smeding Utrecht University, Matthijs Vákár Utrecht University, Trevor L. McDonell Utrecht University
00:30
30m
Talk
Computing Persistent Homology in Futhark
FHPNC
Erik von Brömssen Chalmers University of Technology