108 search results - page 5 / 22 » Parallel Coarse Grain Computing of Boltzmann Machines |
MICRO
2007
IEEE
14 years 2 months ago
2007
IEEE
The emergence of multicore processors has heightened the need for effective parallel programming practices. In addition to writing new parallel programs, the next generation of pr...
ICPP
2006
IEEE
14 years 1 months ago
2006
IEEE
We present the first parallel algorithm for building a Hausdorff Voronoi diagram (HVD). Our algorithm is targeted towards cluster computing architectures and computes the Hausdor...
HPCC
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We present a parallel job scheduling approach for coarsegrain timesharing which preempts jobs to disk and avoids any additional memory pressure. The approach provides con...
EUROPAR
2004
Springer
14 years 1 months ago
2004
Springer
Computing a spanning tree and the connected components of a graph are basic problems in Graph Theory and arise as subproblems in many applications. Dehne et al. present a BSP/CGM a...
IPPS
1999
IEEE
13 years 12 months ago
1999
IEEE
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully par...