Sciweavers

230 search results - page 6 / 46
» Sparse matrix factorization on massively parallel computers
Sort
View
IPPS
2007
IEEE
14 years 1 months ago
Memory Optimizations For Fast Power-Aware Sparse Computations
— We consider memory subsystem optimizations for improving the performance of sparse scientific computation while reducing the power consumed by the CPU and memory. We first co...
Konrad Malkowski, Padma Raghavan, Mary Jane Irwin
PPAM
2007
Springer
14 years 1 months ago
A Supernodal Out-of-Core Sparse Gaussian-Elimination Method
Abstract. We present an out-of-core sparse direct solver for unsymmetric linear systems. The solver factors the coefficient matrix A into A = PLU using Gaussian elimination with pa...
Sivan Toledo, Anatoli Uchitel
IRREGULAR
1995
Springer
13 years 10 months ago
Run-Time Techniques for Parallelizing Sparse Matrix Problems
Sparse matrix problems are di cult to parallelize e ciently on message-passing machines, since they access data through multiple levels of indirection. Inspector executor strategie...
Manuel Ujaldon, Shamik D. Sharma, Joel H. Saltz, E...
ASAP
2006
IEEE
121views Hardware» more  ASAP 2006»
13 years 10 months ago
Reconfigurable Fixed Point Dense and Sparse Matrix-Vector Multiply/Add Unit
In this paper, we propose a reconfigurable hardware accelerator for fixed-point-matrix-vector-multiply/add operations, capable to work on dense and sparse matrices formats. The pr...
Humberto Calderon, Stamatis Vassiliadis