Multilinear algebra and parallel programming

Authors:
R. W. Johnson;C.-H. Huang;J. R. Johnson
Affiliations:
Department of Computer and Information Science, The Ohio State University, Columbus, OH;-;-
Venue:
Proceedings of the 1990 ACM/IEEE conference on Supercomputing
Year:
1990

Citing 5
Cited 1

Lectures on the complexity of bilinear problems

Lectures on the complexity of bilinear problems
Extra high speed matrix multiplication on the Cray-2

SIAM Journal on Scientific and Statistical Computing
Exploiting fast matrix multiplication within the level 3 BLAS

ACM Transactions on Mathematical Software (TOMS)
A methodology for designing, modifying, and implementing Fourier transform algorithms on various architectures

Circuits, Systems, and Signal Processing
An Adaptation of the Fast Fourier Transform for Parallel Processing

Journal of the ACM (JACM)

Operator Language: A Program Generation Framework for Fast Kernels

DSL '09 Proceedings of the IFIP TC 2 Working Conference on Domain-Specific Languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

We report on preliminary results of a joint project of the Center for Large Scale Computation at the City University of New York and the Department of Computer and Information Sciences at The Ohio State University to study the use of multilinear algebra in designing and implementing algorithms for linear computations. In particular, we discuss our experience in using these techniques on the Cray Y-MP [17] and to implement Strassen's matrix multiplication algorithm on the Encore Multimax [12,13,14].