108 search results - page 4 / 22 » Parallel Coarse Grain Computing of Boltzmann Machines |
SC
1995
ACM
13 years 11 months ago
1995
ACM
This paper presents an extensive empirical evaluation of an interprocedural parallelizing compiler, developed as part of the Stanford SUIF compiler system. The system incorporates...
IPPS
1997
IEEE
13 years 12 months ago
1997
IEEE
IPPS
2007
IEEE
14 years 2 months ago
2007
IEEE
WG
2000
Springer
13 years 11 months ago
2000
Springer
IPPS
1999
IEEE
13 years 12 months ago
1999
IEEE
We present a coarse grained parallel algorithm for computing a maximum matching in a convex bipartite graph G = A;B;E. For p processors with N=p memory per processor, N = jAj+jBj,...