High-Performance Computer Algebra: A Hecke Algebra Case Study

MAIER, Patrick, LIVESEY, Daria, LOIDL, Hans-Wolfgang and TRINDER, Phil (2014). High-Performance Computer Algebra: A Hecke Algebra Case Study. In: Euro-Par 2014 Parallel Processing. Springer, 415-426. [Book Section]

Documents
18618:386568
[thumbnail of EuroPar2014-accepted_version.pdf]
Preview
PDF
EuroPar2014-accepted_version.pdf - Accepted Version
Available under License All rights reserved.

Download (345kB) | Preview
Abstract
We describe the first ever parallelisation of an algebraic computation at modern HPC scale. Our case study poses challenges typical of the domain: it is a multi-phase application with dynamic task creation and irregular parallelism over complex control and data structures. Our starting point is a sequential algorithm for finding invariant bilinear forms in the representation theory of Hecke algebras, implemented in the GAP computational group theory system. After optimising the sequential code we develop a parallel algorithm that exploits the new skeleton-based SGP2 framework to parallelise the three most computationally-intensive phases. To this end we develop a new domain-specific skeleton, parBufferTryReduce. We report good parallel performance both on a commodity cluster and on a national HPC, delivering speedups up to 548 over the optimised sequential implementation on 1024 cores.
More Information
Statistics

Downloads

Downloads per month over past year

Metrics

Altmetric Badge

Dimensions Badge

Share
Add to AnyAdd to TwitterAdd to FacebookAdd to LinkedinAdd to PinterestAdd to Email

Actions (login required)

View Item View Item