-
1
-
-
0029370767
-
A three-dimensional approach to parallel matrix multiplication
-
September
-
R. Agarwal, S. Balle, F. Gustavson, M. Joshi, and P. Palkar. A three-dimensional approach to parallel matrix multiplication. IBM Journal of Research and Development, 39(5):575 -582, September 1995.
-
(1995)
IBM Journal of Research and Development
, vol.39
, Issue.5
, pp. 575-582
-
-
Agarwal, R.1
Balle, S.2
Gustavson, F.3
Joshi, M.4
Palkar, P.5
-
2
-
-
84864146488
-
Brief announcement: Strong scaling of matrix multiplication algorithms and memory-independent communication lower bounds
-
New York, NY, USA, ACM.
-
G. Ballard, J. Demmel, O. Holtz, B. Lipshitz, and O. Schwartz. Brief announcement: Strong scaling of matrix multiplication algorithms and memory-independent communication lower bounds. In Proceedings of the 24th A CM Symposium on Parallelism in Algorithms and Architectures, SPAA '12, pages 77-79, New York, NY, USA, 2012. ACM.
-
(2012)
Proceedings of the 24th a CM Symposium on Parallelism in Algorithms and Architectures, SPAA '12
, pp. 77-79
-
-
Ballard, G.1
Demmel, J.2
Holtz, O.3
Lipshitz, B.4
Schwartz, O.5
-
3
-
-
84864147291
-
-
Communication-optimal parallel algorithm for Strassen's matrix multiplication. New York, NY, USA, ACM.
-
G. Ballard, J. Demmel, O. Holtz, B. Lipshitz, and O. Schwartz. Communication-optimal parallel algorithm for Strassen's matrix multiplication. In Proceedings of the 24th A CM Symposium on Parallelism in Algorithms and Architectures, SPAA '12, pages 193-204, New York, NY, USA, 2012. ACM.
-
(2012)
Proceedings of the 24th a CM Symposium on Parallelism in Algorithms and Architectures, SPAA '12
, pp. 193-204
-
-
Ballard, G.1
Demmel, J.2
Holtz, O.3
Lipshitz, B.4
Schwartz, O.5
-
4
-
-
80054034521
-
Minimizing communication in numerical linear algebra
-
G. Ballard, J. Demmel, O. Holtz, and O. Schwartz. Minimizing communication in numerical linear algebra. SIAM. J. Matrix Anal. & Appl, 32:pp. 866-901, 2011.
-
(2011)
SIAM. J. Matrix Anal. & Appl
, vol.32
, pp. 866-901
-
-
Ballard, G.1
Demmel, J.2
Holtz, O.3
Schwartz, O.4
-
5
-
-
0004185470
-
-
Second Edition. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA
-
W. Briggs, V. Henson, and S. McCormick. A Multigrid Tutorial: Second Edition. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2000.
-
(2000)
A Multigrid Tutorial
-
-
Briggs, W.1
Henson, V.2
McCormick, S.3
-
6
-
-
84883516917
-
-
In Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures, SPAA '94, New York, NY, USA, ACM.
-
J. Bruck, C-T. Ho, S. Kipnis, and D. Weathersby. Efficient algorithms for all-to-all communications in multi-port message-passing systems. In Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures, SPAA '94, pages 298-309, New York, NY, USA, 1994. ACM.
-
(1994)
Efficient Algorithms For All-to-all Communications In Multi-port Message-passing Systems
, pp. 298-309
-
-
Bruck, J.1
Ho, C.-T.2
Kipnis, S.3
Weathersby, D.4
-
7
-
-
55849139091
-
Challenges and advances in parallel sparse matrix-matrix multiplication
-
Portland, Oregon, USA, IEEE Computer Society.
-
A. Buluç and J. Gilbert. Challenges and advances in parallel sparse matrix-matrix multiplication. In ICPP '08: Proc. of the Intl. Conf. on Parallel Processing, pages 503-510, Portland, Oregon, USA, 2008. IEEE Computer Society.
-
(2008)
ICPP '08: Proc. Of the Intl. Conf. On Parallel Processing
, pp. 503-510
-
-
Buluç, A.1
Gilbert, J.2
-
8
-
-
82955164060
-
The combinatorial blas: Design, implementation, and applications
-
November
-
A. Buluç and J. Gilbert. The combinatorial blas: Design, implementation, and applications. Int. J. High Perform. Comput. Appl., 25(4):496-509, November 2011.
-
(2011)
Int. J. High Perform. Comput. Appl.
, vol.25
, Issue.4
, pp. 496-509
-
-
Buluç, A.1
Gilbert, J.2
-
9
-
-
84866380590
-
Parallel sparse matrix-matrix multiplication and indexing: Implementation and experiments
-
(SISC)
-
A. Buluç and J. Gilbert. Parallel sparse matrix-matrix multiplication and indexing: Implementation and experiments. SIAM Journal of Scientific Computing (SISC), 34(4):170 - 191, 2012.
-
(2012)
SIAM Journal of Scientific Computing
, vol.34
, Issue.4
, pp. 170-191
-
-
Buluç, A.1
Gilbert, J.2
-
12
-
-
0034625292
-
A general parallel sparse-blocked matrix multiply for linear scaling SCF theory
-
M. Challacombe. A general parallel sparse-blocked matrix multiply for linear scaling SCF theory. Computer physics communications, 128(l-2):93-107, 2000.
-
(2000)
Computer Physics Communications
, vol.128
, Issue.L-2
, pp. 93-107
-
-
Challacombe, M.1
-
13
-
-
84884883916
-
Communication-optimal parallel recursive rectangular matrix multiplication
-
J. Demmel, D. Eliahu, A. Fox, S. Kamil, B. Lipshitz, O. Schwartz, and O. Spillinger.Communication-optimal parallel recursive rectangular matrix multiplication. In International Parallel & Distributed Processing Symposium (IPDPS). IEEE, 2013.
-
(2013)
International Parallel & Distributed Processing Symposium (IPDPS). IEEE
-
-
Demmel, J.1
Eliahu, D.2
Fox, A.3
Kamil, S.4
Lipshitz, B.5
Schwartz, O.6
Spillinger, O.7
-
14
-
-
0001540595
-
Paul erdo′s and alfréd rényi. On random graphs
-
Paul erdo′s and alfréd rényi. on random graphs. Publicationes Mathematicae Debrecen, 6:290-297, 1959.
-
(1959)
Publicationes Mathematicae Debrecen
, vol.6
, pp. 290-297
-
-
-
15
-
-
0000470989
-
Sparse matrices in Matlab: Design and implementation
-
J. Gilbert, C. Moler, and R. Schreiber. Sparse matrices in Matlab: Design and implementation. SIAM Journal of Matrix Analysis and Applications, 13(l):333-356, 1992.
-
(1992)
SIAM Journal of Matrix Analysis and Applications
, vol.13
, Issue.L
, pp. 333-356
-
-
Gilbert, J.1
Moler, C.2
Schreiber, R.3
-
16
-
-
39749144465
-
A unified framework for numerical and combinatorial computing
-
DOI 10.1109/MCSE.2008.45, 4454427
-
J. Gilbert, S. Reinhardt, and V. Shah. A unified framework for numerical and combinatorial computing. Computing in Science and Engineering, 10(2):20-25, 2008. (Pubitemid 351305834)
-
(2008)
Computing in Science and Engineering
, vol.10
, Issue.2
, pp. 20-25
-
-
Gilbert, J.R.1
Shah, V.B.2
Reinhardt, S.3
-
17
-
-
77954898947
-
Brief announcement: Lower bounds on communication for sparse Cholesky factorization of a model problem
-
New York, NY, USA, ACM.
-
L. Grigori, P.-Y. David, J. Demmel, and S. Peyronnet. Brief announcement: Lower bounds on communication for sparse Cholesky factorization of a model problem. In Proceedings of the 22nd A CM Symposium on Parallelism in Algorithms and Architectures, SPAA '10, pages 79-81, New York, NY, USA, 2010 ACM.
-
(2010)
Proceedings of the 22nd a CM Symposium on Parallelism in Algorithms and Architectures, SPAA '10
, pp. 79-81
-
-
Grigori, L.1
David, P.-Y.2
Demmel, J.3
Peyronnet, S.4
-
18
-
-
0031647665
-
A flexible class of parallel matrix multiplication algorithms
-
IEEE
-
J. Gunnels, C. Lin, G. Morrow, and R. van de Geijn. A flexible class of parallel matrix multiplication algorithms. In Proceedings of the First Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing 1998, pages 110-116. IEEE, 1998.
-
(1998)
Proceedings of the First Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing 1998
, pp. 110-116
-
-
Gunnels, J.1
Lin, C.2
Morrow, G.3
Van De Geijn, R.4
-
21
-
-
0024963731
-
Techniques for parallel manipulation of sparse matrices
-
C. Kruskal, L. Rudolph, and M. Snir. Techniques for parallel manipulation of sparse matrices. Theor. Comput. Sci., 64(2): 135-157, 1989.
-
(1989)
Theor. Comput. Sci.
, vol.64
, Issue.2
, pp. 135-157
-
-
Kruskal, C.1
Rudolph, L.2
Snir, M.3
-
22
-
-
0001289565
-
An inequality related to the isoperimetric inequality
-
L. Loomis and H. Whitney. An inequality related to the isoperimetric inequality. Bulletin of the AMS, 55:961-962, 1949.
-
(1949)
Bulletin of the AMS
, vol.55
, pp. 961-962
-
-
Loomis, L.1
Whitney, H.2
-
23
-
-
0000743020
-
Memory-efficient matrix multiplication in the BSP model
-
W. McColl and A. Tiskin. Memory-efficient matrix multiplication in the BSP model. Algorithmica, 24:287-297, 1999. (Pubitemid 129715337)
-
(1999)
Algorithmica (New York)
, vol.24
, Issue.3-4
, pp. 287-297
-
-
McColl, W.F.1
Tiskin, A.2
-
24
-
-
33644623158
-
Efficient transitive closure of sparse matrices over closed semirings
-
G. Penn. Efficient transitive closure of sparse matrices over closed semirings. Theoretical Computer Science, 354(1):72-81, 2006.
-
(2006)
Theoretical Computer Science
, vol.354
, Issue.1
, pp. 72-81
-
-
Penn, G.1
-
25
-
-
84864057840
-
Space-round tradeoffs for mapreduce computations
-
ACM
-
A. Pietracaprina, G. Pucci, M. Riondato, F. Silvestri, and E. Upfal. Space-round tradeoffs for mapreduce computations. In Proceedings of the 26th ACM International Conference on Supercomputing, pages 235-244. ACM, 2012.
-
(2012)
Proceedings of the 26th ACM International Conference on Supercomputing
, pp. 235-244
-
-
Pietracaprina, A.1
Pucci, G.2
Riondato, M.3
Silvestri, F.4
Upfal, E.5
-
26
-
-
84883540517
-
Parallel matrix multiplication: 2d and 3d, flame working note #62
-
The University of Texas at Austin, Department of Computer Sciences, June
-
M. Schatz, J. Poulson, and R. van de Geijn. Parallel matrix multiplication: 2d and 3d, flame working note #62. Technical Report TR-12-13, The University of Texas at Austin, Department of Computer Sciences, June 2012.
-
(2012)
Technical Report TR-12-13
-
-
Schatz, M.1
Poulson, J.2
Van De Geijn, R.3
-
27
-
-
83155193222
-
Improving communication performance in dense linear algebra via topology aware collectives
-
ACM
-
E. Solomonik, A. Bhatele, and J. Demmel. Improving communication performance in dense linear algebra via topology aware collectives. In Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis, page 77. ACM, 2011.
-
(2011)
Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis
, pp. 77
-
-
Solomonik, E.1
Bhatele, A.2
Demmel, J.3
-
29
-
-
0031123769
-
SUMMA: Scalable universal matrix multiplication algorithm
-
R. van de Geijn and J. Watts. SUMMA: Scalable universal matrix multiplication algorithm. Concurrency - Practice and Experience, 9(4):255-274, 1997. (Pubitemid 127679707)
-
(1997)
Concurrency Practice and Experience
, vol.9
, Issue.4
, pp. 255-274
-
-
Van De, G.R.A.1
Watts, J.2
-
31
-
-
84867384854
-
Linear scaling self-consistent field calculations with millions of atoms in the condensed phase
-
J. VandeVondele, U. Borštnik, and J. Flutter. Linear scaling self-consistent field calculations with millions of atoms in the condensed phase. Journal of Chemical Theory and Computation, 8(10):3565-3573, 2012.
-
(2012)
Journal of Chemical Theory and Computation
, vol.8
, Issue.10
, pp. 3565-3573
-
-
VandeVondele, J.1
Borštnik, U.2
Flutter, J.3
|