A recurrence-free variant of strassen’s algorithm on hypercube

Elisa Francomano, Carmelo Lodato

Risultato della ricerca: Article

1 Citazioni (Scopus)

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.
Lingua originaleEnglish
pagine (da-a)241-249
Numero di pagine9
RivistaParallel Algorithms and Applications
Volume5
Stato di pubblicazionePublished - 1995

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Computer Science(all)

Cita questo