TRADING REPLICATION FOR COMMUNICATION IN PARALLEL DISTRIBUTED-MEMORY DENSE SOLVERS | Zendy

Dror Irony | Zendy; Sivan Toledo | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

TRADING REPLICATION FOR COMMUNICATION IN PARALLEL DISTRIBUTED-MEMORY DENSE SOLVERS

Author(s) -

Dror Irony,

Sivan Toledo

Publication year - 2002

Publication title -

parallel processing letters

Language(s) - English

Resource type - Journals

eISSN - 1793-642X

pISSN - 0129-6264

DOI - 10.1142/s0129626402000847

Subject(s) - computer science , parallel computing , message passing , matrix multiplication , distributed memory , lu decomposition , workstation , replication (statistics) , multiplication (music) , factor (programming language) , parallel algorithm , solver , simple (philosophy) , shared memory , matrix decomposition , operating system , mathematics , philosophy , eigenvalues and eigenvectors , physics , statistics , epistemology , quantum mechanics , combinatorics , quantum , programming language

We present new communication-efficient parallel dense linear solvers: a solver for triangular linear systems with multiple right-hand sides and an LU factorization algorithm. These solvers are highly parallel and they perform a factor of 0.4P1/6 less communication than existing algorithms, where P is number of processors. The new solvers reduce communication at the expense of using more temporary storage. Previously, algorithms that reduce communication by using more memory were only known for matrix multiplication. Our algorithms are recursive, elegant, and relatively simple to implement. We have implemented them using MPI, a message-passing libray, and tested them on a cluster of workstations.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research