Остановите войну!
for scientists:
default search action
Edgar Solomonik
- > Home > Persons > Edgar Solomonik
Publications
- 2023
- [c34]Toluwanimi O. Odemuyiwa, Hadi Asghari Moghaddam, Michael Pellauer, Kartik Hegde, Po-An Tsai, Neal Clayton Crago, Aamer Jaleel, John D. Owens, Edgar Solomonik, Joel S. Emer, Christopher W. Fletcher:
Accelerating Sparse Data Orchestration via Dynamic Reflexive Tiling. ASPLOS (3) 2023: 18-32 - [c33]Andreas Irmler, Raghavendra Kanakagiri, Sebastian T. Ohlmann, Edgar Solomonik, Andreas Grüneis:
Optimizing Distributed Tensor Contractions Using Node-Aware Processor Grids. Euro-Par 2023: 710-724 - [c32]Toluwanimi O. Odemuyiwa, Hadi Asghari Moghaddam, Michael Pellauer, Kartik Hegde, Po-An Tsai, Neal Clayton Crago, Aamer Jaleel, John D. Owens, Edgar Solomonik, Joel S. Emer, Christopher W. Fletcher:
Accelerating Sparse Data Orchestration via Dynamic Reflexive Tiling (Extended Abstract). HOPC@SPAA 2023: 15-16 - [c30]Wentao Yang, Vipul Harsh, Edgar Solomonik:
Optimal Round and Sample-Size Complexity for Partitioning in Parallel Sorting. SPAA 2023: 467-478 - [i33]Raghavendra Kanakagiri, Edgar Solomonik:
Minimum Cost Loop Nests for Contraction of a Sparse Tensor with a Tensor Network. CoRR abs/2307.05740 (2023) - [i32]Andreas Irmler, Raghavendra Kanakagiri, Sebastian T. Ohlmann, Edgar Solomonik, Andreas Grüneis:
Optimizing Distributed Tensor Contractions using Node-Aware Processor Grids. CoRR abs/2307.08829 (2023) - 2022
- [c27]Tim Baer, Raghavendra Kanakagiri, Edgar Solomonik:
Parallel Minimum Spanning Forest Computation using Sparse Matrix Kernels. PPSC 2022: 72-83 - [i30]Wentao Yang, Vipul Harsh, Edgar Solomonik:
Optimal Round and Sample-Size Complexity for Partitioning in Parallel Sorting. CoRR abs/2204.04599 (2022) - 2021
- [j6]Edgar Solomonik, James Demmel:
Fast Bilinear Algorithms for Symmetric Tensor Contractions. Comput. Methods Appl. Math. 21(1): 211-231 (2021) - [j4]Edgar Solomonik, James Demmel, Torsten Hoefler:
Communication Lower Bounds of Bilinear Algorithms for Symmetric Tensor Contractions. SIAM J. Sci. Comput. 43(5): A3328-A3356 (2021) - [i20]Tim Baer, Raghavendra Kanakagiri, Edgar Solomonik:
Parallel Minimum Spanning Forest Computation using Sparse Matrix Kernels. CoRR abs/2110.04865 (2021) - 2020
- [c21]Maciej Besta, Raghavendra Kanakagiri, Harun Mustafa, Mikhail Karasikov, Gunnar Rätsch, Torsten Hoefler, Edgar Solomonik:
Communication-Efficient Jaccard similarity for High-Performance Distributed Genome Comparisons. IPDPS 2020: 1122-1132 - [i15]Maciej Besta, Florian Marending, Edgar Solomonik, Torsten Hoefler:
SlimSell: A Vectorizable Graph Representation for Breadth-First Search. CoRR abs/2010.09913 (2020) - [i13]Maciej Besta, Michal Podstawski, Linus Groner, Edgar Solomonik, Torsten Hoefler:
To Push or To Pull: On Reducing Communication and Synchronization in Graph Computations. CoRR abs/2010.16012 (2020) - 2019
- [c17]Kartik Hegde, Hadi Asghari Moghaddam, Michael Pellauer, Neal Clayton Crago, Aamer Jaleel, Edgar Solomonik, Joel S. Emer, Christopher W. Fletcher:
ExTensor: An Accelerator for Sparse Tensor Algebra. MICRO 2019: 319-333 - [c16]Vipul Harsh, Laxmikant V. Kalé, Edgar Solomonik:
Histogram Sort with Sampling. SPAA 2019: 201-212 - [i9]Maciej Besta, Raghavendra Kanakagiri, Harun Mustafa, Mikhail Karasikov, Gunnar Rätsch, Torsten Hoefler, Edgar Solomonik:
Communication-Efficient Jaccard Similarity for High-Performance Distributed Genome Comparisons. CoRR abs/1911.04200 (2019) - 2018
- [i8]Vipul Harsh, Laxmikant V. Kalé, Edgar Solomonik:
Histogram Sort with Sampling. CoRR abs/1803.01237 (2018) - 2017
- [c15]Maciej Besta, Michal Podstawski, Linus Groner, Edgar Solomonik, Torsten Hoefler:
To Push or To Pull: On Reducing Communication and Synchronization in Graph Computations. HPDC 2017: 93-104 - [c14]Maciej Besta, Florian Marending, Edgar Solomonik, Torsten Hoefler:
SlimSell: A Vectorizable Graph Representation for Breadth-First Search. IPDPS 2017: 32-41 - [c13]Tobias Wicky, Edgar Solomonik, Torsten Hoefler:
Communication-Avoiding Parallel Algorithms for Solving Triangular Systems of Linear Equations. IPDPS 2017: 678-687 - [c12]Edgar Solomonik, Maciej Besta, Flavio Vella, Torsten Hoefler:
Scaling betweenness centrality using communication-efficient sparse matrix multiplication. SC 2017: 47 - [c11]Edgar Solomonik, Grey Ballard, James Demmel, Torsten Hoefler:
A Communication-Avoiding Parallel Algorithm for the Symmetric Eigenvalue Problem. SPAA 2017: 111-121 - [e1]Martin Elsman, Clemens Grelck, Andreas Klöckner, David A. Padua, Edgar Solomonik:
Proceedings of the 4th ACM SIGPLAN International Workshop on Libraries, Languages, and Compilers for Array Programming, ARRAY@PLDI 2017, Barcelona, Spain, June 18, 2017. ACM 2017, ISBN 978-1-4503-5069-3 [contents] - [i6]Edgar Solomonik, James Demmel, Torsten Hoefler:
Communication Lower Bounds of Bilinear Algorithms for Symmetric Tensor Contractions. CoRR abs/1707.04618 (2017) - 2016
- [i4]Edgar Solomonik, Grey Ballard, James Demmel, Torsten Hoefler:
A communication-avoiding parallel algorithm for the symmetric eigenvalue problem. CoRR abs/1604.03703 (2016) - [i3]Edgar Solomonik, Maciej Besta, Flavio Vella, Torsten Hoefler:
Betweenness Centrality is more Parallelizable than Dense Matrix Multiplication. CoRR abs/1609.07008 (2016) - [i2]Tobias Wicky, Edgar Solomonik, Torsten Hoefler:
Communication-Avoiding Parallel Algorithms for Solving Triangular Systems of Linear Equations. CoRR abs/1612.01855 (2016) - 2015
- [i1]Edgar Solomonik, Torsten Hoefler:
Sparse Tensor Algebra as a Parallel Programming Model. CoRR abs/1512.00066 (2015) - 2014
- [j2]Edgar Solomonik, Devin Matthews, Jeff R. Hammond, John F. Stanton, James Demmel:
A massively parallel tensor contraction framework for coupled-cluster computations. J. Parallel Distributed Comput. 74(12): 3176-3190 (2014) - [c10]Grey Ballard, James Demmel, Laura Grigori, Mathias Jacquelin, Hong Diep Nguyen, Edgar Solomonik:
Reconstructing Householder Vectors from Tall-Skinny QR. IPDPS 2014: 1159-1170 - [c9]Edgar Solomonik, Erin C. Carson, Nicholas Knight, James Demmel:
Tradeoffs between synchronization, communication, and computation in parallel linear algebra computations. SPAA 2014: 307-318 - 2013
- [c8]Edgar Solomonik, Aydin Buluç, James Demmel:
Minimizing Communication in All-Pairs Shortest Paths. IPDPS 2013: 548-559 - [c7]Edgar Solomonik, Devin Matthews, Jeff R. Hammond, James Demmel:
Cyclops Tensor Framework: Reducing Communication and Eliminating Load Imbalance in Massively Parallel Contractions. IPDPS 2013: 813-824 - [c6]Michael B. Driscoll, Evangelos Georganas, Penporn Koanantakool, Edgar Solomonik, Katherine A. Yelick:
A Communication-Optimal N-Body Algorithm for Direct Interactions. IPDPS 2013: 1075-1084 - 2012
- [c5]Evangelos Georganas, Jorge González-Domínguez, Edgar Solomonik, Yili Zheng, Juan Touriño, Katherine A. Yelick:
Communication avoiding and overlapping for numerical linear algebra. SC 2012: 100 - [c4]Edgar Solomonik, James Demmel:
Matrix Multiplication on Multidimensional Torus Networks. VECPAR 2012: 201-215 - 2011
- [c3]Edgar Solomonik, James Demmel:
Communication-Optimal Parallel 2.5D Matrix Multiplication and LU Factorization Algorithms. Euro-Par (2) 2011: 90-109 - [c2]Edgar Solomonik, Abhinav Bhatele, James Demmel:
Improving communication performance in dense linear algebra via topology aware collectives. SC 2011: 77:1-77:11 - [r1]Laxmikant V. Kalé, Edgar Solomonik:
Sorting. Encyclopedia of Parallel Computing 2011: 1855-1862 - 2010
- [j1]Abhinav Bhatele, Lukasz Wesolowski, Eric J. Bohm, Edgar Solomonik, Laxmikant V. Kalé:
Understanding Application Performance via Micro-benchmarks on Three Large Supercomputers: Intrepid, Ranger and Jaguar. Int. J. High Perform. Comput. Appl. 24(4): 411-427 (2010) - [c1]Edgar Solomonik, Laxmikant V. Kalé:
Highly scalable parallel sorting. IPDPS 2010: 1-12
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-01-09 20:41 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint