DocumentCode :
3287535
Title :
A matrix product algorithm and its comparative performance on hypercubes
Author :
Lin, Calvin ; Snyder, Lawrence
Author_Institution :
Dept. of Comput. Sci. & Eng., Washington Univ., Seattle, WA, USA
fYear :
1992
fDate :
26-29 Apr 1992
Firstpage :
190
Lastpage :
194
Abstract :
A matrix product algorithm is studied in which one matrix operand is transposed prior to the computation. This algorithm is compared with the Fox-Hey-Otto algorithm on hypercube architectures. The Transpose algorithm simplifies communication for nonsquare matrices and for computations where the number of processors is not a perfect square. The results indicate superior performance for the Transpose algorithm
Keywords :
hypercube networks; mathematics computing; matrix algebra; parallel algorithms; Fox-Hey-Otto algorithm; Transpose algorithm; hypercubes; matrix product algorithm; nonsquare matrices; performance; Algorithm design and analysis; Broadcasting; Computer architecture; Computer science; Concurrent computing; Context; Costs; Hypercubes; Libraries; Parallel machines;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Scalable High Performance Computing Conference, 1992. SHPCC-92, Proceedings.
Conference_Location :
Williamsburg, VA
Print_ISBN :
0-8186-2775-1
Type :
conf
DOI :
10.1109/SHPCC.1992.232648
Filename :
232648
Link To Document :
بازگشت