Bayanihan: building and studying web-based volunteer computing systems using Java

Sarmenta, Luis F. G.; Hirano, Seishiro

doi:10.1016/s0167-739x(99)00018-7

Cited by 131 publications

(86 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…To enhance the inefficiency of the m-first voting, credibility-based voting [9] is proposed. This method defines a credibility for each system element such as worker, result, and job, and performs a weighted voting.…”

Section: Credibility-based Votingmentioning

confidence: 99%

See 1 more Smart Citation

Dynamic Job Scheduling Method Based on Expected Probability of Completion of Voting in Volunteer Computing

Miyakoshi

Yasuda

Watanabe

et al. 2015

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

SUMMARYThis paper addresses the problem of job scheduling in volunteer computing (VC) systems where each computation job is replicated and allocated to multiple participants (workers) to remove incorrect results by a voting mechanism. In the job scheduling of VC, the number of workers to complete a job is an important factor for the system performance; however, it cannot be fixed because some of the workers may secede in real VC. This is the problem that existing methods have not considered in the job scheduling. We propose a dynamic job scheduling method which considers the expected probability of completion (EPC) for each job based on the probability of worker's secession. The key idea of the proposed method is to allocate jobs so that EPC is always greater than a specified value (SPC). By setting SPC as a reasonable value, the proposed method enables to complete jobs without excess allocation, which leads to the higher performance of VC systems. We assume in this paper that worker's secession probability follows Weibull-distribution which is known to reflect more practical situation. We derive parameters for the distribution using actual trace data and compare the performance of the proposed and the previous method under the Weibull-distribution model, as well as the previous constant probability model. Simulation results show that the performance of the proposed method is up to 5 times higher than that of the existing method especially when the time for completing jobs is restricted, while keeping the error rate lower than a required value.

show abstract

Section: Credibility-based Votingmentioning

confidence: 99%

“…To enhance the inefficiency of the m-first voting, credibility-based voting [9] is proposed. This method performs a weighted voting based on each worker's credibility, the probability of returning correct results.…”

Section: Introductionmentioning

confidence: 99%

Dynamic Job Scheduling Method Based on Expected Probability of Completion of Voting in Volunteer Computing

Miyakoshi

Yasuda

Watanabe

et al. 2015

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

show abstract

“…[19]. Other problems used in experiments were: DES code breaking [10], matrix multiplication [16] [68], Traveling Salesman Problem [16][24] [67], Mandelbrot generation [69] [70], searching for Mersenne primes using LucasLehmer primality test [56] [29], Collatz hypothesis verification [56], the factorization of large integer into two primes and Pearson correlation evaluation on set of genetic samples [9].…”

Section: Introductionmentioning

confidence: 99%

Browser-based Harnessing of Voluntary Computational Power

Fabisiak

Danilecki

2017

Foundations of Computing and Decision Sciences

View full text Add to dashboard Cite

Abstract. Computers connected to internet represent an immense computing power, mostly unused by their owners. One way to utilize this public resource is via world wide web, where users can share their resources using nothing more except their browsers. We survey the techniques employing the idea of browser-based voluntary computing (BBVC), discuss their commonalities, recognize recurring problems and their solutions and finally we describe a prototype implementation aiming at efficient mining of voluntary-contributed computing power.

show abstract

“…Several recent implementations of distributed computing platforms address the general issues of fault-tolerance [2,3,4,6,14,17], but assume a fault model in which errors that occur are not the result of malicious intent. The solutions presented are typically a combination of redundancy with voting and spot checking.…”

Section: Related Workmentioning

confidence: 99%

“…The past few years have seen the development of distributed computing platforms designed to utilize the spare processor cycles of a large number of personal computers attached to the Internet (see [2,3,4,6,14,17] for academic endeavors, [19] for a list of commercial platforms). The computing power harnessed by these systems can top several petaflops, making them well suited for solving some SIMD-style parallel computations that previously required the use of supercomputers.…”

Section: Introductionmentioning

confidence: 99%