Matrix multiplication on the MasPar using distance insensitive communication schemes

Author

Sun, Xiao ; Lombardi, Fabrizio

fYear

1994

fDate

14-16 Dec 1994

Firstpage

358

Lastpage

365

Abstract

Two parallel matrix multiplication algorithms are presented in this paper. These algorithms execute on a grid with toroidal connections. Their novelty is the utilization of communication schemes which theoretically are distance insensitive; the impact on the communication and computational complexities and costs compared with a theoretical analysis, is analyzed and evaluated. The proposed algorithms have been implemented on a MasPar array. An experimental evaluation of these algorithms is performed. A comparison is made for matrix multiplication between the MasPar and the SUN-4/390

Keywords

communication complexity; computational complexity; matrix multiplication; parallel algorithms; performance evaluation; MasPar; SUN-4/390; communication complexities; communication schemes; computational complexities; distance insensitive communication schemes; parallel matrix multiplication algorithms; toroidal connections; Computational complexity; Computational efficiency; Computer aided instruction; Computer science; Concurrent computing; Costs; Matrix decomposition; Performance evaluation; Sun; Wires;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel Architectures, Algorithms and Networks, 1994. (ISPAN), International Symposium on

Conference_Location

Kanazawa

Print_ISBN

0-8186-6507-6

Type

conf

DOI

10.1109/ISPAN.1994.367179

Filename

367179