Skip to main content
SpringerLink
Log in

A new approach for global task scheduling in volunteer computing systems

  • Original Research
  • Published:
International Journal of Information Technology Aims and scope Submit manuscript

Abstract

Volunteer computing networks are made up of a large number of computing devices owned by volunteers who want to donate their computing resources to help with large-scale scientific projects. The performance of these devices varies due to the available computing power, churn effect, and device heterogeneity, making equal workload distribution a significant challenge for the central server. To ensure that each device receives work that is proportional to its computing capability, we propose a new global scheduling algorithm based on the observed performance data provided by all connected computing devices in a peer-to-peer volunteer network. The experimental simulation results show that the main task is distributed in such a way that all devices exert the same amount of effort in terms of power consumption and execution time, yielding a very low values of the relative standard deviation for each of these two metrics.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Aggregating computational resources. https://stats.distributed.net/projects.php?project_id=28. Accessed 30 05 2022

  2. Gwa-t-13 materna. http://gwa.ewi.tudelft.nl/datasets/gwa-t-13-materna. Accessed 07 2021

  3. Anderson DP, Korpela E, Walton R (2005) High-performance task distribution for volunteer computing. In: First international conference on e-science and grid computing (e-Science’05). pp 8–203. https://doi.org/10.1109/E-SCIENCE.2005.51

  4. Anderson DP (2011) Emulating volunteer computing scheduling policies. In: 2011 IEEE international symposium on parallel and distributed processing workshops and Phd forum. pp 1839–1846. https://doi.org/10.1109/IPDPS.2011.343

  5. Anderson DP (2019) Boinc: a platform for volunteer computing. J Grid Comput 18:99–122

    Article  Google Scholar 

  6. Anderson DP, McLeod J (2007) Local scheduling for volunteer computing. In: 2007 IEEE international parallel and distributed processing symposium. pp 1–8. https://doi.org/10.1109/IPDPS.2007.370667

  7. Baldeschwieler JE, Blumofe RD, Brewer EA (1996) ATLAS: An infrastructure for global computing. In: Proceedings of the 7th workshop on ACM SIGOPS European workshop: systems support for worldwide applications, EW 7. Association for Computing Machinery, New York, pp 165–172. https://doi.org/10.1145/504450.504482

  8. Baratloo A, Karaul M, Kedem ZM, Wijckoff P (1999) Charlotte: metacomputing on the web. Future Gener Comput Syst 15:559–570

    Article  Google Scholar 

  9. Blumofe RD, Leiserson CE (1999) Scheduling multithreaded computations by work stealing. J ACM 46(5):720–748. https://doi.org/10.1145/324133.324234

    Article  MathSciNet  MATH  Google Scholar 

  10. Blumofe RD, Lisiecki PA (1997) Adaptive and reliable parallel computing on networks of workstations. In: Proceedings of the USENIX annual technical symposion. pp 133–147

  11. Casanova H, Giersch A, Legrand A, Quinson M, Suter F (2014) Versatile, scalable, and accurate simulation of distributed applications and platforms. J Parallel Distrib Comput 74(10):2899–2917 http://hal.inria.fr/hal-01017319

  12. Chen Hl, King CT (1996) Eager scheduling with lazy retry for dynamic task scheduling. https://doi.org/10.1007/BFb0024755

  13. Estrada T, Flores DA, Taufer M, Teller PJ, Kerstens A, Anderson DP (2006) The effectiveness of threshold-based scheduling policies in boinc projects. In: 2006 second IEEE international conference on e-science and grid computing (e-Science’06). pp 88–88. https://doi.org/10.1109/E-SCIENCE.2006.261172

  14. Estrada T, Fuentes O, Taufer M (2008) A distributed evolutionary method to design scheduling policies for volunteer computing. SIGMETRICS Perform Eval Rev 36(3):40–49. https://doi.org/10.1145/1481506.1481515

    Article  Google Scholar 

  15. Estrada T, Taufer M, Anderson D (2009) Performance prediction and analysis of boinc projects: an empirical study with emboinc. J Grid Comput 7:537–554. https://doi.org/10.1007/s10723-009-9126-3

    Article  Google Scholar 

  16. Fedak G, Germain C, Neri V, Cappello F (2001) Xtremweb: a generic global computing system. In: Proceedings first IEEE/ACM international symposium on cluster computing and the grid. pp 582–587. https://doi.org/10.1109/CCGRID.2001.923246

  17. Heinrich FC, Cornebize T, Degomme A, Legrand A, Carpen-Amarie A, Hunold S, Orgerie A-C, Quinson M (2017) Predicting the energy-consumption of mpi applications at scale using only a single node. In: 2017 IEEE international conference on cluster computing (CLUSTER). pp 92–102. https://doi.org/10.1109/CLUSTER.2017.66

  18. Kondo D, Anderson DP, Vii JM (2007) Performance evaluation of scheduling policies for volunteer computing. In: Third IEEE international conference on e-science and grid computing (e-Science 2007). pp 415–422. https://doi.org/10.1109/E-SCIENCE.2007.57

  19. Kopal N (2018) Secure volunteer computing for distributed cryptanalysis. Ph.D. thesis. https://doi.org/10.19211/KUP9783737604277

  20. Neary MO, Cappello P (2005) Advanced eager scheduling for java-based adaptive parallel computing: research articles. Concurr Comput Pract Exp 17(7–8):797–819

    Article  Google Scholar 

  21. Ngo SH, Fukushi M, Jiang X, Horiguchi S (2008) Efficient scheduling schemes for sabotage-tolerance in volunteer computing systems. In: Proceedings of the 22nd international conference on advanced information networking and applications, AINA ’08. IEEE Computer Society, USA, pp 652–658. https://doi.org/10.1109/AINA.2008.129

  22. Nouman Durrani M, Shamsi JA (2014) Volunteer computing: requirements, challenges, and solutions. J Netw Comput Appl 39:369–380. https://doi.org/10.1016/j.jnca.2013.07.006

    Article  Google Scholar 

  23. Orgerie AC, de Assunção MD, Lefèvre L (2013) A survey on techniques for improving the energy efficiency of large-scale distributed systems. ACM Comput Surv (CSUR) 46:1–31

    Article  Google Scholar 

  24. Saleh E, Rajesh SL (2021) High-performance cryptanalysis: a comparative study of code-breaking techniques. In: Proceedings of the international conference on innovative computing and communication (ICICC). https://doi.org/10.2139/ssrn.3833299

  25. Sarmenta LF, Hirano S (1999) Bayanihan: building and studying web-based volunteer computing systems using java. Future Gener Comput Syst 15(5):675–686. https://doi.org/10.1016/S0167-739X(99)00018-7

    Article  Google Scholar 

  26. Toth D, Finkel D (2009) Improving the productivity of volunteer computing by using the most effective task retrieval policies. J Grid Comput 7:519–535. https://doi.org/10.1007/s10723-009-9133-4

    Article  Google Scholar 

  27. Yadav S, Mohan R, Yadav P (2018) Fuzzy based task allocation technique in distributed computing system. Int J Inf Technol. https://doi.org/10.1007/s41870-018-0172-6

    Article  Google Scholar 

  28. Zamudio R, Brooks CL, Armen R, Kerstens A, Teller PJ, Taufer M, Flores DA, Estrada TP (2007) Moving volunteer computing towards knowledge-constructed, dynamically-adaptive modeling and scheduling. In: 2007 IEEE international parallel and distributed processing symposium. IEEE Computer Society, Los Alamitos, pp 478. https://doi.org/10.1109/IPDPS.2007.370668

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Jain University, Bengaluru, India

    Ehab Saleh & Chandrasekar Shastry

Authors
  1. Ehab Saleh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chandrasekar Shastry
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ehab Saleh.

Rights and permissions

Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Saleh, E., Shastry, C. A new approach for global task scheduling in volunteer computing systems. Int. j. inf. tecnol. 15, 239–247 (2023). https://doi.org/10.1007/s41870-022-01090-w

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s41870-022-01090-w

Keywords

Search

Navigation