Utilize este identificador para referenciar este registo:
https://hdl.handle.net/10316/11252
Título: | Some issues in dense linear algebra for multicore and special purpose architectures | Autor: | Baboulin, Marc Dongarra, Jack Tomov, Stanimire |
Palavras-chave: | Dense linear algebra; Parallel algorithms; LU factorization; Multicore processors; Graphic process units | Data: | 2008 | Editora: | Centro de Matemática da Universidade de Coimbra | Citação: | Pré-Publicações DMUC. 08-21 (2008) | Resumo: | 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. | URI: | https://hdl.handle.net/10316/11252 | Direitos: | openAccess |
Aparece nas coleções: | FCTUC Matemática - Vários |
Ficheiros deste registo:
Ficheiro | Descrição | Tamanho | Formato | |
---|---|---|---|---|
Some issues in dense linear algebra for multicore.pdf | 269.33 kB | Adobe PDF | Ver/Abrir |
Visualizações de página
202
Visto em 16/abr/2024
Downloads
53
Visto em 16/abr/2024
Google ScholarTM
Verificar
Todos os registos no repositório estão protegidos por leis de copyright, com todos os direitos reservados.