Browsing by Subject "Work complexity"
Now showing items 17 of 7

Article
The complexity of synchronous iterative DoAll with crashes
(2004)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 distributed simulation and multiagent collaboration. ...

Article
The complexity of synchronous iterative doall with crashes
(2001)DoAll is the problem of performing N tasks in a distributed system of P failureprone processors [8]. Many distributed and parallel algorithms have been developed for this problem and several algorithm simulations have ...

Conference Object
Distributed Cooperation and Adversity: Complexity TradeOffs
(2003)The problem of cooperatively performing a collection of tasks in a decentralized setting where the computing medium is subject to adversarial perturbations is one of the fundamental problems in distributed computing. Such ...

Article
The DoAll problem with Byzantine processor failures
(2005)DoAll is the abstract problem of using n processors to cooperatively perform m independent tasks in the presence of failures. This problem and its derivatives have been a centerpiece in the study of tradeoffs between ...

Article
Failuresensitive analysis of parallel algorithms with controlled memory access concurrency
(2007)The abstract problem of using P failureprone processors to cooperatively update all locations of an Nelement shared array is called WriteAll. Solutions to WriteAll can be used iteratively to construct efficient simulations ...

Article
Workcompetitive scheduling for cooperative computing with dynamic groups
(2005)The problem of cooperatively performing a set of t tasks in a decentralized computing environment subject to failures is one of the fundamental problems in distributed computing. The setting with partitionable networks is ...

Conference Object
Workcompetitive scheduling for cooperative computing with dynamic groups
(2003)The problem of cooperatively performing a set of t tasks in a decentralized setting where the computing medium is subject to failures is one of the fundamental problems in distributed computing. The setting with partitionable ...