Hypermatrix oriented supernode amalgamation

Authors:
José R. Herrero;Juan J. Navarro
Affiliations:
Computer Architecture Department, Universitat Politècnica de Catalunya, Barcelona, Spain 08034;Computer Architecture Department, Universitat Politècnica de Catalunya, Barcelona, Spain 08034
Venue:
The Journal of Supercomputing
Year:
2008

Citing 18
Cited 0

Characterizing computer performance with a single number

Communications of the ACM
The influence of relaxed supernode partitions on the multifrontal method

ACM Transactions on Mathematical Software (TOMS)
The role of elimination trees in sparse factorization

SIAM Journal on Matrix Analysis and Applications
An empirical evaluation of the KORBX algorithms for military airlift applications

Operations Research
The multifrontal method for sparse matrix solution: theory and practice

SIAM Review
On finding supernodes for sparse matrix computations

SIAM Journal on Matrix Analysis and Applications
Block sparse Cholesky algorithms on advanced uniprocessor computers

SIAM Journal on Scientific Computing
An efficient block-oriented approach to parallel sparse Cholesky factorization

SIAM Journal on Scientific Computing
The SPLASH-2 programs: characterization and methodological considerations

ISCA '95 Proceedings of the 22nd annual international symposium on Computer architecture
Performance of Panel and Block Approaches to Sparse Cholesky Factorization on the iPSC/860 and Paragon Multicomputers

SIAM Journal on Scientific Computing
Matrix computations (3rd ed.)

Matrix computations (3rd ed.)
Fast and effective algorithms for graph partitioning and sparse-matrix ordering

IBM Journal of Research and Development - Special issue: optical lithography I
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs

SIAM Journal on Scientific Computing
The Multifrontal Solution of Indefinite Sparse Symmetric Linear

ACM Transactions on Mathematical Software (TOMS)
Parallel and Fully Recursive Multifrontal Supernodal Sparse Cholesky

ICCS '02 Proceedings of the International Conference on Computational Science-Part II
A numerical evaluation of sparse direct solvers for the solution of large sparse symmetric linear systems of equations

ACM Transactions on Mathematical Software (TOMS)
Analysis of a sparse hypermatrix Cholesky with fixed-sized blocking

Applicable Algebra in Engineering, Communication and Computing
Using non-canonical array layouts in dense matrix operations

PARA'06 Proceedings of the 8th international conference on Applied parallel computing: state of the art in scientific computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we introduce a supernode amalgamation algorithm which takes into account the characteristics of a hypermatrix data structure. The resulting frontal tree is then used to create a variable-sized partitioning of the hypermatrix. The sparse hypermatrix Cholesky factorization obtained runs slightly faster than the one which uses a fixed-sized partitioning. The algorithm also reduces data dependencies which limit exploitation of parallelism.