271 search results - page 8 / 55 » Distributed Problem Solving In SPite Of Processor Failures |
114
click to vote
IPPS
2000
IEEE
15 years 6 months ago
2000
IEEE
This paper is on the Consensus problem, in the context of asynchronous distributed systems made of n processes, at most f of them may crash. A family of failure detector classes s...
109
click to vote
IPPS
2003
IEEE
15 years 7 months ago
2003
IEEE
Given two strings and of lengths Ñ and Ò, respectively, the all-substrings longest common subsequence (ALCS) problem obtains the lengths of the subsequences common to and any su...
126
click to vote
OPODIS
2003
15 years 3 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...
107
click to vote
ASIAN
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. The concept of unreliable failure detectors for reliable distributed systems was introduced by Chandra and Toueg as a fine-grained means to add weak forms of synchrony i...
143
click to vote
WDAG
2001
Springer
15 years 6 months ago
2001
Springer
Abstract. The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to ...