Search
Now showing items 1-10 of 14
Coordinated cooperative work using undependable processors with unreliable broadcast
(IEEE Computer Society, 2014)
With the end of Moore's Law in sight, parallelism became the main means for speeding up computationally intensive applications, especially in the cases where large collections of tasks need to be performed. Network ...
The complexity of synchronous iterative Do-All 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 multi-agent collaboration. ...
Work-competitive 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 ...
Distributed Cooperation and Adversity: Complexity Trade-Offs
(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 ...
Work-competitive 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 ...
Brief Announcement: Optimally work-competitive scheduling for cooperative computing with merging groups
(2002)
The development of algorithms with guaranteed work efficiency for any pattern of fragmentations and merges of the underlying network is addressed. Current results are discussed for the abstract setting where asynchronous ...
Developing a consistent domain-oriented distributed object service
(2009)
This paper presents a new algorithm for a reconfigurable distributed domain-oriented atomic object service, called DO-RAMBO, which stands for Domain-Oriented Reconfigurable Atomic Memory for Basic Objects. This service is ...
Long-lived Rambo: Trading knowledge for communication
(2004)
Shareable data services providing consistency guarantees, such as atomicity (linearizability), make building distributed systems easier. However, combining linearizability with efficiency in practical algorithms is difficult. ...
Developing a consistent domain-oriented distributed object service
(2005)
This paper presents a new algorithm for a reconfigurable distributed domain-oriented atomic object service, called DO-RAMBO, which stands for Domain-Oriented Reconfigurable Atomic Memory for Basic Objects. This service is ...
Efficient gossip and robust distributed computation
(2003)
This paper presents an efficient deterministic gossip algorithm for p synchronous, crash-prone, message-passing processors. The algorithm has time complexity T = O(log2 p) and message complexity M = O(p1+ε), for any ε > ...