157 search results - page 4 / 32 » Passing Messages to Lonely Numbers |
HM
2005
Springer
15 years 3 months ago
2005
Springer
We present a shared memory approach to the parallelization of the Ant Colony Optimization (ACO) metaheuristic and a performance comparison with an existing message passing implemen...
OPODIS
2003
14 years 11 months ago
2003
A fundamental problem in distributed computing is performing a set despite failures and delays. Stated abstractly, the problem is to perform N tasks using P failure-prone processor...
PDPTA
2003
14 years 11 months ago
2003
We investigate the management of flocking mobile objects using a parallel message-passing computer cluster. An octree, a data structure well-known for use in managing a 3D space, ...
WDAG
1997
Springer
15 years 2 months ago
1997
Springer
Abstract. This work presents new algorithms for the "Do-All" problem that consists of performing t tasks reliably in a message-passing synchronous system of p fault-prone...
ICPP
1996
IEEE
15 years 2 months ago
1996
IEEE
In s-to-p broadcasting, s processors in a p-processor machine contain a message to be broadcast to all the processors, 1 s p. We present a number of different broadcasting algori...