Name
Abstract | ||
|---|---|---|
Volunteer computing grids offer significant computing power at relatively low cost to researchers, while at the same time generating public interest in different scientific projects. However, in order to be used effectively, their heterogeneity, volatility and restrictive computing models must be overcome. As these computing grids are open, incorrect or malicious results must also be handled. This paper examines extending the BOINC volunteer computing framework to allow for asynchronous global optimization as applied to scientific computing problems. The asynchronous optimization method used is resilient to faults and the heterogeneous nature of volunteer computing grids, while allowing scalability to tens of thousands of hosts. A work verification strategy that does not require the validation of every result is presented. This is shown to be able to effectively reduce the need for verification done to less than 30% of the reported results, without degrading the performance of the asynchronous search methods. An asynchronous version of particle swarm optimization (APSO) is presented and com- pared to previously used asynchronous genetic search (AGS) using the MilkyWay@Home BOINC computing project. Both search methods are shown to scale to MilkyWay@Home’s current user base, over 75,000 heterogeneous and volatile hosts, something not possible for traditional optimization methods. APSO is shown to provide faster convergence to optimal results while being less sensitive to its search parameters. The verification strategy presented is shown to be effective for both AGS and APSO. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1109/e-Science.2009.44 | eScience |
Keywords | Field | DocType |
restrictive computing model,asynchronous genetic search,boinc volunteer computing framework,computing grid,volunteer computing grids,asynchronous global optimization,home boinc computing project,scientific computing problem,volunteer computing grid,asynchronous optimization method,robust asynchronous optimization,significant computing power,data mining,redundancy,grid computing,genetics,particle swarm,particle swarm optimization,computer model,scientific computing,global optimization,astroinformatics | Convergence (routing),Particle swarm optimization,Asynchronous communication,Grid computing,Global optimization,Computer science,Redundancy (engineering),Astroinformatics,Distributed computing,Scalability | Conference |
ISBN | Citations | PageRank |
978-0-7695-3877-8 | 4 | 0.68 |
References | Authors | |
15 | 6 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Travis Desell | 1 | 116 | 18.56 |
| Malik Magdon-Ismail | 2 | 914 | 104.34 |
| Boleslaw K. Szymanski | 3 | 2503 | 200.55 |
| Carlos Varela | 4 | 47 | 4.85 |
| Heidi Newberg | 5 | 5 | 1.04 |
| Nathan Cole | 6 | 8 | 1.15 |