Optimal parallelization of a recursive algorithm for triangular matrix inversion on MIMD computers

Parallel Computing

Volumn 27, Issue 13, 2001, Pages 1767-1782

  Nasri, W ^a   Mahjoub, Z ^a  

^a FACULTÉ DES SCIENCES DE TUNIS   (Tunisia)

Author keywords

Divide and conquer; Load balancing; Parallel algorithm; Recursive schemes; Scheduling; Triangular matrix inversion

Indexed keywords

COMPUTATIONAL COMPLEXITY; MATRIX ALGEBRA; PARALLEL ALGORITHMS; PROGRAM PROCESSORS; RECURSIVE FUNCTIONS; SCHEDULING;

TRIANGULAR MATRIX INVERSION (TMI);

PARALLEL PROCESSING SYSTEMS;

EID: 0035546674     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8191(01)00111-9     Document Type: Article

References (17)

1. A Strassen-type matrix inversion algorithm
2. Parallel Gaussian elimination on an MIMD computer
3. Scheduling of the DAG associated with pipeline inversion of triangular matrices
4. A survey of parallel algorithms in numerical linear algebra
5. Ordonnancement du graphe à deux pas pour le calcul parallèle
6. On a cost optimal algorithm for triangular matrix inversion
7. Optimal parallel scheduling for the 2-steps graph with constant task cost
8. Optimal scheduling algorithms for parallel Gaussian elimination
9. Data communication in parallel architectures
10. Efficient parallel matrix inversion interconnection networks
11. Gaussian elimination is not optimal