Advertisement

Model for Improved Load Balancing in Volunteer Computing Platforms

  • Levente FilepEmail author
Conference paper
Part of the Lecture Notes in Business Information Processing book series (LNBIP, volume 341)

Abstract

Distributed computational platforms, especially volunteer based ones, become popular over the past decades due to the cheap access to resources. The majority of these Volunteer Computing (VC) platforms are based on client-server architecture, therefore susceptible to server-side bottlenecks and delays in project completion due to lost Workload Units (WU). This paper presents a new model for a computing platform that offloads the tasks of WU creation from centralized servers to the network nodes and with the use of a remote checkpoint system, it can re-create lost WUs from failed or unavailable nodes. With these improvements, it can achieve better scaling and load balancing, and due to the checkpoints, only a limited amount of computation is lost due to node failure. Simulation results of the model’s behavior are also present and interpreted.

Keywords

Volunteer computing Load balancing Scalability Workload unit recovery 

Notes

Acknowledgements

This work was supported by the Collegium Talentum 2017 Programme of Hungary.

References

  1. 1.
    Alonso-Monsalve, S., Garcia-Carballeira, F., Calderón, A.: A new volunteer computing model for data-intensive applications. Concurrency Comput.: Pract. Exp. 29(24) (2017).  https://doi.org/10.1002/cpe.4198CrossRefGoogle Scholar
  2. 2.
    Anderson, D.P.: Boinc: a system for public-resource computing and storage. In: Proceedings of the 5th IEEE/ACM International Workshop, Pittsburgh, USA, pp. 4–10. IEEE Computer Society (2004)Google Scholar
  3. 3.
    Beverly Yang, B., Garcia-Molina, H.: Designing a super-peer network. In: Proceedings 19th International Conference on Data Engineering, Bangalore, India, pp. 49–60. IEEE (2003).  https://doi.org/10.1109/ICDE.2003.1260781
  4. 4.
    Bruno, R., Ferreira, P.: Freecycles: efficient data distribution for volunteer computing. In: Proceedings of the Fourth International Workshop on Cloud Data and Platforms, Amsterdam, Netherlands, pp. 1–6. ACM (2014)Google Scholar
  5. 5.
    Costa, F., Silva, L., Kelley, I., Taylor, I.: Peer-to-peer techniques for data distribution in desktop grid computing platforms. In: Danelutto, M., Fragopoulou, P., Getov, V. (eds.) Making Grids Work, pp. 377–391. Springer, Boston (2008).  https://doi.org/10.1007/978-0-387-78448-9_30CrossRefGoogle Scholar
  6. 6.
    Czarnul, P., Kuchta, J., Matuszek, M.: Parallel computations in the volunteer–based comcute system. In: Wyrzykowski, R., Dongarra, J., Karczewski, K., Waśniewski, J. (eds.) PPAM 2013. LNCS, vol. 8384, pp. 261–271. Springer, Heidelberg (2014).  https://doi.org/10.1007/978-3-642-55224-3_25CrossRefGoogle Scholar
  7. 7.
    Demers, A., et al.: Epidemic algorithms for replicated database maintenance. In: Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, pp. 1–12. ACM, New York (1987)  https://doi.org/10.1145/41840.41841
  8. 8.
    Elwaer, A., Taylor, I., Rana, O.: Optimizing data distribution in volunteer computing systems using resources of participants. Scalable Comput.: Pract. Exp. 12, 193–208 (2011)Google Scholar
  9. 9.
    Kapoor, H., Mehta, K., Puri, D., Saxena, S.: Survey of various search mechanisms in unstructured peer-to-peer networks. Int. J. Comput. Appl. 68(6), 21–25 (2013).  https://doi.org/10.5120/11584-6917CrossRefGoogle Scholar
  10. 10.
    Muratat, Y., Inabatt, T., Takizawat, H., Kobayashi, H.: Implementation and evaluation of a distributed and cooperative load-balancing mechanism for dependable volunteer computing. In: International Conference on Dependable Systems & Networks: Anchorage, Alaska, USA, pp. 316–325. IEEE (2008)Google Scholar
  11. 11.
    Priyanka, C., Deeba, K.: A comparative study on optimization of search in overlay networks. Int. J. Comput. Sci. Mob. Appl. 1(4), 34–38 (2013)Google Scholar
  12. 12.
    Ripeanu, M.: Peer-to-peer architecture case study: Gnutella network. In: Proceedings First International Conference on Peer-to-Peer Computing, Linkoping, Sweden, pp. 99–100. IEEE (2001)Google Scholar
  13. 13.
    Sarmenta, L.F.: Volunteer computing. Ph.D. thesis, Massachusetts Institute of Technology (2001)Google Scholar
  14. 14.
    Ye, F., Zuo, F., Zhang, S.: Routing Algorithm Based on Gnutella Model. In: Cai, Z., Li, Z., Kang, Z., Liu, Y. (eds.) ISICA 2009. CCIS, vol. 51, pp. 9–15. Springer, Heidelberg (2009).  https://doi.org/10.1007/978-3-642-04962-0_2CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Faculty of Mathematics and Computer ScienceBabeș-Bolyai UniversityCluj-NapocaRomania

Personalised recommendations