Parallel Computations in the Volunteer–Based Comcute System

  • Paweł CzarnulEmail author
  • Jarosław Kuchta
  • Mariusz Matuszek
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8384)


The paper presents Comcute which is a novel multi-level implementation of the volunteer based computing paradigm. Comcute was designed to let users donate the computing power of their PCs in a simplified manner, requiring only pointing their web browser at a specific web address and clicking a mouse. The server side appoints several servers to be in charge of execution of particular tasks. Thanks to that the system can survive failures of individual computers and allow definition of redundancy of desired order. On the client side, computations are executed within web browsers using technologies such as Java, JavaScript, Adobe Flash etc. without the need for installation of additional software. This paper presents results of scalability experiments carried on the Comcute system.


Volunteer computing Parallel computations Scalability Reliability 



The work was performed within grant “Modeling efficiency, reliability and power consumption of multilevel parallel HPC systems using CPUs and GPUs” sponsored by and covered by funds from the National Science Center in Poland based on decision no DEC-2012/07/B/ST6/01516.

We would like to thank W. Korlub for his help in the environment configuration.


  1. 1.
    Czarnul, P., Grzeda, K.: Parallel simulations of electrophysiological phenomena in myocardium on large 32 and 64-bit linux clusters. In: Kranzlmüller, D., Kacsuk, P., Dongarra, J. (eds.) EuroPVM/MPI 2004. LNCS, vol. 3241, pp. 234–241. Springer, Heidelberg (2004)Google Scholar
  2. 2.
    Anderson, D.P.: Boinc: a system for public-resource computing and storage. In: Proceedings of 5th IEEE/ACM International Workshop on Grid Computing, Pittsburgh, USA (2004)Google Scholar
  3. 3.
    Balicki, J., Krawczyk, H., Nawarecki, E. (eds.): Grid and Volunteer Computing. Gdansk University of Technology, Faculty of Electronics, Telecommunication and Informatics Press, Gdansk (2012). ISBN: 978-83-60779-17-0Google Scholar
  4. 4.
    Kirk, D.B., Hwu, W.W.: Programming Massively Parallel Processors. A Hands-on Approach, 2nd edn. Morgan Kaufmann, San Francisco (2012). ISBN-13: 978–0124159921.Google Scholar
  5. 5.
    Sanders, J., Kandrot, E.: CUDA by Example: An Introduction to General-Purpose GPU Programming. Addison-Wesley Professional, Reading (2010). ISBN-13: 978–0131387683Google Scholar
  6. 6.
    Buyya, R. (ed.): High Performance Cluster Computing, Programming and Applications. Prentice Hall, Upper Saddle River (1999)Google Scholar
  7. 7.
    Wilkinson, B., Allen, M.: Parallel Programming: Techniques and Applications Using Networked Workstations and Parallel Computers. Prentice Hall, Upper Saddle River (1999)Google Scholar
  8. 8.
    Geist, A., Beguelin, A., Dongarra, J., Jiang, W., Mancheck, R., Sunderam, V.: PVM Parallel Virtual Machine. A Users Guide and Tutorial for Networked Parallel Computing. MIT Press, Cambridge (1994)zbMATHGoogle Scholar
  9. 9.
    Karonis, N.T., Toonen, B., Foster, I.: Mpich-g2: a grid-enabled implementation of the message passing interface. J. Parallel Distrib. Comput. 63, 551–563 (2003). (Special Issue on Computational Grids)CrossRefzbMATHGoogle Scholar
  10. 10.
    Keller, R., Müller, M.: The Grid-Computing library PACX-MPI: Extending MPI for Computational Grids.
  11. 11.
    Garg, S.K., Buyya, R., Siegel, H.J.: Time and cost trade-off management for scheduling parallel applications on utility grids. Future Gener. Comput. Syst. 26, 1344–1355 (2010)CrossRefGoogle Scholar
  12. 12.
    Chin, S.H., Suh, T., Yu, H.C.: Adaptive service scheduling for workflow applications in service-oriented grid. J. Supercomput. 52, 253–283 (2010)CrossRefGoogle Scholar
  13. 13.
    Yu, J., Buyya, R., Ramamohanarao, K.: Workflow scheduling algorithms for grid computing. In: Xhafa, F., Abraham, A. (eds.) Meta. for Sched. in Distri. Comp. Envi. SCI, vol. 146, pp. 173–214. Springer, Heidelberg (2008)Google Scholar
  14. 14.
    Czarnul, P.: Integration of compute-intensive tasks into scientific workflows in BeesyCluster, In: Alexandrov, V.N., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds.) ICCS 2006. LNCS, vol. 3993, pp. 944–947. Springer, Heidelberg (2006) CrossRefGoogle Scholar
  15. 15.
    Cushing, R., Putra, G., Koulouzis, S., Belloum, A., Bubak, M., de Laat, C.: Distributed computing on an ensemble of browsers. IEEE Internet Comput. 17, 54–61 (2013)CrossRefGoogle Scholar
  16. 16.
    Malawski, M., Kuzniar, M., Wojcik, P., Bubak, M.: How to use google app engine for free computing. IEEE Internet Comput. 17, 50–59 (2013)CrossRefGoogle Scholar
  17. 17.
    Nielsen, J.: How long do users stay on web pages? Nielsen Norman Group (2011).
  18. 18.
    Czarnul, P.: Modeling, run-time optimization and execution of distributed workflow applications in the jee-based beesycluster environment. J. Supercomput. 63, 46–71 (2013)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  • Paweł Czarnul
    • 1
    Email author
  • Jarosław Kuchta
    • 1
  • Mariusz Matuszek
    • 1
  1. 1.Faculty of Electronics, Telecommunications and InformaticsGdansk University of TechnologyGdańskPoland

Personalised recommendations