Alumni Profiles

Willow Ahrens

  • Program Years: 2017-2021
  • Academic Institution: Massachusetts Institute of Technology
  • Field of Study: Computer Science
  • Academic Advisor: Saman Amarasinghe
  • Practicum(s):
    Sandia National Laboratories, New Mexico (2019)
  • Degree(s):
    B.S. Electrical Engineering and Computer Sciences, University of California, Berkeley, 2016

Current Status

Publications

P. Ahrens, F. Kjolstad, and S. Amarasinghe, "An Asymptotic Cost Model for Autoscheduling Sparse Tensor Programs," arXiv:2111.14947 [cs], Nov. 2021. http://arxiv.org/abs/2111.14947.

P. Ahrens, "Contiguous Graph Partitioning For Optimal Total Or Bottleneck Communication," arXiv:2007.16192 [cs]. https://arxiv.org/abs/2007.16192v4.

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. https://doi.org/10.1145/3389360.

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. https://doi.org/10.1145/3350755.3400245.

S. Mueller, P. Ahrens, S. Chou, F. Kjolstad, and S. Amarasinghe, "Sparse Tensor Transpositions," arXiv:2005.10427 [cs], May 2020. https://arxiv.org/abs/2005.10427v1.

P. Ahrens and E. G. Boman, "On Optimal Partitioning For Sparse Matrices In Variable Block Row Format," arXiv:2005.12414 [cs], May 2020. http://arxiv.org/abs/2005.12414.

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. https://doi.org/10.1109/CGO.2019.8661185.

P. J. Ahrens, "A Parallel Fill Estimation Algorithm for Sparse Matrices and Tensors in Blocked Formats," Thesis, Massachusetts Institute of Technology, 2019. https://dspace.mit.edu/handle/1721.1/121653.

P. Ahrens, J. Feser, and R. Hui, "LATE Ain'T Earley: A Faster Parallel Earley Parser," arXiv:1807.05642 [cs], Jul. 2018. http://arxiv.org/abs/1807.05642.

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. https://doi.org/10.1109/IPDPS.2018.00064.

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. http://www2.eecs.berkeley.edu/Pubs/TechRpts/2016/EECS-2016-121.html.

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. https://doi.org/10.1137/13093371X.

Awards

Warren Y. Dere Design Award, UC Berkeley, 2016
EECS Honors, UC Berkeley, 2012-2016
CS61C Image Convolution Optimization Contest 1st place, UC Berkeley, 2013
CS61A Scheme Recursive Art Contest 1st Place, UC Berkeley, 2012