Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

SPAA
2010
ACM

favoriteEmaildiscussreport

129views Distributed And Parallel Com...» more SPAA 2010»

Managing the complexity of lookahead for LU factorization with pivoting

13 years 2 months ago

Managing the complexity of lookahead for LU factorization with pivoting

Download www.cs.utexas.edu

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. Categories and Subject Descriptors

Ernie Chan, Robert A. van de Geijn, Andrew Chapman

Real-time Traffic

Basic Linear Algebra Subprograms | Distributed And Parallel Computing | Incremental Pivoting | Pivoting | SPAA 2010 |

claim paper

Related Content

» Factorizing complex symmetric matrices with positive definite real and imaginary parts

» A Parallel Processing Architecture for Solving LargeScale Linear Systems

» Hierarchical Representations with Signatures for Large Expression Management

» Understanding intrinsic characteristics and system implications of flash memory based soli...

» p53FamTaG a database resource of human p53 p63 and p73 direct target genes combining in si...

» Threshold compression for 3G scalable monitoring

Post Info
More Details (n/a)

Added	30 Jan 2011
Updated	30 Jan 2011
Type	Journal
Year	2010
Where	SPAA
Authors	Ernie Chan, Robert A. van de Geijn, Andrew Chapman

Comments (0)