See this document in CiteSeerX!

Analysis, Tuning and Comparison of Two General Sparse Solvers for Distributed Memory Computers (2000)  (Make Corrections)  
Patrick R. Amestoy, Iain S. Duff, Jean-Yves L'Excellent, Xiaoye S. Li



  Home/Search   Context   Related

 
View or download:
nersc.gov/~xiaoye/mumps_slu.ps.gz
enseeiht.fr/apo/MUM...RT_APO_00_2.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  nersc.gov/~xiaoye/ (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: We describe the work performed in the context of a Franco-Berkeley funded project between NERSC-LBNL located in Berkeley (USA) and CERFACS-ENSEEIHT located in Toulouse (France). We discuss both the tuning and performance analysis of two distributed memory sparse solvers (SuperLU from Berkeley and MUMPS from Toulouse) on the 512 processor Cray T3E from NERSC (Lawrence Berkeley National Laboratory). This project gave us the opportunity to improve the algorithms and add new features to the... (Update)

Similar documents (at the sentence level):   More
67.0%:   Analysis, Tuning and Comparison of Two General Sparse .. - Amestoy, Duff.. (2000)   (Correct)
21.0%:   Impact of the Implementation of MPI Point-to-Point.. - Amestoy, Duff.. (2001)   (Correct)
20.7%:   Impact of the Implementation of MPI Point-to-Point . . . - Amestoy (2002)   (Correct)

Active bibliography (related documents):   More   All
1.0:   SuperLU DIST: A Scalable Distributed-Memory Sparse Direct.. - Li, Demmel (2002)   (Correct)
0.7:   Unknown -   (Correct)
0.3:   The impact of high performance Computing in the solution of linear .. - Duff (1999)   (Correct)

Similar documents based on text:   More   All
0.8:   MUMPS: a general purpose distributed memory sparse solver - Amestoy, Duff.. (2000)   (Correct)
0.3:   Performance and Tuning of Two Distributed Memory Sparse.. - Amestoy, Duff.. (2001)   (Correct)
0.3:   Algorithm 8xx: AMD, an approximate minimum degree ordering .. - Patrick Amestoy Timothy   (Correct)

BibTeX entry:   (Update)

@misc{ amestoy-analysis,
  author = "Patrick R. Amestoy and Iain S. Duff and Jean-Yves L'Excellent and Xiaoye
    S. Li",
  title = "Analysis, Tuning and Comparison of Two General Sparse Solvers for Distributed
    Memory Computers",
  url = "citeseer.ist.psu.edu/article/amestoy00analysis.html" }
Citations (may not include all citations):
447   MPI: The Complete Reference (context) - Snir, Otto et al. - 1996
98   An approximate minimum degree ordering algorithm - Amestoy, Davis et al. - 1996
94   Parallel algorithms for sparse linear systems (context) - Heath, Ng et al. - 1991
75   A supernodal approach to sparse partial pivoting - Demmel, Eisenstat et al. - 1999
57   Highly scalable parallel algorithms for sparse matrix factor.. - Gupta, Karypis et al. - 1997
52   Solving sparse linear systems with sparse backward error (context) - Arioli, Demmel et al. - 1989
40   Multifrontal parallel distributed symmetric and unsymmetric .. - Amestoy, Du et al. - 2000
34   Elimination structures for unsymmetric sparse LU factors - Gilbert, Liu - 1993
32   A fully asynchronous multifrontal solver using distributed d.. - Amestoy, Du et al. - 1999
31   VAMPIR: Visualization and analysis of MPI resources - Nagel, Arnold et al. - 1996
30   Symbolic factorization for sparse Gaussian elimination with .. (context) - George, Ng - 1987
29   SPOOLES: An object oriented sparse matrix library - Ashcraft, Grimes - 1999
26   An asynchronous parallel supernodal algorithm for sparse Gau.. - Demmel, Gilbert et al. - 1999
25   Memory management issues in sparse multifrontal methods on m.. (context) - Amestoy, Du - 1993
23   The Rutherford-Boeing Sparse Matrix Collection (context) - Du, Grimes et al. - 1997
23   On algorithms for permuting large entries to the diagonal of.. - Du, Koster - 1999
20   Hybridizing nested dissection and halo approximate minimum d.. - Pellegrini, Roman et al. - 1999
16   A supernodal Cholesky factorization algorithm for shared-mem.. (context) - Ng, Peyton - 1993
16   Multifrontal QR factorization in a multiprocessor environmen.. - Amestoy, Du et al. - 1996
15   A scalable sparse direct solver using static pivoting - Li, Demmel - 1999
15   Performance of a fully parallel sparse solver - Heath, Raghavan - 1997
14   Modication of the minimum degree algorithm by multiple elimi.. (context) - Liu - 1985
9   MPI : A message passing interface standard (context) - Dongarra, Hempel et al. - 1995
5   A mapping and scheduling algorithm for parallel sparse fan-i.. (context) - Henon, Ramet et al. - 1999
4   elisation de la factorisation LU de matrices creuses non-sym.. (context) - Amestoy, Du et al. - 1998
3   Ecient sparse LU factorization with partial pivoting on dist.. (context) - Fu, Jiao et al. - 1998
3   Ecient sparse LU factorization with left{right looking strat.. (context) - Schenk, artner et al. - 2000
2   Parallel numerical methods for large systems of di erentiala.. (context) - Borchardt, Grund et al. - 1997
2   Ecient sparse Cholesky factorization on distributed-memory m.. (context) - Rothberg - 1994

Documents on the same site (http://www.nersc.gov/~xiaoye/):   More
Making Sparse Gaussian Elimination Scalable by Static Pivoting - Li, Demmel (1998)   (Correct)
Data-level Parallel Solution of Min-cost Network Flow Problems.. - Li, Zenios (1994)   (Correct)
A Scalable Sparse Direct Solver Using Static Pivoting - Xiaoye Li James (1999)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC