Peter Ahrens

  • Program Year: 3
  • 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

Publications

F. Kjolstad, P. Ahrens, S. Kamil, and S. Amarasinghe, "Tensor Algebra Compilation with Workspaces," in Proceedings of the 2019 IEEE/ACM International Symposium on Code Generation and Optimization, Piscataway, NJ, USA, 2019, pp. 180-192.

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

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.

P. Ahrens, H. D. Nguyen, and J. Demmel, "Efficient Reproducible Floating Point Summation and BLAS," EECS Department, University of California, Berkeley, Tech. Rep. UCB/EECS-2015-229, Dec. 2015.
http://www.eecs.berkeley.edu/Pubs/TechRpts/2015/EECS-2015-229.html (In review by ACM TOMS)

Tumblin, R., Ahrens, P., Hartse, S., & Robey, R. W. (2015). Parallel Compact Hash Algorithms for Computational Meshes. SIAM Journal on Scientific Computing, 37(1), C31-C53.
(unofficial link)
https://github.com/losalamos/ExascaleDocs/raw/master/CompactHashes.pdf

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