UNIFIED PARALLEL ALGORITHMS FOR GAUSSIAN ELIMINATION WITH BACKWARD SUBSTITUTION ON PRODUCT NETWORKS

DOI10.1080/10637199808947390zbMath0955.68127OpenAlexW2068363647MaRDI QIDQ4485120

Khaled Day, Abdel-Elah Al-Ayyoub

Publication date: 5 June 2000

Published in: Parallel Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10637199808947390

zbMATH Keywords

interconnection networksproduct networks

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Cites Work

• Evaluating speedups on distributed memory architectures
• Product-shuffle networks: Toward reconciling shuffles and butterflies
• LU decomposition optimized for a parallel computer with a hierarchical distributed memory
• Subcube matrix decomposition: A unifying view for LU factorization on multicomputers
• The hyperstar interconnection network
• The de Bruijn multiprocessor network: a versatile parallel processing and sorting network for VLSI
• A general framework for developing adaptive fault-tolerant routing algorithms

This page was built for publication: UNIFIED PARALLEL ALGORITHMS FOR GAUSSIAN ELIMINATION WITH BACKWARD SUBSTITUTION ON PRODUCT NETWORKS