4670 search results - page 676 / 934 » Testing that distributions are close |
198
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
Parallel programming is elusive. The relative performance of di erent parallel implementations varies with machine architecture, system and problem size. How to compare di erent i...
152
click to vote
ISHPC
2000
Springer
15 years 10 months ago
2000
Springer
Isosurface generation algorithms usually need a vertex-identification process since most of polygon-vertices of an isosurface are shared by several polygons. In our observation the...
181
click to vote
HPCA
1995
IEEE
15 years 10 months ago
1995
IEEE
Shared memory is an appealing abstraction for parallel programming. It must be implemented with caches in order toperform well, however, and caches require a coherence mechanism t...
216
click to vote
ICPP
1995
IEEE
15 years 10 months ago
1995
IEEE
– In this paper we present experiments with a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the smaller gra...
145
click to vote
ICS
1995
Tsinghua U.
15 years 10 months ago
1995
Tsinghua U.
The elimination of induction variables and the parallelization of reductions in FORTRAN programs have been shown to be integral to performance improvement on parallel computers 7,...