Department of Computer Science
University of Illinois at Urbana-Champaign
Research Group: Laboratory for Parallel Numerical Algorithms (LPNA)
4229 Thomas M. Siebel Center for Computer Science
201 North Goodwin Avenue
Urbana, IL 61801-2302
(June 2017) My dissertation won the 2017 Householder prize!
(June 2017) Created a new website for the LPNA group!
(June 2017) SC paper to appear on communication-efficient betweenness centrality algorithms and their implementation in CTF.
(June 2017) IPDPS paper and HPDC paper, both led by Maciej Besta appear with theoretical and practical evaluations of parallel datastructures and algorithmic paradigms for graphs.
(May 2017) SPAA paper to appear on algorithms with lower communication complexity for QR factorization and the symmetric eigenvalue problem.
(Jan 2017) TOPC paper appears with a technique that yields numerous novel bounds on communication and synchronization complexity of numerical algorithms.
(Jan 2017) IPDPS paper led by Master's student Tobias Wicky on parallel TRSM algorithms.
(Dec 2016) Finished building and teaching an advanced course of 29 lectures (36 hours) on communication complexity of numerical and combinatorial algorithms!
numerical linear algebra
high performance computing
algebraic programming abstractions
computational quantum chemistry
Alston S. Householder Prize 2017
ETH Zurich Postdoctoral Fellowship 2014-2016
DOE Computational Science Graduate Fellowship 2010-2014
David J. Sakrison Memorial Prize 2014
NERSC Award for Innovative Use of High Performance Computing 2013
ACM-IEEE George Michael HPC Fellowship 2013
Postdoctoral Researcher, ETH Zurich, 2014-2016
PhD, University of California Berkeley, 2010-2014
BS, University of Illinois at Urbana-Champaign, 2008-2010
More information is available in my CV
|report||Edwin Pednault, John A. Gunnels, Giacomo Nannicini, Lior Horesh, Thomas Magerlein, Edgar Solomonik, and Robert Wisnieff Breaking the 49-qubit barrier in the simulation of quantum circuits arXiv:1710.05867 [quant-ph], October 2017. bibtex|
|report||Edgar Solomonik, Maciej Besta, Flavio Vella, and Torsten Hoefler Scaling betweenness centrality using communication-efficient sparse matrix multiplication ACM/IEEE Supercomputing Conference, Denver, Colorado, November 2017 (to appear). bibtex|
|report||Edgar Solomonik, James Demmel, and Torsten Hoefler Communication lower bounds of bilinear algorithms for symmetric tensor contractions arXiv:1707.04618 [cs.DC], July 2017. bibtex|
|article||Edgar Solomonik, Grey Ballard, James Demmel, and Torsten Hoefler A communication-avoiding parallel algorithm for the symmetric eigenvalue problem 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, New York, NY, USA, 111-121, July 2017. report bibtex|
|article||Maciej Besta, Michal Podstawski, Linus Groner, Edgar Solomonik, and Torsten Hoefler To push or to pull: on reducing communication and synchronization in graph computations 26th ACM Symposium on High Performance Parallel and Distributed Computing, ACM, New York, NY, USA, 93-104, June 2017. report bibtex|
|article||Tobias Wicky, Edgar Solomonik, and Torsten Hoefler Communication-avoiding parallel algorithms for solving triangular systems of linear equations IEEE International Parallel and Distributed Processing Symposium (IPDPS), Orlando, FL, June 2017, pp. 678-687. report bibtex|
|article||Maciej Besta, Florian Marending, Edgar Solomonik and Torsten Hoefler. SlimSell: A vectorizable graph representation for breadth-first search IEEE International Parallel and Distributed Processing Symposium (IPDPS), Orlando, FL, June 2017, pp. 32-41. report bibtex|
|article||Edgar Solomonik, Erin Carson, Nicholas Knight, and James Demmel Trade-offs between synchronization, communication, and computation in parallel linear algebra computations ACM Transactions on Parallel Computing, June 2016. bibtex|
|report||Edgar Solomonik and Torsten Hoefler Sparse tensor algebra as a parallel programming model arXiv:1512.00066 [cs.MS], November 2015. bibtex|
|report||Edgar Solomonik, James Demmel, and Torsten Hoefler Communication lower bounds for tensor contraction algorithms Technical report, ETH Zurich, January 2015. bibtex|
|report||Edgar Solomonik and James Demmel Contracting symmetric tensors using fewer multiplications Technical report, ETH Zurich, January 2015. bibtex|
|thesis||Edgar Solomonik Provably efficient algorithms for numerical tensor algebra Dissertation, University of California, Berkeley, August 2014. bibtex|
|article||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. report bibtex|
|article||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 (SPAA), Prague, Czech Republic, June 2014. report bibtex Superseded by extended journal paper|
|article||Grey Ballard, James Demmel, Laura Grigori, Mathias Jacquelin, Hong Diep Nguyen, and Edgar Solomonik Reconstructing Householder vectors from Tall-Skinny QR IEEE International Parallel and Distributed Processing Symposium (IPDPS), Phoenix, AZ, May 2014. report bibtex|
|article||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. report bibtex|
|article||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. report bibtex|
|article||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. bibtex|
|article||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. report bibtex|
|article||Edgar Solomonik and James Demmel Matrix multiplication on multidimensional torus networks Springer Lecture Notes in Computer Science (LNCS), Proceedings of VECPAR, Kobe, Japan, July 2012. report bibtex|
|report||Edgar Solomonik, Jeff Hammond, and James Demmel A preliminary analysis of Cyclops Tensor Framework EECS Department, University of California, Berkeley, March 2012. bibtex|
|article||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. report bibtex|
|article||Edgar Solomonik and James Demmel Communication-optimal parallel 2.5D matrix multiplication and LU factorization algorithms Lecture Notes in Computer Science, Euro-Par, Bordeaux, France, August 2011. "Distinguished Paper" report errata bibtex|
|article||Laxmikant Kale and Edgar Solomonik Parallel sorting Encyclopedia of Parallel Computing (pp. 1855-1862), Springer, David Padua, Ed., 2011. bibtex|
|article||Edgar Solomonik and Laxmikant V. Kale Highly scalable parallel sorting IEEE International Parallel and Distributed Processing Symposium (IPDPS), Atlanta, GA, April 2010. bibtex|
|article||Vivek Kale and Edgar Solomonik Parallel sorting pattern Workshop on Parallel Programming Patterns (ParaPLOP), March 2010. bibtex|
|article||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 (IJHPCA), November 2010. bibtex|