Sciweavers

CONCURRENCY
1998
151views more  CONCURRENCY 1998»
13 years 4 months ago
A new parallel matrix multiplication algorithm on distributed-memory concurrent computers
We present a new fast and scalable matrix multiplication algorithm, called DIMMA Distribution-Independent Matrix Multiplication Algorithm, for block cyclic data distribution on ...
Jaeyoung Choi
CORR
2006
Springer
151views Education» more  CORR 2006»
13 years 4 months ago
Fast matrix multiplication is stable
We perform forward error analysis for a large class of recursive matrix multiplication algorithms in the spirit of [D. Bini and G. Lotti, Stability of fast algorithms for matrix m...
James Demmel, Ioana Dumitriu, Olga Holtz, Robert K...
PDPTA
1996
13 years 5 months ago
Hyper-Systolic Matrix Multiplication
A novel parallel algorithm for matrix multiplication is presented. It is based on a 1-D hyper-systolic processor abstraction. The procedure can be implemented on all types of para...
Thomas Lippert, Klaus Schilling
FLAIRS
2001
13 years 6 months ago
Evolutionary Search for Matrix Multiplication Algorithms
This paperaddresses the problemof algorithm discovery, via evolutionarysearch, in the context of matrix multiplication. Thetraditional multiplicationalgorithm requiresO(n3) multip...
John F. Kolen, Phillip Bruce
DAGSTUHL
2006
13 years 6 months ago
Using fast matrix multiplication to solve structured linear systems
Structured linear algebra techniques enable one to deal at once with various types of matrices, with features such as Toeplitz-, Hankel-, Vandermonde- or Cauchy-likeness. Following...
Éric Schost, Alin Bostan, Claude-Pierre Jea...
EUROPAR
2006
Springer
13 years 8 months ago
Optimization of Dense Matrix Multiplication on IBM Cyclops-64: Challenges and Experiences
Abstract. This paper presents a study of performance optimization of dense matrix multiplication on IBM Cyclops-64(C64) chip architecture. Although much has been published on how t...
Ziang Hu, Juan del Cuvillo, Weirong Zhu, Guang R. ...
ESA
2006
Springer
105views Algorithms» more  ESA 2006»
13 years 8 months ago
Dynamic Programming and Fast Matrix Multiplication
Abstract. We give a novel general approach for solving NP-hard optimization problems that combines dynamic programming and fast matrix multiplication. The technique is based on red...
Frederic Dorn
STACS
1999
Springer
13 years 8 months ago
Lower Bounds for Dynamic Algebraic Problems
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter...
IPPS
1998
IEEE
13 years 8 months ago
A Flexible Class of Parallel Matrix Multiplication Algorithms
This paper explains why parallel implementation of matrix multiplication--a seemingly simple algorithm that can be expressed as one statement and three nested loops--is complex: P...
John A. Gunnels, Calvin Lin, Greg Morrow, Robert A...
SPAA
1999
ACM
13 years 8 months ago
Recursive Array Layouts and Fast Parallel Matrix Multiplication
Matrix multiplication is an important kernel in linear algebra algorithms, and the performance of both serial and parallel implementations is highly dependent on the memory system...
Siddhartha Chatterjee, Alvin R. Lebeck, Praveen K....