186 search results - page 11 / 38 » Run-Time Techniques for Parallelizing Sparse Matrix Problems |
JCSS
2008
13 years 7 months ago
2008
Dynamically allocating computing nodes to parallel applications is a promising technique for improving the utilization of cluster resources. Detailed simulations can help identify...
PPSC
1993
13 years 8 months ago
1993
We present a new approach to preconditioning for very large, sparse, non-symmetric, linear systems. We explicitly compute an approximate inverse to our original matrix that can be...
HPCC
2007
Springer
13 years 11 months ago
2007
Springer
A wide class of geometry processing and PDE resolution methods needs to solve a linear system, where the non-zero pattern of the matrix is dictated by the connectivity matrix of th...
PVM
2004
Springer
14 years 27 days ago
2004
Springer
In SMP clusters it is not always convenient to switch from pure message-passing code to hybrid software designs that exploit shared memory. This paper tackles the problem of restru...
SIAMSC
2010
13 years 6 months ago
2010
The emergence of multicore architectures and highly scalable platforms motivates the development of novel algorithms and techniques that emphasize concurrency and are tolerant of ...