Newsgroups: comp.parallel
From: rvdg@cs.utexas.edu (Robert van de Geijn)
Subject: New Parallel Matrix-Multiplication Algorithm
Organization: CS Dept, University of Texas at Austin
Date: 29 May 1995 15:16:24 GMT
Message-ID: <3qcog8$21b@usenet.srv.cis.pitt.edu>

Results on the Paragon show that quickly theoretical peak,
of 45 MFLOPS/node, is reached.  The report

Robert van de Geijn and Jerrell Watts, "SUMMA: Scalable Universal Matrix
Multiplication Algorithm," TR-95-13, Department of Computer Sciences,
University of Texas, April 1995. 

is available from 

http://www.cs.utexas.edu/users/rvdg/reports.html

by clicking TR-95-13.

We include a complete MPI implementation.

This report will soon also be available as a LAPACK working note
(http://www.netlib.org/lapack/lawns)

We welcome comments.

Robert A. van de Geijn                  rvdg@cs.utexas.edu  
Associate Professor                     http://www.cs.utexas.edu/users/rvdg
Department of Computer Sciences         (Work)  (512) 471-9720
The University of Texas                 (Home)  (512) 251-8301 
Austin, TX 78712                        (FAX)   (512) 471-8885 

