Reordering for parallelism

Abstract

The proposed ordering scheme is the fusion of Jess and Kees method and the Minimum degree ordering, that operates on a non-chordal graph. The method produces a fill preserving ordering for all the test problems selected from the Boeing-Harwell Sparse matrix collection. The extent of parallelism extracted is nearly the same as that obtained by using Liu's tree rotation heuristic.

Keywords:

• Sparse matrix
• cholesky factorisation
• full-in
• parallel ordering

C.R. Categories:

• G1.3
• F2.1