Edgar Solomonik

  • Program Years: 2010-2014
  • Academic Institution: University of California, Berkeley
  • Field of Study: Computer Science
  • Academic Advisor: James Demmel
  • Practicum(s):
    Argonne National Laboratory (2011)
    Lawrence Livermore National Laboratory (2012)
  • Degree(s):
    Ph.D. Computer Science, University of California, Berkeley, 2014
    B.S. Computer Science, University of Illinois at Urbana-Champaign, 2010

Current Status

  • Status: Assistant Professor, University of Illinois at Urbana-Champaign
  • Research Area: Computer Science
  • Personal URL: http://solomon2.web.engr.illinois.edu/
  • Publications

    Tobias Wicky, Edgar Solomonik, and Torsten Hoefler; Communication-Avoiding Parallel Algorithms for Solving Triangular Systems of Linear Equations arXiv preprint, arXiv:1612.01855 [cs.DC], December 2016.

    Edgar Solomonik, Maciej Besta, Flavio Vella, and Torsten Hoefler; Betweenness centrality is more parallelizable than dense matrix multiplication arXiv preprint, arXiv:1609.07008 [cs.MS], September 2016.

    Edgar Solomonik, Grey Ballard, James Demmel, and Torsten Hoefler; A communication-avoiding parallel algorithm for the symmetric eigenvalue problem arXiv preprint, arXiv:1604.03703 [cs.DC], April 2016.

    Edgar Solomonik and Torsten Hoefler; Sparse tensor algebra as a parallel programming model arXiv preprint, arXiv:1512.00066 [cs.MS], November 2015.

    Edgar Solomonik, James Demmel, and Torsten Hoefler; Communication lower bounds for tensor contraction algorithms Technical report, ETH Zürich, January 2015.

    Edgar Solomonik and James Demmel; Contracting symmetric tensors using fewer multiplications Technical report, ETH Zürich, January 2015.

    Edgar Solomonik; Provably efficient algorithms for numerical tensor algebra; Dissertation, University of California, Berkeley, August 2014.

    Edgar Solomonik, Devin Matthews, Jeff R. Hammond, John F. Stanton, and James Demmel; A massively parallel tensor contraction framework for coupled-cluster computations; Journal of Parallel and Distributed Computing, June 2014.

    Edgar Solomonik, Erin Carson, Nicholas Knight, and James Demmel; Tradeoffs between synchronization, communication, and work in parallel linear algebra computations; 26th ACM Symposium on Parallelism in Algorithms and Architectures, Prague, Czech Republic, June 2014.

    Grey Ballard, James Demmel, Laura Grigori, Mathias Jacquelin, Hong Diep Nguyen, and Edgar Solmonik; Reconstructing Householder Vectors from Tall-Skinny QR; IEEE International Parallel and Distributed Processing Symposium (IPDPS), Phoenix, AZ, May 2014.

    Edgar Solomonik, Devin Matthews, Jeff Hammond, and James Demmel; Cyclops Tensor Framework: reducing communication and eliminating load imbalance in massively parallel contractions, IEEE International Parallel and Distributed Processing Symposium (IPDPS), Boston, MA, May 2013.

    Edgar Solomonik, Aydin Buluc, and James Demmel; Minimizing communication in all-pairs shortest-paths; IEEE International Parallel and Distributed Processing Symposium (IPDPS), Boston, MA, May 2013.

    Michael Driscoll, Evangelos Georganas, Penporn Koanantakool, Edgar Solomonik, and Katherine Yelick; A Communication-Optimal N-Body Algorithm for Direct Interactions; IEEE International Parallel and Distributed Processing Symposium (IPDPS), Boston, MA, May 2013.

    Evangelos Georganas, Jorge Gonzalez-Dominguez, Edgar Solomonik, Yili Zheng, Juan Tourino and Katherine Yelick; Communication Avoiding and Overlapping for Numerical Linear Algebra, ACM/IEEE Supercomputing Conference, Salt Lake City, Utah, November 2012.

    Edgar Solomonik, James Demmel; Matrix multiplication on multidimensional torus networks, Springer Lecture Notes in Computer Science (LNCS), Proceedings of VECPAR, Kobe, Japan, July 2012.

    Edgar Solomonik, Jeff Hammond, and James Demmel; A preliminary report on Cyclops Tensor Framework, EECS Department, University of California, Berkeley, March 2012. (EECS Technical Report 2012-29)

    Edgar Solomonik, Abhinav Bhatele, and James Demmel; Improving communication performance in dense linear algebra via topology aware collectives; ACM/IEEE Supercomputing Conference 2011, Seattle, WA, November 2011.

    Edgar Solomonik, James Demmel; Communication-optimal parallel 2.5D matrix multiplication and LU factorization algorithms; Springer Lecture Notes in Computer Science (LNCS), Proceedings of the Euro-Par conference, Bordeaux, France, August 2011. ("Distinguished Paper")

    Laxmikant Kale and Edgar Solomonik, Parallel Sorting, Encyclopedia of Parallel Computing, Springer Verlag, David Padua, Ed., 2011.

    Abhinav Bhatele, Lukasz Wesolowski, Eric Bohm, Edgar Solomonik, and Laxmikant V. Kale; Understanding Application Performance via Micro-benchmarks on Three Large Supercomputers: Intrepid, Ranger and Jaguar; International Journal of High Performance Computing Applications; published online 26 May 2010.

    Edgar Solomonik and Laxmikant V. Kale; Highly Scalable Parallel Sorting; IEEE International Parallel and Distributed Processing Symposium 2010, Atlanta, GA, April 2010.

    Vivek Kale and Edgar Solomonik; Parallel Sorting Pattern; Workshop on Parallel Programming Patterns (ParaPLOP), March 2010.

    Awards

    UC Berkeley EECS Department David J. Sakrison Award, 2014

    ACM/IEEE-CS George Michael Memorial High Performance Computing Fellowship, 2013

    NERSC Award for Innovative Use of High Performance Computing, 2013

    Distinguished Paper (with co-author James Demmel); Euro-Par 2011, Bordeaux, France; for “Communication-optimal parallel 2.5D matrix multiplication and LU factorization algorithms.’

    Office of Science Graduate Fellowship (Declined), 2010

    NSF Graduate Fellowship Honorable Mention, 2010

    Finalist for CRA Outstanding Undergraduate Research Award, 2010

    University of Illinois CS Department Best Undergraduate Research Project Award, 2009