Reputation-based scheduling on unreliable distributed infrastructures

Jason Sonnek, Mukesh Nathan, Abhishek Chandra, Jon Weissman

Research output: Chapter in Book/Report/Conference proceedingConference contribution

32 Scopus citations

Abstract

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.

Original languageEnglish (US)
Title of host publication26th IEEE Internationa26th IEEE International Conference on Distributed Computing Systems, ICDCS 2006
DOIs
StatePublished - 2006
Event26th IEEE Internationa26th IEEE International Conference on Distributed Computing Systems, ICDCS 2006 - Lisboa, Portugal
Duration: Jul 4 2006Jul 7 2006

Publication series

NameProceedings - International Conference on Distributed Computing Systems
Volume2006

Other

Other26th IEEE Internationa26th IEEE International Conference on Distributed Computing Systems, ICDCS 2006
CountryPortugal
CityLisboa
Period7/4/067/7/06

Fingerprint Dive into the research topics of 'Reputation-based scheduling on unreliable distributed infrastructures'. Together they form a unique fingerprint.

Cite this