Name
Abstract | ||
|---|---|---|
We describe parallel implementations of LU factorization with pivoting for multicore architectures. Implementations that differ in two different dimensions are discussed: (1) using classical partial pivoting versus recently proposed incremental pivoting and (2) extracting parallelism only within the Basic Linear Algebra Subprograms versus building and scheduling a directed acyclic graph of tasks. Performance comparisons are given on two different systems. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1145/1810479.1810520 | SPAA |
Keywords | Field | DocType |
different dimension,classical partial pivoting,acyclic graph,parallel implementation,lu factorization,different system,performance comparison,incremental pivoting,multicore architecture,basic linear algebra subprograms,directed acyclic graph | Computer science,Scheduling (computing),Parallel computing,Directed acyclic graph,Implementation,Theoretical computer science,Pivot element,Multi-core processor,LU decomposition,Basic Linear Algebra Subprograms | Conference |
Citations | PageRank | References |
3 | 0.42 | 21 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ernie Chan | 1 | 393 | 21.90 |
| Robert A. van de Geijn | 2 | 2047 | 203.08 |
| Andrew Chapman | 3 | 3 | 0.42 |