130 search results - page 6 / 26 » Solving Dense Linear Systems on Graphics Processors |
IPPS
1998
IEEE
15 years 2 months ago
1998
IEEE
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
159
click to vote
GIS
2008
ACM
15 years 11 months ago
2008
ACM
We introduce a parallel approximation of an Over-determined Laplacian Partial Differential Equation solver (ODETLAP) applied to the compression and restoration of terrain data use...
DAC
2009
ACM
15 years 11 months ago
2009
ACM
State-of-the-art integral-equation-based solvers rely on techniques that can perform a matrix-vector multiplication in O(N) complexity. In this work, a fast inverse of linear comp...
104
click to vote
EUROPAR
2009
Springer
15 years 3 months ago
2009
Springer
Abstract. We investigate the performance of two approaches for matrix inversion based on Gaussian (LU factorization) and Gauss-Jordan eliminations. The target architecture is a cur...
SC
2009
ACM
15 years 5 months ago
2009
ACM
This paper presents a dynamic task scheduling approach to executing dense linear algebra algorithms on multicore systems (either shared-memory or distributed-memory). We use a tas...