2303 search results - page 103 / 461 » Interior-Point Methods in Parallel Computation |
139
Voted
APPT
2007
Springer
15 years 4 months ago
2007
Springer
Dynamic programming is a widely applied algorithm design technique in many areas such as computational biology and scientific computing. Typical applications using this technique a...
110
Voted
PPSC
1993
15 years 3 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...
121
Voted
IPPS
2007
IEEE
15 years 8 months ago
2007
IEEE
Computational phylogeny is a challenging application even for the most powerful supercomputers. It is also an ideal candidate for benchmarking emerging multiprocessor architecture...
113
Voted
EUROPAR
2010
Springer
15 years 3 months ago
2010
Springer
This work presents an application case study. Geant4 is a 750,000 line toolkit first designed in the mid-1990s and originally intended only for sequential computation. Intel's...
154
Voted
IPPS
2010
IEEE
15 years 14 days ago
2010
IEEE
To exploit the potential of multicore architectures, recent dense linear algebra libraries have used tile algorithms, which consist in scheduling a Directed Acyclic Graph (DAG) of...