Reordering for parallelism

DOI10.1080/00207169808804670MaRDI QIDQ4392334zbMATH OpenOpenAlexFDO

Authors M. V. Padmini, Bharat B. Madan, Bijendra N. Jain

Publication date 15 November 1998

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Cholesky factorizationsparse matrixtest problemsparallel orderingBoling-Harwell sparse matrix collectionJess-Kees method

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Parallel numerical computation (65Y05)

Recommendations

• Reordering computations for parallel execution
• Parallel ordering using edge contraction
• Parallel sorting revisited
• scientific article; zbMATH DE number 146431
• scientific article; zbMATH DE number 992818
• Sorting in Parallel
• Parallel algorithms for arrangements
• Parallelism in tape-sorting
• Reordering sparse matrices for parallel elimination
• Sorting roughly sorted sequences in parallel

Cites work

• A Data Structure for Parallel L/U Decomposition
• A Fast Algorithm for Reordering Sparse Matrices for Parallel Factorization
• A Linear Reordering Algorithm for Parallel Pivoting of Chordal Graphs
• Parallel Algorithms for Sparse Linear Systems

Cited in

(4)

• A Fast Algorithm for Reordering Sparse Matrices for Parallel Factorization
• Parallel ordering using edge contraction
• A survey of direct methods for sparse linear systems
• The Minimum Degree Ordering with Constraints

Describes a project that uses

Uses Software

• symrcm

This page was built for publication: Reordering for parallelism

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4392334)