Author of the publication

To Push or To Pull: On Reducing Communication and Synchronization in Graph Computations.

, , , , and . HPDC, page 93-104. ACM, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

To Push or To Pull: On Reducing Communication and Synchronization in Graph Computations., , , , and . HPDC, page 93-104. ACM, (2017)Histogram Sort with Sampling., , and . SPAA, page 201-212. ACM, (2019)Betweenness Centrality is more Parallelizable than Dense Matrix Multiplication., , , and . CoRR, (2016)Communication-Avoiding Parallel Algorithms for Solving Triangular Systems of Linear Equations., , and . CoRR, (2016)Communication-Optimal Parallel 2.5D Matrix Multiplication and LU Factorization Algorithms., and . Euro-Par (2), volume 6853 of Lecture Notes in Computer Science, page 90-109. Springer, (2011)Understanding Application Performance via Micro-benchmarks on Three Large Supercomputers: Intrepid, Ranger and Jaguar., , , , and . IJHPCA, 24 (4): 411-427 (2010)Cyclops Tensor Framework: Reducing Communication and Eliminating Load Imbalance in Massively Parallel Contractions., , , and . IPDPS, page 813-824. IEEE Computer Society, (2013)Highly scalable parallel sorting., and . IPDPS, page 1-12. IEEE, (2010)Accelerating Alternating Least Squares for Tensor Decomposition by Pairwise Perturbation., and . CoRR, (2018)Communication-Avoiding Cholesky-QR2 for Rectangular Matrices., and . IPDPS, page 89-100. IEEE, (2019)