Abstract
Several new algorithms for matrix-matrix multiplications on hypercube multiprocessors are presented and evaluated based on the number of multiplications, additions, and transfers. The matrices to be multiplied are uniformly distributed to all processors of a hypercube system. Each processor owns some submatrices which are derived by dividing the source matrices. Each submatrix multiplication can now be performed independently within a processor. All the partial results are then summed up and transferred to a single processor. An orthogonal tree is used for efficient communication. The time complexity is O(log2p) if p × p processors are used. In addition, the UDD (Uniform Data Distribution) approach is employed when some processors do not work properly and the faulty effects have been detected. Two classes of fault patterns are considered and evaluated.
Original language | English |
---|---|
Title of host publication | Proceedings of International Conference on Application Specific Array Processors, ASAP 1993 |
Editors | Benjamin Wah, Luigi Dadda |
Publisher | Institute of Electrical and Electronics Engineers Inc. |
Pages | 176-179 |
Number of pages | 4 |
ISBN (Electronic) | 0818634928 |
DOIs | |
State | Published - 1993 |
Externally published | Yes |
Event | 1993 International Conference on Application Specific Array Processors, ASAP 1993 - Venice, Italy Duration: 25 10 1993 → 27 10 1993 |
Publication series
Name | Proceedings of the International Conference on Application-Specific Systems, Architectures and Processors |
---|---|
ISSN (Print) | 1063-6862 |
Conference
Conference | 1993 International Conference on Application Specific Array Processors, ASAP 1993 |
---|---|
Country/Territory | Italy |
City | Venice |
Period | 25/10/93 → 27/10/93 |
Bibliographical note
Publisher Copyright:© 1993 IEEE.