Implementation of A Reliable Volunteer Computing System with Credibility-based Voting

Implementation of A Reliable Volunteer Computing System with Credibility-based Voting
复制标题

具有基于可信度的投票的可靠志愿者计算系统的实现

DOI:
10.1109/candar.2014.41
复制
发表时间:
2014
期刊:
Int'l Symp. on Computing and Networking
影响因子:
--
通讯作者:
T. Sakai and M. Fukushi
T. Sakai and M. Fukushi
中科院分区:
--
文献类型:
--
作者:
Nobutaka Kito;Naofumi Takagi;T. Sakai and M. Fukushi

文献摘要

相似文献

为了实现高可靠性的志愿者计算(VC),本文实现了一个基于可信度投票的VC原型系统,并对其进行了评估。基于可信度的投票被认为是消除不正确计算结果的有效技术。虽然它的理论性能进行了详细的研究,并被证明是优于一个流行的投票方法,其真实的性能还没有得到评估。实现的原型VC系统由一个管理服务器和一些工人节点。在管理服务器中,包括基于资格的投票的每个处理是多线程的,并且所有信息在数据库(DB)中被管理。通过性能评估发现,基于可信度的投票是所有过程中耗时最多的,主要原因是数据库访问。同时也表明,多线程技术可以有效地减少投票等待时间,从而减少VC的总体执行时间。
For the purpose of realizing highly-reliable volunteer computing (VC), this paper implements and evaluates a prototype VC system with credibility-based voting. The credibility-based voting is known as an efficient technique for eliminating incorrect calculation results. Although its theoretical performance has studied in detail and is shown to be better than a popular voting method, its real performance has not been evaluated yet. The implemented prototype VC system consists of a management server and a number of worker nodes. In the management server, each process including the credibility-based voting is multithreaded, and all information are managed in a database (DB). It is found by performance evaluations that the credibility-based voting is most time-consuming all processes and the main cause is DB access. It is also shown that the multithreading is effective to reduce the waiting time of the credibility-based voting, thus reducing the overall execution time of VC.