Sciweavers

ICDCS
2006
IEEE

Reputation-Based Scheduling on Unreliable Distributed Infrastructures

13 years 9 months ago
Reputation-Based Scheduling on Unreliable Distributed Infrastructures
This paper presents a design and analysis of scheduling techniques to cope with the inherent unreliability and instability of worker nodes in large-scale donation-based distributed infrastructures such as P2P and Grid systems. In particular, we focus on nodes that execute tasks via donated computational resources and may behave erratically or maliciously. We present a model in which reliability is not a binary property but a statistical one based on a node’s prior performance and behavior. We use this model to construct several reputation-based scheduling algorithms that employ estimated reliability ratings of worker nodes for efficient task allocation. Through simulation of a BOINC-like distributed computing infrastructure, we demonstrate that our algorithms can significantly improve throughput, while maintaining a very high success rate of task completion.
Jason D. Sonnek, Mukesh Nathan, Abhishek Chandra,
Added 11 Jun 2010
Updated 11 Jun 2010
Type Conference
Year 2006
Where ICDCS
Authors Jason D. Sonnek, Mukesh Nathan, Abhishek Chandra, Jon B. Weissman
Comments (0)