Search
Now showing items 241-249 of 249
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 ...
The Do-All problem with Byzantine processor failures
(2005)
Do-All 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 trade-offs between ...
Measuring the impact of adversarial errors on packet scheduling strategies
(2016)
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 ...
The structure and complexity of Nash equilibria for a selfish routing game
(2009)
In this work, we study the combinatorial structure and the computational complexity of Nash equilibria for a certain game that models selfish routing over a network consisting of m parallel links. We assume a collection ...
The structure and complexity of Nash equilibria for a selfish routing game
(2002)
In this work, we study the combinatorial structure and the computational complexity of Nash equilibria for a certain game that models selfish routing over a network consisting of m parallel links. We assume a collection ...
Two-Electron Transfer Pathways
(2015)
The frontiers of electron-transfer chemistry demand that we develop theoretical frameworks to describe the delivery of multiple electrons, atoms, and ions in molecular systems. When electrons move over long distances through ...
Results of parallel implementations of the selection problem using sisal
(Publ by Elsevier Science Publishers B.V., 1993)
This paper presents an in depth analysis on the parallel implementation of four of the standard selection algorithms using a functional language on a number of multiprocessor and supercomputers. Three of the algorithms: ...