Search
Now showing items 1-10 of 21
A distributed algorithm for gathering many fat mobile robots in the plane
(2013)
We revisit the problem of gathering autonomous robots in the plane. In particular, we consider non-transparent unit-disc robots (i.e., fat) in an asynchronous setting with vision as the only means of coordination and robots ...
Algorithmic mechanisms for reliable master-worker internet-based computing
(2014)
We consider Internet-based master-worker computations, where a master processor assigns, across the Internet, a computational task to a set of untrusted worker processors, and collects their responses. Examples of such ...
Brief announcement: Algorithmic mechanisms for internet-based computing under unreliable communication
(2011)
This work, using a game-theoretic approach, considers Internet-based computations, where a master processor assigns, over the Internet, a computational task to a set of untrusted worker processors, and collects their ...
Algorithmic mechanisms for internet supercomputing under unreliable communication
(2011)
This work, using a game-theoretic approach, considers Internet-based computations, where a master processor assigns, over the Internet, a computational task to a set of untrusted worker processors, and collects their ...
Applying the dynamics of evolution to achieve reliability in master-worker computing
(2013)
We consider Internet-based master-worker task computations, such as SETI@home, where a master process sends tasks, across the Internet, to worker processes
On the practicality of atomic MWMR register implementations
(2012)
In this work we conduct an experimental performance evaluation of four MWMR atomic register implementations: SFW from [8], APRX-SFW and CWFR from [11], and SIMPLE (the generalization of [5] in the MWMR environment). We ...
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 ...
Self-stabilizing virtual synchrony
(2015)
Virtual synchrony (VS) is an important abstraction that is proven to be extremely useful when implemented over asynchronous, typically large, message-passing distributed systems. Fault tolerant design is critical for the ...
On the automated implementation of time-based Paxos using the IOA compiler
(2010)
Paxos is a well known algorithm for achieving consensus in distributed environments with uncertain processing and communication timing. Implementations of its variants have been successfully used in the industry (eg., ...
On the competitiveness of scheduling dynamically injected tasks on processes prone to crashes and restarts
(2015)
To identify the tradeoffs between efficiency and fault-tolerance in dynamic cooperative computing, we initiate the study of a task performing problem under dynamic processes' crashes/restarts and task injections. The system ...