In this paper a non-recursive Strassen’s matrix multiplication algorithm is presented. This new algorithm is suitable to run on parallel environments. Two computational schemes have been worked out exploiting different parallel approaches on hypercube architecture. A comparative analysis is reported. The experiments have been carried out on an nCUBE-2 supercomputer, housed at CNUCE in Pisa, supporting the Express parallel operating system. © 1995, Taylor & Francis Group, LLC. All rights reserved.
Francomano, E., Macaluso, A., Lodato, C. (1995). A recurrence-free variant of strassen’s algorithm on hypercube. PARALLEL ALGORITHMS AND APPLICATIONS, 5(3-4), 241-249 [10.1080/10637199508915488].
A recurrence-free variant of strassen’s algorithm on hypercube
FRANCOMANO, Elisa;
1995-01-01
Abstract
In this paper a non-recursive Strassen’s matrix multiplication algorithm is presented. This new algorithm is suitable to run on parallel environments. Two computational schemes have been worked out exploiting different parallel approaches on hypercube architecture. A comparative analysis is reported. The experiments have been carried out on an nCUBE-2 supercomputer, housed at CNUCE in Pisa, supporting the Express parallel operating system. © 1995, Taylor & Francis Group, LLC. All rights reserved.
| File | Dimensione | Formato | |
|---|---|---|---|
|
STRASSEN_HYPERCUBE.pdf
Solo gestori archvio
Dimensione
569.67 kB
Formato
Adobe PDF
|
569.67 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
