Skip to main content

Volunteer Computing on Clusters

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4376))

Abstract

Clusters typically represent a homogeneous, well maintained pool of high-end computation resources. This makes them particularly attractive for volunteer computing, where unused compute cycles are utilized for scientific guest applications. Cluster nodes are not idle as often as public PCs, but they are frequently underutilized while actively executing parallel applications. Hence, fully exploiting clusters for volunteer computing requires the ability to efficiently and invisibly steal the unused cycles at a fine grain from the currently running host applications, without slowing them down. In this paper we present measurements on a production compute cluster that show long periods of CPU and memory underutilization patterns that could be used to execute guest applications. In our experiments with NAS benchmarks on a small Linux cluster, cycle stealing led to a 3.6% average slowdown of host applications in the best case. This was accompanied by an overall improvement in the system throughput of 38%, when progress of the guest applications was included. We introduce simple guidelines on using clusters for volunteer computing. We also argue for the support of “zero priority” processes in OS schedulers which could virtually eliminate the impact of volunteer computing on host applications.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Anderson, D., et al.: SETI@home: An experiment in public-resource computing. Communications of the ACM 45 (2002)

    Google Scholar 

  2. BOINC. http://boinc.berkeley.edu/

  3. Anderson, D.: BOINC: A system for public-resource computing and storage. In: Fifth IEEE/ACM International Workshop on Grid Computing, pp. 4–10. ACM Press, New York (2004)

    Chapter  Google Scholar 

  4. Litzkow, M., Livny, M., Mutka, M.: Condor - a hunter of idle workstations. In: 8th International Conference on Distributed Computing Systems, pp. 104–111 (1988)

    Google Scholar 

  5. Chien, A., et al.: Entropia: architecture and performance of an enterprise desktop grid system. Journal of Parallel and Distributed Computing 63, 597–610 (2003)

    Article  Google Scholar 

  6. OpenMosix, http://openmosix.sourceforge.net/

  7. Grid MP, http://ud.com/solutions/deploy/mp_enterprise.htm

  8. Anderson, D., Fedak, G.: The computation and storage potential of volunteer computing. In: Sixth IEEE International Symposium on Cluster Computing and the Grid, IEEE Computer Society Press, Los Alamitos (2006)

    Google Scholar 

  9. Kondo, D., et al.: Characterizing and evaluating desktop grids: An empirical study. In: International Parallel and Distributed Processing Symposium (IPDPS’04) (2004)

    Google Scholar 

  10. Li, H., Groep, D., Wolters, L.: Workload characteristics of a multi-cluster supercomputer. In: Feitelson, D.G., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2004. LNCS, vol. 3277, pp. 176–193. Springer, Heidelberg (2005)

    Google Scholar 

  11. Zhang, Y., et al.: Improving parallel job scheduling by combining gang scheduling and backfilling techniques. In: 14th International Parallel and Distributed Processing Symposium (2000)

    Google Scholar 

  12. Feitelson, D.G., Weil, A.M.: Utilization and predictability in scheduling the IBM SP2 with backfilling. In: 12th International Parallel Processing Symposium, pp. 542–546 (1998)

    Google Scholar 

  13. Kleban, S.D., Clearwater, S.H.: Interstitial computing: Utilizing spare cycles on supercomputers. In: IEEE International Conference on Cluster Computing, IEEE Computer Society Press, Los Alamitos (2003)

    Google Scholar 

  14. Ryu, K., Hollingsworth, J.: Linger longer: fine-grain cycle stealing for networks of workstations. In: ACM/IEEE Conference on Supercomputing, pp. 1–12. IEEE Computer Society Press, Los Alamitos (1998)

    Google Scholar 

  15. Ryu, K., Hollingsworth, J.: Resource policing to support fine-grain cycle stealing in networks of workstations. IEEE Transactions on Parallel and Distributed Systems 15, 878–892 (2004)

    Article  Google Scholar 

  16. Stiehr, G.: Using fine-grained cycle stealing to improve throughput, efficiency and response time on a dedicated cluster while maintaining quality of service. Master’s thesis, Washington University (2004)

    Google Scholar 

  17. Weinberg, J., Snavely, A.: Symbiotic space-sharing on SDSC’s DataStar system. In: Frachtenberg, E., Schwiegelshohn, U. (eds.) JSSPP 2006. LNCS, vol. 4376, Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  18. Ghanesh, M., Kumar, S., Subhlok, J.: Empirical evaluation of shared parallel execution on independently scheduled clusters. In: 1st International Workshop on Grid Performability (2005)

    Google Scholar 

  19. Acharya, A., Edjlali, G., Saltz, J.: The Utility of Exploiting Idle Workstations for Parallel Computation. In: ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, ACM Press, New York (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Eitan Frachtenberg Uwe Schwiegelshohn

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Vyas, D., Subhlok, J. (2007). Volunteer Computing on Clusters. In: Frachtenberg, E., Schwiegelshohn, U. (eds) Job Scheduling Strategies for Parallel Processing. JSSPP 2006. Lecture Notes in Computer Science, vol 4376. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71035-6_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-71035-6_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-71034-9

  • Online ISBN: 978-3-540-71035-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics