Sciweavers

2303 search results - page 102 / 461
» Interior-Point Methods in Parallel Computation
Sort
View
155
Voted
ACPC
1999
Springer
15 years 6 months ago
Non-standard Parallel Solution Strategies for Distributed Sparse Linear Systems
Abstract. A number of techniques are described for solving sparse linear systems on parallel platforms. The general approach used is a domaindecomposition type method in which a pr...
Yousef Saad, Masha Sosonkina
EUROPAR
2007
Springer
15 years 6 months ago
On Using Incremental Profiling for the Performance Analysis of Shared Memory Parallel Applications
Abstract. Profiling is often the method of choice for performance analysis of parallel applications due to its low overhead and easily comprehensible results. However, a disadvanta...
Karl Fürlinger, Michael Gerndt, Jack Dongarra
123
Voted
IPPS
1995
IEEE
15 years 6 months ago
Performance evaluation of a new parallel preconditioner
The linear systems associated with large, sparse, symmetric, positive definite matrices are often solved iteratively using the preconditioned conjugate gradient method. We have d...
Keith D. Gremban, Gary L. Miller, Marco Zagha
123
Voted
ICPP
2008
IEEE
15 years 9 months ago
Scioto: A Framework for Global-View Task Parallelism
We introduce Scioto, Shared Collections of Task Objects, a lightweight framework for providing task management on distributed memory machines under one-sided and globalview parall...
James Dinan, Sriram Krishnamoorthy, D. Brian Larki...
ICPPW
2005
IEEE
15 years 8 months ago
Performance Prophet: A Performance Modeling and Prediction Tool for Parallel and Distributed Programs
High-performance computing is essential for solving large problems and for reducing the time to solution for a single problem. Current top high-performance computing systems conta...
Sabri Pllana, Thomas Fahringer