84 search results - page 12 / 17 » A Parallel Distance-2 Graph Coloring Algorithm for Distribut... |
IPPS
2010
IEEE
13 years 4 months ago
2010
IEEE
Abstract--For the management of a virtual P2P supercomputer one is interested in subgroups of processors that can communicate with each other efficiently. The task of finding these...
PODC
2010
ACM
13 years 10 months ago
2010
ACM
We demonstrate how to leverage a system’s capability for allto-all communication to achieve an exponential speed-up of local algorithms despite bandwidth and memory restrictions...
IPPS
2007
IEEE
14 years 1 months ago
2007
IEEE
The GCA (Global Cellular Automata) model consists of a collection of cells which change their states synchronously depending on the states of their neighbors like in the classical...
IEEEPACT
1998
IEEE
13 years 11 months ago
1998
IEEE
Register coalescing is used, as part of register allocation, to reduce the number of register copies. Developing efficient register coalescing heuristics is particularly important ...
PPSN
1992
Springer
13 years 10 months ago
1992
Springer
This paper introduces a new optimization technique called hyperplane annealing. It is similar to the mean field annealing approach to combinatorial optimization. Both annealing te...