Advertisement

Journal of Grid Computing

, 7:519 | Cite as

Improving the Productivity of Volunteer Computing by Using the Most Effective Task Retrieval Policies

  • David Toth
  • David Finkel
Article

Abstract

Volunteer computing projects have been used to make significant advances in knowledge since the 1990s. These projects use idle CPU cycles donated by people to solve computationally intensive problems in medicine, the sciences and other disciplines. It is important to use the donated cycles as efficiently as possible because participation in volunteer computing is low and the number of volunteer computing projects keeps increasing. Task retrieval policies, policies describing when a volunteered computer requests additional work from a server, can have an effect on the number of wasted CPU cycles and consequently, the number of tasks completed by clients. We present the results of simulating different task retrieval policies for clients under realistic conditions, including clients running on computers with one single-core CPU, clients running on computers with multi-core CPUs, and clients running on computers that are put into a power save mode by environmentally conscious owners.

Keywords

Volunteer computing Performance Task retrieval Simulation 

References

  1. 1.
    Anderson, D.P.: BOINC: a system for public resource computing and storage. In: 5th IEEE/ACM International Workshop on Grid Computing, Pittsburgh, USA, 8 November 2004Google Scholar
  2. 2.
    Anderson, D.P., Cobb, J., Korpela, E., Lebofsky, M., Wertheimer, D.: SETI@home: an experiment in public-resource computing. Commun. ACM 45(11), 56–61 (2002)CrossRefGoogle Scholar
  3. 3.
    Folding@Home: Folding@Home distributed computing. http://folding.stanford.edu/. Accessed 26 October 2006
  4. 4.
    GIMPS: mersenne prime search. http://www.mersenne.org/prime.htm. Accessed 13 July 2005
  5. 5.
    Bohannon, J.: Grassroots supercomputing. Science 308, 810–813 (2005)CrossRefGoogle Scholar
  6. 6.
    Toth, D., Finkel, D.: File-based tasks for public-resource computing. In: Proceedings of The 17th IASTED International Conference on Parallel and Distributed Computing and Systems - PDCS 2005, pp. 398–403, Phoenix, Arizona, USA, 14–16 November 2005Google Scholar
  7. 7.
    Toth, D., Finkel, D.: Increasing the amount of work completed by volunteer computing projects with task distribution policies. In: Proceedings of the 2nd Workshop on Desktop Grids and Volunteer Computing Systems - PCGrid 2008, Miami, Florida, USA, 18 April 2008Google Scholar
  8. 8.
    Toth, D.: The impact of multi-core architectures on task retrieval policies for volunteer computing. In: Proceedings of the 20th IASTED International Conference on Parallel and Distributed Computing and Systems - PDCS 2008, pp. 330–335, Orlando, Florida, USA, 16–18 November 2008Google Scholar
  9. 9.
    Toth, D.: Improving the productivity of volunteer computing. Ph.D. Dissertation (2008)Google Scholar
  10. 10.
    Toth, D., Finkel, D.: Characterizing resource availability for volunteer computing and its impact on task distribution methods. In: Proceedings of the 6th WSEAS International Conference on Software Engineering, Parallel and Distributed Systems - SEPADS 2007, Corfu, Greece, 16–19 February 2007Google Scholar
  11. 11.
    Mutka, M.H., Livny, M.: Profiling workstations’ available capacity for remote execution. In: Proc.12th IFIP WG 7.3 International Symposium on Computer Performance Modeling, Measurement and Evaluation, pp. 529–544. Brussels, Belgium (1987)Google Scholar
  12. 12.
    Acharya, A., Edjlali, G., Saltz, J.: The utility of exploiting idle workstations for parallel computation. In: Proceedings of SIGMETRICS’97, pp. 225–234. Seattle, Washington, USA (1997)Google Scholar
  13. 13.
    Kondo, D., Taufer, M., Brooks, C. Casanova, H., Chien, A.: Characterizing and evaluating desktop grids: an empirical study. In: Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS’04) (2004)Google Scholar
  14. 14.
    Kondo, D., Andrzejak, A., Anderson, D.P.: On correlated availability in internet-distributed systems. In: Proceedings of the 9th IEEE/ACM International Conference on Grid Computing (Grid 2008), Tsukuba, Japan, 29 Sept – 1 Oct 2008Google Scholar
  15. 15.
    BOINC: Choosing BOINC projects. http://boinc.berkeley.edu/projects.php. Accessed 26 October 2006
  16. 16.
    Preferences. http://boinc.berkeley.edu/prefs.php. Accessed 24 February 2005
  17. 17.
    Work distribution. http://boinc.berkeley.edu/work_distribution.php. Accessed 23 February 2005
  18. 18.
    Grid.org: GRID.ORG - help: frequently asked questions. http://www.grid.org/help/faq_wus.htm. Accessed 1 April 2005
  19. 19.
    Young, J.: A first order approximation to the optimum checkpoint interval. Commun. ACM 17, 530–531 (1974)zbMATHCrossRefGoogle Scholar
  20. 20.
    SETI@home beta - some questions. http://setiathome.berkeley.edu/forum_thread.php?id=37561. Accessed 8 February 2007
  21. 21.
    Result deadline - unofficial BOINC Wiki. http://boinc-boinc-wiki.ath.cx/index.php?title=Deadline. Accessed 9 February 2007
  22. 22.
    Posts by Keck_Komputers. http://einstein.phys.uwm.edu/forum_user_posts.php?userid=2914. Accessed 9 February 2007
  23. 23.
    Folding@Home News. http://folding.stanford.edu/news.html. Accessed 9 February 2007
  24. 24.
    Folding@Home configuration FAQ. http://folding.stanford.edu/FAQ-settings.html. Accessed 9 February 2007
  25. 25.
    Frequently asked questions (FAQ). http://folding.stanford.edu/faq.html. Accessed 9 February 2007
  26. 26.
    WorkUnits - FaHWiki. http://fahwiki.net/index.php/WorkUnits. Accessed 8 February 2007
  27. 27.
    Workunit size vs. processor. http://einstein.phys.uwm.edu/forum_thread.php?id=4583. Accessed 8 February 2007
  28. 28.
    Einstein@Home FAQ. http://einstein.phys.uwm.edu/faq.php. Accessed 8 February 2007
  29. 29.
    QMC@Home - wikipedia, the free encyclopedia. http://en.wikipedia.org/wiki/QMC%40Home. Accessed 8 February 2007
  30. 30.
    Report deadline too short. http://lhcathome.cern.ch/forum_thread.php?id=1977. Accessed 8 February 2007
  31. 31.
    Get wu’s with deadline less than 5 days, why?? http : // lhcathome.cern.ch/ forum_thread.php? id=1619. Accessed 9 February 2007
  32. 32.
    grid.org forums - view topic - READ ME -=- work units (WU). http://forum.grid.org/phpBB/viewtopic.viewtopic.php?t=8847&highlight=workunit+size. Accessed 8 February 2007
  33. 33.
    Rosetta@Home FAQ (work in progress). http://boinc.bakerlab.org/rosetta/forum_thread.php?id=669. Accessed 23 October 2006
  34. 34.
    ClimatePrediction.Net gateway. http://climateapps2.oucs.ox.ac.uk/cpdnboinc/quick_faq.php. Accessed 8 February 2007
  35. 35.
    BOINCSIMAP :: view topic - Wus. http://boinc.bio.wzw.tum.de/boincsimap/forum/viewtopic.php?t=5. Accessed 8 February 2007
  36. 36.
    The Riesel Sieve project :: view topic - length of WU. http://www.rieselsieve.com/forum/viewtopic.php?t=819. Accessed 9 February 2007
  37. 37.
    PerlBOINC :: RieselSieve. http://boinc.rieselsieve.com/?faq. Accessed 8 February 2007
  38. 38.
    The Riesel Sieve project :: view topic - checkpointing? http://www.rieselsieve.com/forum/viewtopic.php?t=1084. Accessed 9 February 2007
  39. 39.
    World community Grid - view thread - run times for work units - what to expect. http://worldcommunitygrid.org/forums/wcg/viewthread?thread=928. Accessed 8 February 2007

Copyright information

© Springer Science+Business Media B.V. 2009

Authors and Affiliations

  1. 1.Department of Computer ScienceMerrimack CollegeNorth AndoverUSA
  2. 2.Department of Computer ScienceWorcester Polytechnic InstituteWorcesterUSA

Personalised recommendations