Results 1  10
of
71,579
Evolutionary search for matrix multiplication algorithms
 In FLAIRS
, 2001
"... This paper addresses the problem of algorithm discovery, via evolutionary search, in the context of matrix multiplication. The traditional multiplication algorithm requires O(n3) multiplications for square matrices of order n. Strassen (Strassen 1969) discovered a re, cursive matrix multiplication ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper addresses the problem of algorithm discovery, via evolutionary search, in the context of matrix multiplication. The traditional multiplication algorithm requires O(n3) multiplications for square matrices of order n. Strassen (Strassen 1969) discovered a re, cursive matrix
Comparative Study of Cache Utilization for Matrix Multiplication Algorithms
"... Abstract In this work, the performance of basic and strassen’s matrix multiplication algorithms are compared in terms of memory hierarchy utilization. The problem taken here is MATRIX MULTIPLICATION (Basic and Strassen’s). Strassen’s Matrix Multiplication Algorithm has time complexity of O(n2.807) ..."
Abstract
 Add to MetaCart
Abstract In this work, the performance of basic and strassen’s matrix multiplication algorithms are compared in terms of memory hierarchy utilization. The problem taken here is MATRIX MULTIPLICATION (Basic and Strassen’s). Strassen’s Matrix Multiplication Algorithm has time complexity of O(n2
Fast matrix multiplications algorithms on MIMD architectures
 Parallel Algorithms and Applications
, 1994
"... Abstract. Sequential fast matrix multiplication algorithms of Strassen and Winograd are studied; the complexity bound given by Strassen is improved. These algorithms are parallelized on MIMD distributed memory architectures of ring and torus topologies; a generalization to a hypertorus is also give ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Abstract. Sequential fast matrix multiplication algorithms of Strassen and Winograd are studied; the complexity bound given by Strassen is improved. These algorithms are parallelized on MIMD distributed memory architectures of ring and torus topologies; a generalization to a hypertorus is also
Performance Analysis of Matrix Multiplication Algorithms Using MPI
"... Abstract:The practical analysis of parallel computing algorithms is discussed in this paper. The cluster is used to analyze the performance of the algorithms by using the various nodes of the cluster. Parallel computing by the MPI has made a tremendous impact on a variety of areas ranging from compu ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
computational simulation for scientific and engineering applications to commercial application. We propose the performance analysis of the matrix multiplication algorithms through MPI.
Summa: Scalable universal matrix multiplication algorithm
, 1997
"... In this paper, we give a straight forward, highly e cient, scalable implementation of common matrix multiplication operations. The algorithms are much simpler than previously published methods, yield better performance, and require less work space. MPI implementations are given, as are performance r ..."
Abstract

Cited by 93 (4 self)
 Add to MetaCart
In this paper, we give a straight forward, highly e cient, scalable implementation of common matrix multiplication operations. The algorithms are much simpler than previously published methods, yield better performance, and require less work space. MPI implementations are given, as are performance
A ClusteringBased Matrix Multiplication Algorithm
"... Abstract — We present a simple matrix multiplication algorithm that multiplies two input matrices with rows (in one matrix) and columns (in the other matrix) within a small diameter d (distances are measured using the Hamming distance). This algorithm runs in time O(dn 2) for matrices of size n × n. ..."
Abstract
 Add to MetaCart
Abstract — We present a simple matrix multiplication algorithm that multiplies two input matrices with rows (in one matrix) and columns (in the other matrix) within a small diameter d (distances are measured using the Hamming distance). This algorithm runs in time O(dn 2) for matrices of size n × n
Parallel Matrix Multiplication Algorithms on Hypercube Multiprocessors
 International Journal of High Speed Computing
, 1995
"... In this paper, we present three parallel algorithms for matrix multiplication. The first one, which employs pipelining techniques on a mesh grid, uses only one copy of data matrices. The second one uses multiple copies of data matrices also on a mesh grid. Although data communication operations of t ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
In this paper, we present three parallel algorithms for matrix multiplication. The first one, which employs pipelining techniques on a mesh grid, uses only one copy of data matrices. The second one uses multiple copies of data matrices also on a mesh grid. Although data communication operations
A New Parallel Matrix Multiplication Algorithm on DistributedMemory Concurrent Computers
, 1997
"... We present a new fast and scalable matrix multiplication algorithm, called DIMMA (DistributionIndependent Matrix Multiplication Algorithm), for block cyclic data distribution on distributedmemory concurrent computers. The algorithm is based on two new ideas; it uses a modi ed pipelined communicati ..."
Abstract

Cited by 20 (0 self)
 Add to MetaCart
We present a new fast and scalable matrix multiplication algorithm, called DIMMA (DistributionIndependent Matrix Multiplication Algorithm), for block cyclic data distribution on distributedmemory concurrent computers. The algorithm is based on two new ideas; it uses a modi ed pipelined
Analysis of a Class of Parallel Matrix Multiplication Algorithms
, 1998
"... Publications concerning parallel implementation of matrixmatrix multiplication continue to appear with some regularity. It may seem odd that an algorithm that can be expressed as one statement and three nested loops deserves this much attention. This paper provides some insights as to why this prob ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Publications concerning parallel implementation of matrixmatrix multiplication continue to appear with some regularity. It may seem odd that an algorithm that can be expressed as one statement and three nested loops deserves this much attention. This paper provides some insights as to why
A family of highperformance matrix multiplication algorithms
 INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCES
, 2001
"... During the last halfdecade, a number of research efforts have centered around developing software for generating automatically tuned matrix multiplication kernels. These include the PHiPAC project and the ATLAS project. The software endproducts of both projects employ brute force to search a parame ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
of the shapes of the operands. When the resulting family of algorithms is combined with a highly optimized innerkernel for a small matrix multiplication, the approach yields performance that is superior to that of methods that automatically tune such kernels. Preliminary results, for the Intel Pentium (R) III
Results 1  10
of
71,579