Personal information

No personal information available

Activities

Works (13)

Network Topologies and Inevitable Contention

2016 First International Workshop on Communication Optimizations in HPC (COMHPC)
2016-11 | Conference paper
Contributors: Grey Ballard; James Demmel; Andrew Gearhart; Benjamin Lipshitz; Yishai Oltchik; Oded Schwartz; Sivan Toledo
Source: Self-asserted source
Benjamin Lipshitz

Improving the Numerical Stability of Fast Matrix Multiplication

SIAM Journal on Matrix Analysis and Applications
2016-01 | Journal article
Part of ISSN: 0895-4798
Part of ISSN: 1095-7162
Contributors: Grey Ballard; Austin R. Benson; Alex Druinsky; Benjamin Lipshitz; Oded Schwartz
Source: Self-asserted source
Benjamin Lipshitz

Parallelizing Gaussian Process Calculations in<i>R</i>

Journal of Statistical Software
2015 | Journal article
Part of ISSN: 1548-7660
Contributors: Christopher J. Paciorek; Benjamin Lipshitz; Wei Zhuo; Prabhat; Cari G. Kaufman; Rollin C. Thomas
Source: Self-asserted source
Benjamin Lipshitz

Contention Bounds for Combinations of Computation Graphs and Network Topologies

2014-08-08 | Report
Contributors: Grey Ballard; James Demmel; Andrew Gearhart; Benjamin Lipshitz; Oded Schwartz; Sivan Toledo
Source: Self-asserted source
Benjamin Lipshitz

Communication efficient gaussian elimination with partial pivoting using a shape morphing data layout

Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
2013-07-23 | Conference paper
Contributors: Grey Ballard; James Demmel; Benjamin Lipshitz; Oded Schwartz; Sivan Toledo
Source: Self-asserted source
Benjamin Lipshitz

Communication optimal parallel multiplication of sparse random matrices

Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
2013-07-23 | Conference paper
Contributors: Grey Ballard; Aydin Buluc; James Demmel; Laura Grigori; Benjamin Lipshitz; Oded Schwartz; Sivan Toledo
Source: Self-asserted source
Benjamin Lipshitz

Communication-Optimal Parallel Recursive Rectangular Matrix Multiplication

2013 IEEE 27th International Symposium on Parallel and Distributed Processing
2013-05 | Conference paper
Contributors: James Demmel; David Eliahu; Armando Fox; Shoaib Kamil; Benjamin Lipshitz; Oded Schwartz; Omer Spillinger
Source: Self-asserted source
Benjamin Lipshitz

Perfect Strong Scaling Using No Additional Energy

2013 IEEE 27th International Symposium on Parallel and Distributed Processing
2013-05 | Conference paper
Contributors: James Demmel; Andrew Gearhart; Benjamin Lipshitz; Oded Schwartz
Source: Self-asserted source
Benjamin Lipshitz

Graph Expansion Analysis for Communication Costs of Fast Rectangular Matrix Multiplication

Lecture Notes in Computer Science
2012 | Book chapter
Part of ISBN: 9783642348617
Part of ISBN: 9783642348624
Part of ISSN: 0302-9743
Part of ISSN: 1611-3349
Contributors: Grey Ballard; James Demmel; Olga Holtz; Benjamin Lipshitz; Oded Schwartz
Source: Self-asserted source
Benjamin Lipshitz

Communication-Avoiding Parallel Strassen: Implementation and performance

2012 International Conference for High Performance Computing, Networking, Storage and Analysis
2012-11 | Conference paper
Contributors: Benjamin Lipshitz; Grey Ballard; James Demmel; Oded Schwartz
Source: Self-asserted source
Benjamin Lipshitz

Poster: Beating MKL and ScaLAPACK at Rectangular Matrix Multiplication Using the BFS/DFS Approach

2012 SC Companion: High Performance Computing, Networking Storage and Analysis
2012-11 | Conference poster
Contributors: James Demmel; David Eliahu; Armando Fox; Shoaib Kamil; Benjamin Lipshitz; Oded Schwartz; Omer Spillinger
Source: Self-asserted source
Benjamin Lipshitz

Communication-optimal parallel algorithm for strassen's matrix multiplication

Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
2012-06-25 | Conference paper
Contributors: Grey Ballard; James Demmel; Olga Holtz; Benjamin Lipshitz; Oded Schwartz
Source: Self-asserted source
Benjamin Lipshitz

strong scaling of matrix multiplication algorithms and memory-independent communication lower bounds

Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
2012-06-25 | Conference paper
Contributors: Grey Ballard; James Demmel; Olga Holtz; Benjamin Lipshitz; Oded Schwartz
Source: Self-asserted source
Benjamin Lipshitz