186 search results - page 29 / 38 » Run-Time Techniques for Parallelizing Sparse Matrix Problems |
SIAMSC
2010
13 years 5 months ago
2010
Abstract. Popular approaches for solving the shallow water equations (SWE) for climate modeling are explicit and semi-implicit methods, both have certain constraints on the time st...
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
IPPS
1998
IEEE
13 years 11 months ago
1998
IEEE
Abstract. LAPACK90 is a set of LAPACK90 subroutines which interfaces FORTRAN90 with LAPACK. All LAPACK driver subroutines including expert drivers and some LAPACK computationals ha...
SPAA
1997
ACM
13 years 11 months ago
1997
ACM
Pipelining has been used in the design of many PRAM algorithms to reduce their asymptotic running time. Paul, Vishkin, and Wagener (PVW) used the approach in a parallel implementat...
PPOPP
2006
ACM
14 years 1 months ago
2006
ACM
In prior work, we have proposed techniques to extend the ease of shared-memory parallel programming to distributed-memory platforms by automatic translation of OpenMP programs to ...