Reputation-Based Scheduling on Unreliable Distributed Infrastructures
Reputation-Based Scheduling on Unreliable Distributed Infrastructures
复制标题
不可靠分布式基础设施上基于信誉的调度
DOI：
--
复制
发表时间：
2006
期刊：
影响因子：
--
通讯作者：
J. Weissman
中科院分区：
文献类型：
--
作者：
Jason D. Sonnek;Mukesh Nathan;A. Chandra;J. Weissman
针对P2P和网格系统等基于捐赠的大规模分布式基础设施中工作节点固有的不可靠性和不稳定性，设计并分析了一种调度技术。特别是，我们关注的是通过捐赠的计算资源执行任务的节点，并且可能行为不稳定或恶意。我们提出了一个模型，在该模型中，可靠性不是二进制属性，而是基于节点的先验性能和行为的统计属性。我们使用这个模型构造了几种基于信誉的调度算法，这些算法利用估计的工作节点的可靠性评级来有效地分配任务。通过对一个类似BOINC的分布式计算基础设施的仿真，我们证明了我们的算法可以在保持很高的任务完成成功率的同时显著提高吞吐量。
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.