11 search results - page 1 / 3 » Tight Bounds on the Round Complexity of Distributed 1-Solvab... |
WDAG
1990
Springer
13 years 9 months ago
1990
Springer
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...
STOC
2005
ACM
14 years 5 months ago
2005
ACM
Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This ...
COMCOM
2004
13 years 5 months ago
2004
In the emerging high-speed packet-switched networks, fair packet scheduling algorithms in switches and routers will form an important component of the mechanisms that seek to sati...
WDAG
2001
Springer
13 years 9 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 ...
SIAMCOMP
2011
13 years 10 days ago
2011
Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This ...