186 search results - page 1 / 38 » Run-Time Techniques for Parallelizing Sparse Matrix Problems |
IRREGULAR
1995
Springer
13 years 8 months ago
1995
Springer
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...
PARLE
1994
13 years 8 months ago
1994
Sparse matrix-vector multiplication forms the heart of iterative linear solvers used widely in scientific computations (e.g., finite element methods). In such solvers, the matrix-v...
IPPS
1996
IEEE
13 years 8 months ago
1996
IEEE
Many irregular scientific computing problems can be modeled by directed acyclic task graphs (DAGs). In this paper, we present an efficient run-time system for executing general as...
HPCA
1998
IEEE
13 years 8 months ago
1998
IEEE
Run-time parallelization is often the only way to execute the code in parallel when data dependence information is incomplete at compile time. This situation is common in many imp...
IPPS
1999
IEEE
13 years 8 months ago
1999
IEEE
On many computers, a request to run a job is not serviced immediately but instead is placed in a queue and serviced only when resources are released by preceding jobs. In this pape...