Parallel matrix multiplication on networked microcomputers (Q1207446)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Parallel matrix multiplication on networked microcomputers |
scientific article; zbMATH DE number 149731
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parallel matrix multiplication on networked microcomputers |
scientific article; zbMATH DE number 149731 |
Statements
Parallel matrix multiplication on networked microcomputers (English)
0 references
1 April 1993
0 references
The authors present methods for utilising parallel processing capability of the idle microcomputers on a local area network to perform computationally intensive operations encountered in linear algebra. This is achieved by programming the local area network to emulate a shared- memory multiprocessor, where data files on the file server take the role of the shared main memory. As an example, techniques for efficient implementation of level 3 BLAS (matrix-matrix operations) primitives on networked microcomputers are considered. The numerical results presented indicate that the efficiency of the parallel algorithm is highly sensitive to the delay factor (the smallest amount of time between the starting times of any two nodes) and also the block size.
0 references
matrix-matrix operations
0 references
parallel processing
0 references
micro computers
0 references
local area network
0 references
shared-memory multiprocessor
0 references
numerical results
0 references
efficiency
0 references