互联网计算:使用声誉从池中选择工人
Internet Computing: Using Reputation to Select Workers from a Pool
摘要:
与超级计算机相比,通过互联网分配和执行任务是一种廉价的解决方案。我们考虑一个基于互联网的主-工任务计算方法,如SETI@home。主进程通过Internet向工作进程发送任务。工人执行,并报告结果。不幸的是,这种方法的缺点是工作进程的不可靠性。通过不同的研究,工人被分为恶意(总是报告错误的结果),利他主义(总是报告正确的结果)或理性(报告任何最大化他们利益的结果)。我们开发了一种基于信誉的机制,它保证master最终总是会收到正确的任务结果。我们通过强化学习对理性工人的行为进行建模,并提出了三种不同的声誉类型来选择,对于每一轮计算,从工人池中选择最有信誉的。由于工人并非总是可用,我们加强了声誉计划,以选择最积极的工人。我们证明了在不同的声誉类型下的最终正确性的充分条件。我们的分析是由模拟探索各种情况下的补充。我们的模拟结果揭示了有趣的权衡不同的声誉类型,工人的可用性和成本。
英文摘要:
The assignment and execution of tasks over the Internet is an inexpensive solution in contrast with supercomputers. We consider an Internet-based Master-Worker task computing approach, such as SETI@home. A master process sends tasks, across the Internet, to worker processors. Workers execute, and report back a result. Unfortunately, the disadvantage of this approach is the unreliable nature of the worker processes. Through different studies, workers have been categorized as either malicious (always report an incorrect result), altruistic (always report a correct result), or rational (report whatever result maximizes their benefit). We develop a reputation-based mechanism that guarantees that, eventually, the master will always be receiving the correct task result. We model the behavior of the rational workers through reinforcement learning, and we present three different reputation types to choose, for each computational round, the most reputable from a pool of workers. As workers are not always available, we enhance our reputation scheme to select the most responsive workers. We prove sufficient conditions for eventual correctness under the different reputation types. Our analysis is complemented by simulations exploring various scenarios. Our simulation results expose interesting trade-offs among the different reputation types, workers availability, and cost.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。