Edgar Solomonik

Associate Professor
Department of Computer Science
University of Illinois at Urbana-Champaign


Research Group: Laboratory for Parallel Numerical Algorithms (LPNA)

Contact Information

solomon2@illinois.edu
4229 Thomas M. Siebel Center for Computer Science
201 North Goodwin Avenue
Urbana, IL 61801-2302
217-300-4794

Teaching


(Spring 2023, Spring 2021, Spring 2018, Fall 2018) CS 450: Numerical Analysis


(Fall 2020, Spring 2022) CS 598: Tensor Computations


(Spring 2020) CS 598: Provably Efficient Algorithms for Numerical and Combinatorial Problems



(Fall 2017, Fall 2019, Fall 2021) CS 554: Parallel Numerical Algorithms



(Spring 2017) CS 357: Numerical Methods
ICES scores: Spring 2017



(Fall 2016) CS 598: Communication Cost Analysis of Algorithms
ICES scores: Fall 2016

Software

Cyclops Tensor Framework
algebraic parallel programming

CANDMC
distributed-memory matrix factorization algorithms
For more software efforts I am involved in, see Cyclops community software and my github page.

Research Interests

numerical linear algebra
parallel algorithms
tensor networks
tensor decompositions
communication-avoiding algorithms
communication lower bounds
high performance computing
parallel programming systems
computational quantum chemistry
graph algorithms
quantum algorithms
bilinear algorithms

Fellowships and Awards

C.W. Gear Outstanding Junior Faculty Award 2021
Dean's Award For Excellence in Research 2021
SIAM Activity Group on Supercomputing Early Career Prize 2020
IEEE CS TCHPC Award for Excellence for Early Career Researchers in High Performance Computing 2018
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

Previous Affiliations

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

Publications / CV

For a pdf form of my list of publications, please refer to my CV. For publications lead by students in our group, please see the LPNA webpage. Selected publications are marked in red.
article Caleb Ju, Yifan Zhang, and Edgar Solomonik Communication lower bounds for nested bilinear algorithms Foundations of Computational Mathematics (FoCM), 2023.
article Andreas Irmler, Raghavendra Kanakagiri, Sebastian T. Ohlmann, Edgar Solomonik, and Andreas Grueneis Optimizing distributed tensor contractions using node-aware processor grids Lecture Notes in Computer Science, Euro-Par, August 2023.
article Raghavendra Kanakagiri and Edgar Solomonik Minimum cost loop nests for contraction of a sparse tensor with a tensor network arXiv:2307.05740 [cs.DC], July 2023.
article Caleb Ju, Serif Yesil, Mengyuan Sun, Chandra Chekuri, and Edgar Solomonik Efficient parallel implementation of the multiplicative weight update method for graph-based linear programs arXiv:2307.03307 [cs.DC], July 2023.
article Navjot Singh and Edgar Solomonik. Alternating Mahalanobis distance minimization for stable and accurate CP decomposition SIAM Journal of Scientific Computing (SISC), 2023.
article Edward Hutter and Edgar Solomonik. High-dimensional performance modeling via tensor completion ACM/IEEE Supercomputing Conference (SC), November 2023.
article Wentao Yang, Vipul Harsh, and Edgar Solomonik. Optimal round and sample-size complexity for partitioning in parallel sorting ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), June 2023.
article Toluwanimi O. Odemuyiwa, Hadi Asghari-Moghaddam, Michael Pellauer, Kartik Hegde, Po-An Tsai, Neal C. Crago, Aamer Jaleel, Edgar Solomonik, Joel S. Emer, and Christopher W. Fletcher Accelerating sparse data orchestration via dynamic reflexive tiling ACM International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS), March 2023.
article Yang Gao, Phillip Helms, Garnet Kin-Lic Chan, and Edgar Solomonik. Automatic transformation of irreducible representations for efficient contraction of tensors with cyclic group symmetry SciPost Physics Codebases, September 2022.
article Louis Schatzki, Linjian Ma, Edgar Solomonik, Eric Chitambar Tensor rank and other multipartite entanglement measures of graph states arXiv:2209.06320 [quant.ph], September 2022.
article Linjian Ma and Edgar Solomonik Cost-efficient Gaussian tensor network embeddings for tensor-structured inputs Conference on Neural Information Processing Systems (NeurIPS), 2022.
article Chaoqi Yang, Cheng Qian, Navjot Singh, Cao Xiao, Brandon Westover, Edgar Solomonik, Jimeng Sun Augmented tensor decomposition with stochastic optimization Conference on Neural Information Processing Systems (NeurIPS), 2022.
article Samah Karim and Edgar Solomonik Efficient preconditioners for interior point methods via a new Schur-complement-based strategy SIAM Journal on Matrix Analysis and Applications (SIMAX), 2022.
article Navjot Singh, Zecheng Zhang, Xiaoxiao Wu, Naijing Zhang, Siyuan Zhang, and Edgar Solomonik Distributed-memory tensor completion for generalized loss functions in Python using new sparse tensor kernels Journal of Parallel and Distributed Computing (JPDC), 2022.
article Linjian Ma and Edgar Solomonik Accelerating alternating least squares for tensor decomposition by pairwise perturbation Numerical Linear Algebra with Applications (NLAA), 2022.
article Tim Baer, Raghavendra Kanakagiri, and Edgar Solomonik Parallel minimum spanning forest computation using sparse matrix kernels SIAM Conference of Parallel Processing for Scientific Computing (SIAM PP), 2022.
article Caleb Ju, Yifan Zhang, and Edgar Solomonik Communication lower bounds for nested bilinear algorithms arXiv:2107.09834 [cs.DC], July 2021.
article Linjian Ma and Edgar Solomonik Fast and accurate randomized algorithms for low-rank tensor decompositions Conference on Neural Information Processing Systems (NeurIPS), 2021.
article Chaoqi Yang, Navjot Singh, Cao Xiao, Cheng Qian, Edgar Solomonik, Jimeng Sun MTC: Multiresolution tensor completion from partial and coarse observations ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), 2021.
article Edgar Solomonik, James Demmel, and Torsten Hoefler Communication lower bounds of bilinear algorithms for symmetric tensor contractions SIAM Journal of Scientific Computing (SISC), 2021.
article Edward Hutter and Edgar Solomonik Confidence-based approximation for performance prediction using execution path analysis IEEE International Parallel and Distributed Processing Symposium (IPDPS), May 2021.
article Linjian Ma and Edgar Solomonik Efficient parallel CP decomposition with pairwise perturbation and multi-sweep dimension tree IEEE International Parallel and Distributed Processing Symposium (IPDPS), May 2021.
article Yang Gao, Phillip Helms, Garnet Kin-Lic Chan, and Edgar Solomonik Automatic transformation of irreducible representations for efficient contraction of tensors with cyclic group symmetry arXiv:2007.08056 [physics.comp-ph], July 2020.
article Ryan Levy, Edgar Solomonik, and Bryan Clark Distributed-memory DMRG via sparse and dense parallel tensor contractions ACM/IEEE Supercomputing Conference (SC), Atlanta, GA, November 2020.
article Yuchen Pang, Tianyi Hao, Annika Dugad, Yiqing Zhou, and Edgar Solomonik Efficient 2D tensor network simulation of quantum systems ACM/IEEE Supercomputing Conference (SC), Atlanta, GA, November 2020.
article Linjian Ma, Jiayu Ye, and Edgar Solomonik AutoHOOT: Automatic High-Order Optimization for Tensors International Conference on Parallel Architectures and Compilation Techniques (PACT), October 2020.
article Caleb Ju and Edgar Solomonik Derivation and analysis of fast bilinear algorithms for convolution SIAM Review, 2020.
article Edgar Solomonik and James Demmel Fast bilinear algorithms for symmetric tensor contractions Computational Methods in Applied Mathematics (CMAM), 2020. report
article Yifan Zhang and Edgar Solomonik On stability of tensor networks and canonical forms arXiv:2001.01191 [math.NA], January 2020.
article Maciej Besta, Raghavendra Kanakagiri, Harun Mustafa, Mikhail Karasikov, Gunnar Rätsch, Torsten Hoefler, and Edgar Solomonik Communication-efficient Jaccard similarity for high-performance distributed genome comparisons IEEE International Parallel and Distributed Processing Symposium (IPDPS), May 2020.
article Navjot Singh, Linjian Ma, Hongru Yang, and Edgar Solomonik Comparison of accuracy and scalability of Gauss-Newton and alternating least squares for CP decomposition SIAM Journal of Scientific Computing (SISC), October 2019.
article Kartik Hegde, Hadi Asghari-Moghaddam, Michael Pellauer, Neal Crago, Aamer Jaleel, Edgar Solomonik, Joel Emer, and Christopher W. Fletcher ExTensor: An accelerator for sparse tensor algebra IEEE/ACM International Symposium on Microarchitecture (MICRO), October 2019.
article Vipul Harsh, Laxmikant Kale, and Edgar Solomonik Histogram sort with sampling 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, Phoenix, AZ, USA, June 2019.
article Edward Hutter and Edgar Solomonik Communication-avoiding Cholesky-QR2 for rectangular matrices IEEE International Parallel and Distributed Processing Symposium (IPDPS), Rio de Jianero, Brazil, May, 2019.
article Edwin Pednault, John A. Gunnels, Giacomo Nannicini, Lior Horesh, Thomas Magerlein, Edgar Solomonik, Erik Draeger, Eric Holland, and Robert Wisnieff Breaking the 49-qubit barrier in the simulation of quantum circuits arXiv:1710.05867 [quant-ph], October 2017.
article Edgar Solomonik, Maciej Besta, Flavio Vella, and Torsten Hoefler Scaling betweenness centrality using communication-efficient sparse matrix multiplication ACM/IEEE Supercomputing Conference (SC), Denver, Colorado, November 2017. report errata
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
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 (HPDC), ACM, New York, NY, USA, 93-104, June 2017. report
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
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
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 (TOPC), June 2016.
article Edgar Solomonik and Torsten Hoefler Sparse tensor algebra as a parallel programming model arXiv:1512.00066 [cs.MS], November 2015.
thesis Edgar Solomonik Provably efficient algorithms for numerical tensor algebra Dissertation, University of California, Berkeley, August 2014.
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 Superseded by extended journal paper
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
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
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
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
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.
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 (SC), Salt Lake City, Utah, November 2012. report
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
article Edgar Solomonik, Jeff Hammond, and James Demmel A preliminary analysis of Cyclops Tensor Framework EECS Department, University of California, Berkeley, March 2012.
article Edgar Solomonik, Abhinav Bhatele, and James Demmel Improving communication performance in dense linear algebra via topology aware collectives ACM/IEEE Supercomputing Conference (SC), Seattle, WA, November 2011. report
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
article Laxmikant Kale and Edgar Solomonik Parallel sorting Encyclopedia of Parallel Computing (pp. 1855-1862), Springer, David Padua, Ed., 2011.
article Edgar Solomonik and Laxmikant V. Kale Highly scalable parallel sorting IEEE International Parallel and Distributed Processing Symposium (IPDPS), Atlanta, GA, April 2010.
article Vivek Kale and Edgar Solomonik Parallel sorting pattern Workshop on Parallel Programming Patterns (ParaPLOP), March 2010.
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.

Talks

slides January 2024; Lehigh University; Optimization Methods for Tensor Decomposition

slides March 2023; SIAM CSE; Amsterdam, NL; Faster Accurate Sketching for Tensor Networks

slides September 2022;Scaling Numerical Algorithms and Software via Improved Performance Modeling; ICL seminar, University of Tennessee

slides September 2022; Efficient Algorithms via Inexact Linear Solvers and Randomized Sampling; SIAM ACDA Workshop CAES-CNRS

slides May 2022; CECAM Workshop on Quantum Chemistry Methods for Materials Science; Tensor Software and Algorithms for Quantum Chemistry

slides December 2021; MolSSI Workshop on HPC in Computational Chemistry and Materials Science; Tensor Algorithms and Libraries for Quantum Chemistry and Materials Science

slides October 2021; E-NLA seminar; Efficient Inexact Solvers in Numerical Optimization Methods

slides July 2021; SIAM Annual Meeting; Communication Lower Bounds for Bilinear Algorithms

slides May 2021; Quantum Information for Mathematics, Economics, and Statistics; IMSI, IL USA; Tensor Optimization Libraries and Algorithms for Quantum Simulation

slides March 2021; SIAM CSE; New Methods and Software for Tensor Computations

slides February 2021; Fast Code seminar; Scalable Algorithms for Tensor Computations

slides October 2020; SPCL_Bcast(COMM_WORLD) seminar; High Performance Tensor Computations

slides July 2020; IQUIST seminar; UIUC Tensor Algorithms and Software on Quantum Simulation

slides February 2020; SIAM PP; Seattle WA, USA; Scalable Algorithms for Tensor Computations

slides December 2019; University of Utah; Utah, USA; Scalable Algorithms for Tensor Computations

slides March 2019; SIAM CSE; Spokane WA, USA; Accelerating Alternating Least Squares for Tensor Decomposition by Pairwise Perturbation

slides January 2019; Invited Workshop on Compiler Techniques for Sparse Tensor Algebra; Cambridge MA, USA; Scalable Tensor Computations with Cyclops and Faster Algorithms for Alternating Least Squares

slides January 2019; Enabling Quantum Leap: Quantum algorithms for quantum chemistry and materials; Alexandria VA, USA; Classical Computer Science and Quantum Computing: High Performance Computing and Quantum Simulation

slides November 2018; Conference on Sparse Direct Solvers; Purdue; Lafayette IN, USA; Comunication-avoiding factorization algorithms

slides demo July 2018; PASC; Basel, Switzerland; Parallel Tensor Computations in Python or C++ Using Cyclops

slides demo June 2018; PMAA keynote talk; Zurich, Switzerland; Scalable Tensor Algorithms for Scientific Computing

slides March 2018; American Chemical Society (ACS) Annual Meeting; New Orleans LA, USA; Scalable Quantum Chemistry with Cyclops

slides Nov 2017; Supercomputing; Denver CO, USA; Scaling betweenness centrality using communication-efficient sparse matrix multiplication

slides Oct 2017; Seminar; Argonne National Laboratory; Argonne IL, USA; A massively parallel library for matrix and tensor algorithms

slides Sep 2017; Theory Seminar; University of Illinois at Urbana-Champaign; Urbana IL, USA; Strassen-like algorithms for symmetric tensor contractions

slides demo Sep 2017; Simons CCQ Tensor Network Workshop; New York NY, USA; Leveraging sparsity and symmetry in parallel tensor contractions

slides July 2017; SPAA; Washington DC, USA; A communication-avoiding parallel algorithm for the symmetric eigenvalue problem

slides June 2017; Householder prize lecture; Blacksburg VA, USA; Towards an algebraic formalism for scalable numerical algorithms

slides June 2017; Householder Symposium XX; Blacksburg VA, USA; A communication-avoiding parallel algorithm for the symmetric eigenvalue problem

slides May 2017; Illinois Data Science Fundamentals Summit; Urbana IL, USA; Scalable numerical linear algebra for data science

slides May 2017; MolSSI Workshop on Core Software Blocks in Quantum Chemistry: Tensors and Integrals; Monterey Bay CA, USA; An Overview of Cyclops Tensor Framework

slides April 2017; Scientific and Statistcal Computing Seminar; University of Chicago; Chicago IL, USA; Strassen-like algorithms for symmetric tensor contractions

slides March 2017; Theory Seminar; University of Illinois at Urbana-Champaign; Urbana IL, USA; Communication cost models and a few lower and upper bounds

slides February 2017; SIAM CSE; Atlanta GA, USA; A distributed memory library for sparse tensor functions and contractions

slides July 2016; ISTCP; Grand Forks ND, USA; Developing scalable and portable electronic structure methods with Cyclops Tensor Framework

slides April 2016; Charm++ Workshop; University of Illinois at Urbana-Champaign; Urbana IL, USA; A parallel library for multidimensional array computations with runtime tuning

slides April 2016; SIAM PP; Paris, France; Low rank bilinear algorithms for symmetric tensor contractions

slides March 2016; University of California, Davis; Davis CA, USA; Provably efficient algorithms for multilinear algebra

slides March 2016; University of Toronto; Toronto ON, Canada; Algorithms as multilinear tensor equations

slides March 2016; University of Illinois at Urbana-Champaign; Urbana IL, USA; Algorithms as multilinear tensor equations

slides March 2016; Stony Brook University; Stony Brook NY, USA; Algorithms as multilinear tensor equations

slides February 2016; California Institute of Technology; Pasadena CA, USA; Algorithms as multilinear tensor equations

slides February 2016; University of Colorado, Boulder; Boulder CO, USA; Algorithms as multilinear tensor equations

slides February 2016; Georgia Institute of Technology; Atlanta GA, USA; Algorithms as multilinear tensor equations

slides February 2016; Cornell University; Ithaca NY, USA; Provably efficient algorithms as tensor equations

slides January 2016; TU München; Munich, Germany; Algorithms as multilinear tensor equations

slides December 2015; Guest Lecture; Design of Parallel and High-Performance Computing; ETH Zurich, Switzerland; Distributed-memory models and algorithms

slides November 2015; MATHICSE Institute Seminar; EPFL; Lausanne, Switzerland; Provably efficient algorithms for tensor computations

slides October 2015; SIAM LA; Atlanta GA, USA; Minimizing communication in tensor contraction algorithms

slides October 2015; DMML; Berkeley CA, USA; Communication lower bounds for numerical tensor algebra

slides June 2015; QESC; Kobe, Japan; Efficient tensor contraction algorithms for coupled cluster

slides February 2015; Max-Planck-Institute for Chemical Energy Conversion; Mülheim, Germany; Efficient algorithms for tensor contractions in coupled-cluster

slides December 2014; Guest Lecture; Design of Parallel and High-Performance Computing; ETH Zurich, Switzerland; Distributed-memory models and algorithms

slides August 2014; Dissertation talk; Berkeley CA, USA; Provably efficient algorithms for numerical tensor algebra

slides July 2014; DOE CSGF Program Review; Washington DC, USA; Minimizing communication in numerical linear algebra

slides June 2014; SPAA; Prague, Czech Republic; Tradeoffs between synchronization, communication, and computation in parallel linear algebra computations

slides June 2014; ETH Zurich, Switzerland; Algorithms for contraction of tensors over a commutative ring

slides June 2014; Householder Symposium XIX; Spa, Belgium; Contracting symmetric tensors via fully-symmetric intermediates

slides Feb 2014; LBNL, Berkeley, CA; Cyclops Tensor Framework

slides Feb 2014; SIAM PP; Portland, OR; Tradeoffs between synchronization, communication, and work in parallel linear algebra computations

slides Feb 2014; Berkeley, CA; Tradeoffs between synchronization, communication, and work in parallel schedules

slides Feb 2014; Berkeley, CA; Fast tensor contraction algorithms for Coupled Cluster

slides Dec 2013; Laguna Beach, CA; A distributed-memory framework for tensor contractions

slides Dec 2013; Berkeley, USA; A framework for mapping and redistribution of multidimensional distributed arrays

slides Oct 2013; Berkeley, USA; Communication-avoiding algorithms for dense matrix factorizations

slides Oct 2013; Berkeley, CA; Efficient algorithms for symmetric tensor contractions

slides June 2013; ETH Zurich; Switzerland; Communication-avoiding parallel algorithms for dense linear algebra

slides June 2013; Swiss National Supercomputing Center; Lugano, Switzerland; Communication-avoiding parallel numerical algorithms for dense matrices and tensors

slides May 2013; IPDPS; Boston, USA; Cyclops Tensor Framework: reducing communication and eliminating load imbalance in massively parallel contractions

slides May 2013; IPDPS; Boston, USA; Minimizing communication in all-pairs shortest paths

slides March 2013; SIAM CSE; Boston, USA; Scalable numerical algorithms for electronic structure calculations

slides February 2013; Berkeley, USA; Communication-avoiding parallel algorithms for dense linear algebra and tensor computations

slides January 2013; University of Southern California; LA, USA; A parallel tensor framework for Coupled Cluster

slides Sep. 2012; seminar; Lawrence Livermore National Laboratory; Livermore, CA; Scalable numerical algorithms for electronic structure calculations

slides July 2012; University of Tokyo; Tokyo, Japan; 2.5D algorithms for distributed-memory computing

slides July 2012; VECPAR; Kobe, Japan; Matrix multiplication on multidimensional torus networks

slides June 2012; SIAM ALA; Valencia, Spain; 2.5D Algorithms for dense linear algebra

slides Feb. 2012; SIAM PP; Savannah, GA; Topology-aware parallel algorithms for symmetric tensor contractions

slides Nov. 2011; ACM/IEEE Supercomputing; Seattle, WA; Improving communication performance in dense linear algebra via topology-aware collectives

slides Sep. 2011; CS 294 lecture; Berkeley, CA; 2.5D algorithms: from hardware to theory and back

slides Sep. 2011; Bordeaux, France; Communication-optimal parallel 2.5D matrix multiplication and LU factorization algorithms

slides Aug. 2011; seminar; Argonne National Laboratory; Argonne, IL; Reducing communication in dense matrix/tensor computations

slides Apr. 2010; IPDPS; Atlanta, GA; Highly scalable parallel sorting

Posters

poster Jul. 2013; CSGF conference; Arlington, VA; Cyclops Tensor Framework.

poster Jul. 2011; CSGF conference; Arlington, VA; 2.5D algorithms for dense linear algebra

poster Nov. 2009; ACM/IEEE Supercomputing; Portland, OR Performance comparison of Intrepid, Jaguar and Ranger using scientific applications