416 search results - page 1 / 84 » A Paradigm for Parallel Matrix Algorithms: |
EUROPAR
2005
Springer
13 years 10 months ago
2005
Springer
A style for programming problems from matrix algebra is developed with a familiar example and new tools, yielding high performance with a couple of surprising exceptions. The under...
CCGRID
2003
IEEE
13 years 9 months ago
2003
IEEE
This paper discusses the impact of the hierarchical master-worker paradigm on performance of an application program, which solves an optimization problem by a parallel branch and ...
MST
2010
12 years 11 months ago
2010
We consider triply-nested loops of the type that occur in the standard Gaussian elimination algorithm, which we denote by GEP (or the Gaussian Elimination Paradigm). We present tw...
ISCOPE
1999
Springer
13 years 8 months ago
1999
Springer
Fill-reducing sparse matrix orderings have been a topic of active research for many years. Although most such algorithms are developed and analyzed within a graph-theoretical frame...
IPPS
2000
IEEE
13 years 8 months ago
2000
IEEE
Abstract. Computer simulations of realistic applications usually require solving a set of non-linear partial di erential equations PDEs over a nite region. The process of obtaini...