Please use this identifier to cite or link to this item:
Title: Some issues in dense linear algebra for multicore and special purpose architectures
Authors: Baboulin, Marc 
Dongarra, Jack 
Tomov, Stanimire 
Keywords: Dense linear algebra; Parallel algorithms; LU factorization; Multicore processors; Graphic process units
Issue Date: 2008
Publisher: Centro de Matemática da Universidade de Coimbra
Citation: Pré-Publicações DMUC. 08-21 (2008)
Abstract: We address some key issues in designing dense linear algebra (DLA) algorithms that are common for both multi/many-cores and special purpose architectures (in particular GPUs). We present them in the context of an LU factorization algorithm, where randomization techniques are used as an alternative to pivoting. This approach yields an algorithm based entirely on a collection of small Level 3 BLAS type computational tasks, which has emerged as a common goal in designing DLA algorithms for new architectures. Other common trends, also considered here, are block asynchronous task execution and “Block” layouts for the data associated with the separate tasks. We present numerical results and other specific experiments with DLA algorithms on NVIDIA GPUs using CUDA. The GPU results are also of interest themselves as we show a performance of up to 160 Glop/s on a single Quadro FX 5600 card.
Rights: openAccess
Appears in Collections:FCTUC Matemática - Vários

Files in This Item:
File Description SizeFormat
Some issues in dense linear algebra for multicore.pdf269.33 kBAdobe PDFView/Open
Show full item record

Page view(s)

checked on Aug 4, 2022


checked on Aug 4, 2022

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.