271 search results - page 23 / 55 » Distributed Problem Solving In SPite Of Processor Failures |
SPAA
1990
ACM
13 years 11 months ago
1990
ACM
We give the first efficient parallel algorithms for solving the arrangement problem. We give a deterministic algorithm for the CREW PRAM which runs in nearly optimal bounds of O(lo...
FOCS
1993
IEEE
13 years 11 months ago
1993
IEEE
: Weprove tight bounds on the time needed to solve k-set agreement, a natural generalization of consensus. We analyze this problem in a synchronous, message-passing model where pro...
PRDC
2006
IEEE
14 years 1 months ago
2006
IEEE
The finite average response time model is a very weak distributed systems model: it permits runs with unbounded transmission and processing delays and it does not bound the relat...
IPPS
2005
IEEE
14 years 1 months ago
2005
IEEE
— Program code size is a critical factor in determining the manufacturing cost of many embedded systems, particularly those aimed at the extremely costconscious consumer market. ...
PRDC
2006
IEEE
14 years 1 months ago
2006
IEEE
End-to-end consensus ensures delivery of the same value to the application layer running in distributed processes. Deliveries that have not been acknowledged by the application be...