Performance of panel and block approaches to sparse Cholesky factorization on the iPSC/860 and Paragon multicomputers

No abstract is available for this paper.

• Publication year

  1994

• Venue

  Proceedings of IEEE Scalable High Performance Computing Conference

• Publication date

  1994-05-23

• Fields of study

  Computer Science, Engineering

• Identifiers
  DOI 10.1109/SHPCC.1994.296661
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• An efficient block-oriented approach to parallel sparse Cholesky factorization

  1993cited by this paper
• A Mapping Algorithm for Parallel Sparse Cholesky Factorization

  1993cited by this paper
• Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers

  1991cited by this paper
• A Comparison of Three Column-Based Distributed Sparse Factorization Schemes.

  1990cited by this paper
• A set of level 3 basic linear algebra subprograms

  1990cited by this paper
• Solution of sparse positive definite systems on a hypercube

  1989cited by this paper
• Vectorization of a Multiprocessor Multifrontal Code

  1989cited by this paper
• The influence of relaxed supernode partitions on the multifrontal method

  1989cited by this paper
• Sparse matrix test problems

  1989cited by this paper
• Communication results for parallel sparse Cholesky factorization on a hypercube

  1989cited by this paper
• Solving problems on concurrent processors. Vol. 1: General techniques and regular problems

  1988cited by this paper
• Progress in Sparse Matrix Methods for Large Linear Systems On Vector Supercomputers

  1987cited by this paper
• A compact row storage scheme for Cholesky factors using elimination trees

  1986cited by this paper
• Modification of the minimum-degree algorithm by multiple elimination

  1985cited by this paper
• Computer solution of large sparse positive definite systems

  1982cited by this paper
• Highly Parallel Sparse Cholesky

  year unknowncited by this paper

• HPS Cholesky: Hierarchical Parallelized Supernodal Cholesky with Adaptive Parameters

  2023cites this paper
• Implementing LU and Cholesky factorizations on artificial intelligence accelerators

  2021cites this paper
• A survey of direct methods for sparse linear systems

  2016cites this paper
• Scheduling and memory optimizations for sparse direct solver on multi-core/multi-gpu duster systems. (Ordonnancement et optimisations mémoire pour un solveur creux par méthodes directes sur des machines hétérogènes)

  2015cites this paper
• Ordonnancement hybride statique-dynamique en algèbre linéaire creuse pour de grands clusters de machines NUMA et multi-cœurs. (Static-Dynamic Hybrid Scheduling in sparse linear algebra for large clusters of NUMA and multi-cores architectures)

  2009cites this paper
• Ordonnancement hybride statique-dynamique en algèbre linéaire creuse pour de grands clusters de machines NUMA et multi-coeurs

  2009cites this paper
• Algorithmic performance studies on graphics processing units

  2008cites this paper
• Hypermatrix oriented supernode amalgamation

  2008cites this paper
• Scalable Parallel Algorithms for Solving Sparse Systems of Linear Equations ∗

  2007cites this paper
• Scotch and libScotch 5.0 User's Guide

  2007cites this paper
• Advances in Sparse Hypermatrix Cholesky Factorization

  2007cites this paper
• Analysis of a sparse hypermatrix Cholesky with fixed-sized blocking

  2007cites this paper
• Parallelization of Fine-grained Irregular DAGs

  2007cites this paper
• A framework for efficient execution of matrix computations

  2006cites this paper
• On Optimal Reorderings of Sparse Matrices for Parallel Cholesky Factorizations

  2005cites this paper
• Reducing Overhead in Sparse Hypermatrix Cholesky Factorization

  2005cites this paper
• Intra-Block Amalgamation in Sparse Hypermatrix Cholesky Factorization

  2005cites this paper
• Solution of Linear Systems

  2005cites this paper
• Optimization of a Statically Partitioned Hypermatrix Sparse Cholesky Factorization

  2004cites this paper
• Financial planning via multi-stage stochastic optimization

  2004cites this paper
• 1. g Iterative solution of linear systems in the 20th century, Pages 1-33

  2003cites this paper
• SuperLU_DIST: A scalable distributed-memory sparse direct solver for unsymmetric linear systems

  2003cites this paper
• A latency tolerant hybrid sparse solver using incomplete Cholesky factorization

  2003cites this paper
• Finding Optimal Ordering of Sparse Matrices for Column-Oriented Parallel Cholesky Factorization

  2003cites this paper
• Performance improvements of common sparse numerical linear algebra computations

  2003cites this paper
• PaStiX: a high-performance parallel direct solver for sparse symmetric positive definite systems

  2002cites this paper
• Large-Scale Normal Coordinate Analysis on Distributed Memory Parallel Systems

  2002cites this paper
• SOLUTION OF SPARSE LINEAR EQUATIONS USING CHOLESKY FACTORS OF AUGMENTED SYSTEMS

  2000cites this paper
• Efficient Sparse LU Factorization with Left-Right Looking Strategy on Shared Memory Multiprocessors

  2000cites this paper
• PaStiX: A Parallel Sparse Direct Solver Based on a Static Scheduling for Mixed 1D/2D Block Distributions

  2000cites this paper
• Parallel sparse linear algebra and application to structural mechanics

  2000cites this paper
• On optimal fill-preserving orderings of sparse matrices for parallel Cholesky factorizations

  2000cites this paper
• On evaluating elimination tree based parallel sparse cholesky factorizations

  2000cites this paper
• The Impact of High Performance Computing in the Solution of Linear Systems: Trends and Problems

  2000cites this paper
• Task scheduling using a block dependency DAG for block-oriented sparse Cholesky factorization

  2000cites this paper
• Scalable parallel sparse LU factorization methods on shared memory multiprocessors

  2000cites this paper
• Minimum communication cost reordering for parallel sparse Cholesky factorization

  1999cites this paper
• Developments and Trends in the Parallel Solutionof Linear

  1999cites this paper
• Developments and trends in the parallel solution of linear systems

  1999cites this paper
• Contribution à la parallélisation de méthodes numériques à matrices creuses skyline. Application à un module de calcul de modes et fréquences propres de Systus

  1999cites this paper
• A Mapping and Scheduling Algorithm for Parallel Sparse Fan-In Numerical Factorization

  1999cites this paper
• ALTERNATIVES FOR SPARSE TRIANGULAR SYSTEMS IN INTERIOR POINT METHODS

  1998cites this paper
• A Parallel Algorithm for Multilevel Graph Partitioning and Sparse Matrix Ordering

  1998cites this paper
• Parallel Solution Alternatives for Sparse Triangular Systems in Interior Point Methods

  1998cites this paper
• Two-dimensional block partitionings for the parallel sparse Cholesky factorization

  1997cites this paper
• Parallel Direct Methods for Sparse Linear Systems

  1997influential citation
• Unstructured Grapg Partitioning for Sparse Linear System Solving

  1997cites this paper
• A Coarse-Grain Parallel Formulation of Multilevel k-way Graph Partitioning Algorithm

  1997cites this paper
• Sparse Matrix Ordering with SCOTCH

  1997cites this paper
• Scalable Parallel Algorithms for Sparse Linear Systems

  1997cites this paper
• An Asynchronous Parallel Supernodal Algorithm for Sparse Gaussian Elimination

  1997cites this paper
• Highly Scalable Parallel Algorithms for Sparse Matrix Factorization

  1997cites this paper
• Sparse Gaussian Elimination on High Performance Computers

  1996cites this paper
• ParallelMultilevel k-wayPartitioningSchemefor IrregularGraphs ∗

  1996cites this paper
• Sparse numerical linear algebra: Direct methods and preconditioning

  1996cites this paper
• Parallel Multilevel k-way Partitioning Scheme for Irregular Graphs

  1996cites this paper
• Dynamic Load Balancing by Random Matchings

  1996cites this paper
• A Reconfigurable Parallel algorithm for Sparse Cholesky Factorization

  1995cites this paper
• Analysis and design of scalable parallel algorithms for scientific computing

  1995cites this paper
• Scalable Parallel Algorithms for Unstructured Problems

  1995cites this paper
• A high performance sparse Cholesky factorization algorithm for scalable parallel computers

  1995cites this paper
• Parallel Sparse Cholesky Factorization with Spectral Nested Dissection Ordering

  1994cites this paper
• A scalable parallel algorithm for sparse Cholesky factorization

  1994cites this paper
• A High Performance Sparse Cholesky Factorization Algorithm

  1994cites this paper
• Performance of a Fully Parallel Sparse Solver

  1994cites this paper