Abstract
We develop and analyze new scheduling algorithms for solving sparse triangular linear systems (SpTRSV) in parallel. Our approach, which we call barrier list scheduling, produces highly efficient synchronous schedules for the forward- and backward-substitution algorithm. Compared to state-of-the-art baselines HDagg [23] and SpMP [16], we achieve a 3.24× and 1.45× geometric-mean speed-up, respectively. We achieve this by obtaining an up to 11× geometric-mean reduction in the number of synchronization barriers over HDagg, whilst maintaining a balanced workload, and by applying a matrix reordering step for locality. We show that our improvements are consistent across a variety of input matrices and hardware architectures.
| Original language | English |
|---|---|
| Title of host publication | Proceedings - 2025 IEEE International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2025 |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 1263-1265 |
| Number of pages | 3 |
| ISBN (Electronic) | 9798331526436 |
| DOIs | |
| State | Published - 2025 |
| Externally published | Yes |
| Event | 2025 IEEE International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2025 - Milan, Italy Duration: 3 Jun 2025 → 7 Jun 2025 |
Publication series
| Name | Proceedings - 2025 IEEE International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2025 |
|---|
Conference
| Conference | 2025 IEEE International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2025 |
|---|---|
| Country/Territory | Italy |
| City | Milan |
| Period | 3/06/25 → 7/06/25 |
Bibliographical note
Publisher Copyright:© 2025 IEEE.
Keywords
- forward-substitution algorithm
- Sparse triangular system solving
- SpTRSV
- synchronous parallel schedule