Ridge: combining reliability and performance in open grid platforms
Proceedings of the 16th international symposium on High performance distributed computing
QoS-Oriented Reputation-Aware Query Scheduling in Data Grids
Euro-Par '08 Proceedings of the 14th international Euro-Par conference on Parallel Processing
Runtime Estimations, Reputation and Elections for Top Performing Distributed Query Scheduling
CCGRID '09 Proceedings of the 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid
StatStream: providing statistical reliability guarantees in peer-to-peer live video streaming
International Journal of Advanced Media and Communication
Research on the Trust-Adaptive Scheduling for Data-Intensive Applications on Data Grids
WISM '09 Proceedings of the International Conference on Web Information Systems and Mining
Reputation-based estimation of individual performance in collaborative and competitive grids
Future Generation Computer Systems
Toward real-time, many-task applications on large distributed systems
EuroPar'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part I
| Hi-index | 0.00 |
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.