844 search results - page 18 / 169 » Truncated Message Passing |
OPODIS
2003
13 years 9 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
13 years 9 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, ...
SEFM
2008
IEEE
14 years 2 months ago
2008
IEEE
The only practical way to test distributed messagepassing systems is to use local testing. In this approach, used in formalisms such as concurrent TTCN-3, some components are repl...
WDAG
1997
Springer
13 years 12 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...
CLUSTER
2004
IEEE
13 years 7 months ago
2004
IEEE
Fault tolerance in parallel systems has traditionally been achieved through a combination of redundancy and checkpointing methods. This notion has also been extended to message-pas...