Publications

Load Plus Communication Balancing in Contiguous Partitions for Distributed Sparse Matrices: Linear-Time Algorithms

P. Ahrens, “Load Plus Communication Balancing in Contiguous Partitions for Distributed Sparse Matrices: Linear-Time Algorithms,” arXiv:2007.16192 [cs], Jul. 2020. Link. Download.

Algorithms for Efficient Reproducible Floating Point Summation

P. Ahrens, J. Demmel, and H. D. Nguyen, “Algorithms for Efficient Reproducible Floating Point Summation,” ACM Trans. Math. Softw., vol. 46, no. 3, p. 22:1–22:49, Jul. 2020. Link. Download.

Brief Announcement: Sparse Tensor Transpositions

S. Mueller, P. Ahrens, S. Chou, F. Kjolstad, and S. Amarasinghe, “Brief Announcement: Sparse Tensor Transpositions,” in Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2020, pp. 559–561. Link. Download.

Sparse Tensor Transpositions

S. Mueller, P. Ahrens, S. Chou, F. Kjolstad, and S. Amarasinghe, “Sparse Tensor Transpositions,” arXiv:2005.10427 [cs], May 2020. Link. Download.

On Optimal Partitioning For Sparse Matrices In Variable Block Row Format

P. Ahrens and E. G. Boman, “On Optimal Partitioning For Sparse Matrices In Variable Block Row Format,” arXiv:2005.12414 [cs], May 2020. Link. Download.

Tensor Algebra Compilation with Workspaces

F. Kjolstad, P. Ahrens, S. Kamil, and S. Amarasinghe, “Tensor Algebra Compilation with Workspaces,” in 2019 IEEE/ACM International Symposium on Code Generation and Optimization (CGO), 2019, pp. 180–192. Link. Download.

A Parallel Fill Estimation Algorithm for Sparse Matrices and Tensors in Blocked Formats

P. J. Ahrens, “A Parallel Fill Estimation Algorithm for Sparse Matrices and Tensors in Blocked Formats,” Thesis, Massachusetts Institute of Technology, 2019. Link. Download.

LATE Ain’T Earley: A Faster Parallel Earley Parser

P. Ahrens, J. Feser, and R. Hui, “LATE Ain’T Earley: A Faster Parallel Earley Parser,” arXiv:1807.05642 [cs], Jul. 2018. Link. Download.

A Fill Estimation Algorithm for Sparse Matrices and Tensors in Blocked Formats

P. Ahrens, H. Xu, and N. Schiefer, “A Fill Estimation Algorithm for Sparse Matrices and Tensors in Blocked Formats,” in 2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2018, pp. 546–556. Link. Download.

Efficient Reproducible Floating Point Summation and BLAS

P. Ahrens, J. Demmel, and H. D. Nguyen, “Efficient Reproducible Floating Point Summation and BLAS,” EECS Department, University of California, Berkeley, UCB/EECS-2016-121, Jun. 2016. Link. Download.

Parallel Compact Hash Algorithms for Computational Meshes

R. Tumblin, P. Ahrens, S. Hartse, and R. Robey, “Parallel Compact Hash Algorithms for Computational Meshes,” SIAM J. Sci. Comput., vol. 37, no. 1, pp. C31–C53, Jan. 2015. Link. Download.