Search
Now showing items 11-20 of 21
Asynchronous gossip
(2013)
We study the complexity of gossip in an asynchronous, message-passing fault-prone distributed system. We show that an adaptive adversary can significantly hamper the spreading of a rumor, while an oblivious adversary cannot. ...
Performing dynamically injected tasks on processes prone to crashes and restarts
(2011)
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 ...
Reliable internet-based master-worker computing in the presence of malicious workers
(2012)
We consider a Master-Worker distributed system where a master processor assigns, over the Internet, tasks to a collection of n workers, which are untrusted and might act maliciously. In addition, a worker may not reply to ...
Algorithmic mechanisms for internet-based master-worker computing with untrusted and selfish workers
(2010)
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
Measuring the impact of adversarial errors on packet scheduling strategies
(2013)
In this paper we explore the problem of achieving efficient packet transmission over unreliable links with worst case occurrence of errors. In such a setup, even an omniscient offline scheduling strategy cannot achieve ...
Adaptive scheduling over a wireless channel under constrained jamming
(2015)
We consider a wireless channel between a single pair of stations (sender and receiver) that is being “watched” and disrupted by a malicious, adversarial jammer. The sender’s objective is to transmit as much useful data as ...
Algorithmic mechanisms for reliable crowdsourcing computation under collusion
(2015)
We consider a computing system where a master processor assigns a task for execution to worker processors that may collude. We model the workers' decision of whether to comply (compute the task) or not (return a bogus ...
Online parallel scheduling of non-uniform tasks: Trading failures for energy
(2015)
Consider a system in which tasks of different execution times arrive continuously and have to be executed by a set of machines that are prone to crashes and restarts. In this paper we model and study the impact of parallelism ...
Competitive analysis of task scheduling algorithms on a fault-prone machine and the impact of resource augmentation
(2015)
Reliable task execution on machines that are prone to unpredictable crashes and restarts is both important and challenging, but not much work exists on the analysis of such systems. We consider the online version of the ...