Efficient sparse LU factorization with left-right looking strategy on shared memory multiprocessors

被引：136
|
作者：
Schenk, O
Gärtner, K
Fichtner, W
机构：
[1] ETH Zurich, Swiss Fed Inst Technol, Integrated Syst Lab, CH-8092 Zurich, Switzerland
[2] Weierstr Inst Appl Anal & Stochast, DE-10117 Berlin, Germany
来源：
BIT | 2000年 / 40卷 / 01期
关键词：
parallel sparse LU factorization; asynchronous computation scheduling; SMP parallel computing; multigrid coarse solver; process simulation; device simulation;
D O I：
10.1023/A:1022326604210
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
An efficient sparse LU factorization algorithm on popular shared memory multiprocessors is presented. Pipelining parallelism is essential to achieve higher parallel efficiency and it is exploited with a left-right looking algorithm. No global barrier is used and a completely asynchronous scheduling scheme is one central point of the implementation. The algorithm has been successfully tested on SUN Enterprise, DEC AlphaServer, SGI Origin 2000 and Cray T90 and J90 parallel computers, delivering up to 2.3 GFlop/s on an eight processor DEC AlphaServer for medium-size semiconductor device simulations and structural engineering problems.
引用
收藏
页码：158 / 176
页数：19
相关论文
共 50 条
  • [1] Efficient Sparse LU Factorization with Left-Right Looking Strategy on Shared Memory Multiprocessors
    O. Schenk
    K. Gärtner
    W. Fichtner
    [J]. BIT Numerical Mathematics, 2000, 40 : 158 - 176
  • [2] Scalable parallel sparse factorization with left-right looking strategy on shared memory multiprocessors
    Schenk, O
    Gärtner, K
    Fichtner, W
    [J]. HIGH-PERFORMANCE COMPUTING AND NETWORKING, PROCEEDINGS, 1999, 1593 : 221 - 230
  • [3] Parallel sparse LU factorization in a shared memory computing environment
    Schenk, O
    Gärtner, K
    Fichtner, W
    [J]. INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-IV, PROCEEDINGS, 1998, : 907 - 914
  • [4] Algorithmic Advancements and a Comparative Investigation of Left and Right Looking Sparse LU Factorization on GPU Platform for Circuit Simulation
    Lee, Wai-Kong
    Achar, Ramachandra
    [J]. IEEE ACCESS, 2022, 10 : 78993 - 79003
  • [5] Efficient sparse LU factorization with partial pivoting on distributed memory architectures
    Fu, C
    Jiao, XM
    Yang, T
    [J]. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1998, 9 (02) : 109 - 125
  • [6] EFFICIENT SYNCHRONIZATION ON MULTIPROCESSORS WITH SHARED MEMORY
    KRUSKAL, CP
    RUDOLPH, L
    SNIR, M
    [J]. ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1988, 10 (04): : 579 - 601
  • [7] Algorithm 1021: SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-looking Integer-preserving LU Factorization
    Lourenco, Christopher
    Chen, Jinhao
    Moreno-Centeno, Erick
    Davis, Timothy A.
    [J]. ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 2022, 48 (02):
  • [8] Parallel sparse orthogonal factorization on distributed-memory multiprocessors
    Sun, CG
    [J]. SIAM JOURNAL ON SCIENTIFIC COMPUTING, 1996, 17 (03): : 666 - 685
  • [9] A SUPERNODAL CHOLESKY FACTORIZATION ALGORITHM FOR SHARED-MEMORY MULTIPROCESSORS
    NG, E
    PEYTON, BW
    [J]. SIAM JOURNAL ON SCIENTIFIC COMPUTING, 1993, 14 (04): : 761 - 769
  • [10] Performance analysis of parallel right-looking sparse LU factorization on two dimensional grids of processors
    Grigori, Laura
    Li, Xiaoye S.
    [J]. APPLIED PARALLEL COMPUTING: STATE OF THE ART IN SCIENTIFIC COMPUTING, 2006, 3732 : 768 - 777
12345