Skip to Main content Skip to Navigation

STS-k: A Multilevel Sparse Triangular Solution Scheme for NUMA Multicores

Abstract : We consider techniques to improve the performance of parallel sparse triangular solution on non-uniform memory architecture multicores by extending earlier coloring and level set schemes for single-core multiprocessors. We develop sts-k, where k represents a small number of transformations for latency reduction from increased spatial and temporal locality of data accesses. We propose a graph model of data reuse to inform the development of sts-k and to prove that computing an optimal cost schedule is NP-complete. We observe significant speed-ups with sts-3 on 32-core Intel Westmere-EX and 24-core AMD `MagnyCours' processors. Incremental gains solely from the 3-level transformations in sts-3 for a fixed ordering, correspond to reductions in execution times by factors of 1.4 (Intel) and 1.5 (AMD) for level sets and 2 (Intel) and 2.2 (AMD) for coloring. On average, execution times are reduced by a factor of 6 (Intel) and 4 (AMD) for sts-3 with coloring compared to a reference implementation using level sets.
Complete list of metadata

Cited literature [11 references]  Display  Hide  Download
Contributor : Equipe Roma Connect in order to contact the contributor
Submitted on : Tuesday, August 11, 2015 - 8:48:49 PM
Last modification on : Friday, September 30, 2022 - 4:12:09 AM
Long-term archiving on: : Thursday, November 12, 2015 - 10:41:13 AM


Files produced by the author(s)


  • HAL Id : hal-01183904, version 1



Humayun Kabir, Joshua Booth, Guillaume Aupy, Anne Benoit, Yves Robert, et al.. STS-k: A Multilevel Sparse Triangular Solution Scheme for NUMA Multicores. [Research Report] RR-8763, Penn State University; ENS Lyon; INRIA. 2015. ⟨hal-01183904⟩



Record views


Files downloads