{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T10:17:37Z","timestamp":1775470657102,"version":"3.50.1"},"reference-count":30,"publisher":"MDPI AG","issue":"6","license":[{"start":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T00:00:00Z","timestamp":1559001600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Future Internet"],"abstract":"<jats:p>Volunteer computing (VC) is a distributed computing paradigm, which provides unlimited computing resources in the form of donated idle resources for many large-scale scientific computing applications. Task scheduling is one of the most challenging problems in VC. Although, dynamic scheduling problem with deadline constraint has been extensively studied in prior studies in the heterogeneous system, such as cloud computing and clusters, these algorithms can\u2019t be fully applied to VC. This is because volunteer nodes can get offline whenever they want without taking any responsibility, which is different from other distributed computing. For this situation, this paper proposes a dynamic task scheduling algorithm for heterogeneous VC with deadline constraint, called deadline preference dispatch scheduling (DPDS). The DPDS algorithm selects tasks with the nearest deadline each time and assigns them to volunteer nodes (VN), which solves the dynamic task scheduling problem with deadline constraint. To make full use of resources and maximize the number of completed tasks before the deadline constraint, on the basis of the DPDS algorithm, improved dispatch constraint scheduling (IDCS) is further proposed. To verify our algorithms, we conducted experiments, and the results show that the proposed algorithms can effectively solve the dynamic task assignment problem with deadline constraint in VC.<\/jats:p>","DOI":"10.3390\/fi11060121","type":"journal-article","created":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T11:18:09Z","timestamp":1559042289000},"page":"121","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["Dynamic Task Scheduling Algorithm with Deadline Constraint in Heterogeneous Volunteer Computing Platforms"],"prefix":"10.3390","volume":"11","author":[{"given":"Ling","family":"Xu","sequence":"first","affiliation":[{"name":"School of Computer Science and Engineering, Northeastern University, Shenyang 110819, China"},{"name":"School of Software Engineering, Dalian University of Foreign Languages, Dalian 116044, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianzhong","family":"Qiao","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Northeastern University, Shenyang 110819, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shukuan","family":"Lin","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Northeastern University, Shenyang 110819, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wanting","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Software Engineering, Dalian University of Foreign Languages, Dalian 116044, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2019,5,28]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1145\/1734160.1734164","article-title":"Volunteer computing: The ultimate cloud","volume":"16","author":"Anderson","year":"2010","journal-title":"ACM Crossroads"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1145\/581571.581573","article-title":"SETI@home: An experiment in public-resource computing","volume":"45","author":"Anderson","year":"2002","journal-title":"Commun. ACM"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Beberg, A.L., Ensign, D.L., Jayachandran, G., Khaliq, S., and Pande, V.S. (2009, January 23\u201329). Folding@home: Lessons from Eight Years of Volunteer Distributed Computing. Proceedings of the 23rd IEEE International Symposium on Parallel & Distributed Processing (IPDPS 2009), Rome, Italy.","DOI":"10.1109\/IPDPS.2009.5160922"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"022009","DOI":"10.1088\/1742-6596\/664\/2\/022009","article-title":"ATLAS@Home: Harnessing Volunteer Computing for HEP","volume":"664","author":"Adambourdarios","year":"2015","journal-title":"J. Phys. Conf. Ser."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Cunsolo, V.D., Distefano, S., Puliafito, A., and Scarpa, M. (2009, January 16\u201319). Cloud@Home: Bridging the Gap between Volunteer and Cloud Computing. Proceedings of the Emerging Intelligent Computing Technology and Applications: 5th International Conference on Intelligent Computing (ICIC 2009), Ulsan, South Korea.","DOI":"10.1007\/978-3-642-04070-2_48"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Li, W., and Guo, W. (2018, January 21\u201323). The Competence of Volunteer Computing for MapReduce Big Data Applications. Proceedings of the 4th International Conference of Pioneering Computer Scientists, Engineers and Educators (ICPCSEE 2018), Zhengzhou, China.","DOI":"10.1007\/978-981-13-2203-7_2"},{"key":"ref_7","unstructured":"Filep, L. (2018, January 4\u20135). Model for Improved Load Balancing in Volunteer Computing Platforms. Proceedings of the 15th European, Mediterranean, and Middle Eastern Conference on Information Systems (EMCIS 2018), Limassol, Cyprus."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1109\/TCC.2015.2474403","article-title":"MapReduce scheduling for deadline-constrained jobs in heterogeneous cloud computing systems","volume":"6","author":"Chen","year":"2018","journal-title":"IEEE Trans. Cloud Comput."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Xiao, M., Wu, J., and Huang, L. (May, January 26). Multi-task assignment for crowdsensing in mobile social networks. Proceedings of the 2015 IEEE Conference on Computer Communications (INFOCOM 2015), Hong Kong, China.","DOI":"10.1109\/INFOCOM.2015.7218609"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"1175","DOI":"10.1002\/cpe.710","article-title":"Gridsim: A toolkit for the modeling and simulation of distributed resource management and scheduling for grid computing","volume":"14","author":"Buyya","year":"2002","journal-title":"Concurr. Comput. Pract. Exp."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"1053","DOI":"10.1002\/dac.2743","article-title":"A workflow task scheduling algorithm based on the resources\u2019 fuzzy clustering in cloud computing environment","volume":"28","author":"Guo","year":"2015","journal-title":"Int. J. Commun. Syst."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Anderson, D.P. (2011, January 16\u201320). Emulating volunteer computing scheduling policies. Proceedings of the 25th IEEE International Parallel and Distributed Processing Symposium Workshops and PhD Forum, Anchorage, AK, USA.","DOI":"10.1109\/IPDPS.2011.343"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/j.jpdc.2016.06.008","article-title":"Stochastic-based robust dynamic resource allocation for independent tasks in a heterogeneous computing system","volume":"97","author":"Smith","year":"2016","journal-title":"J. Parallel Distrib. Comput."},{"key":"ref_14","unstructured":"Maheswaran, M., and Siegel, H.J. (1998, January 30). A dynamic matching and scheduling algorithm for heterogeneous computing systems. Proceedings of the 7th Heterogeneous Computing Workshop (HCW\u201998), Orlando, FL, USA."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1109\/71.993206","article-title":"Performance-effective and low-complexity task scheduling for heterogeneous computing","volume":"13","author":"Topcuoglu","year":"2002","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Blythe, J., Jain, S., Deelman, E., Gil, Y., Vahi, K., Mandal, A., and Kennedy, K. (2005, January 9\u201312). Task scheduling strategies for workflow-based applications in grids. Proceedings of the IEEE International Symposium on Cluster Computing and the Grid, Cardiff, Wales.","DOI":"10.1109\/CCGRID.2005.1558639"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Poola, D., Garg, S.K., Buyya, R., Yang, Y., and Ramamohanarao, K. (2014, January 13\u201316). Robust Scheduling of Scientific Workflows with Deadline and Budget Constraints in Clouds. Proceedings of the 28th IEEE International Conference on Advanced Information Networking & Applications, Victoria, BC, Canada.","DOI":"10.1109\/AINA.2014.105"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"899","DOI":"10.1109\/71.954620","article-title":"Observations on Using Genetic Algorithms for Dynamic Load-Balancing","volume":"12","author":"Zomaya","year":"2001","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"ref_19","unstructured":"Page, A.J., and Naughton, T.J. (2005, January 4\u20138). Dynamic Task Scheduling using Genetic Algorithms for Heterogeneous Distributed Computing. Proceedings of the 18th IEEE International Parallel and Distributed Processing Symposium, Denver, CO, USA."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"1106","DOI":"10.1016\/j.jpdc.2013.03.008","article-title":"An effective iterated greedy algorithm for reliability-oriented task allocation in distributed computing systems","volume":"73","author":"Kang","year":"2013","journal-title":"J. Parallel Distrib. Comput."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1109\/TCC.2015.2451649","article-title":"A Cost-Effective Deadline-Constrained Dynamic Scheduling Algorithm for Scientific Workflows in a Cloud Environment","volume":"6","author":"Sahni","year":"2015","journal-title":"IEEE Trans. Cloud Comput."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Cheng, D., Rao, J., Jiang, C., and Zhou, X.B. (2015, January 23\u201327). Resource and Deadline-Aware Job Scheduling in Dynamic Hadoop Clusters. Proceedings of the 30th IEEE International Parallel and Distributed Processing Symposium, Chicago, IL, USA.","DOI":"10.1109\/IPDPS.2015.36"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/j.jss.2016.05.011","article-title":"Dynamic Auto-scaling and Scheduling of Deadline Constrained Service Workloads on IaaS Clouds","volume":"108","author":"Coninck","year":"2016","journal-title":"J. Syst. Softw."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Kondo, D., Anderson, D.P., and Vii, J.M. (2007, January 10\u201313). Performance Evaluation of Scheduling Policies for Volunteer Computing. Proceedings of the 15th IEEE International Conference on E-science and Grid Computing, Bangalore, India.","DOI":"10.1109\/E-SCIENCE.2007.57"},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Anderson, D.P., and McLeod, J. (2007, January 26\u201330). Local scheduling for volunteer computing. Proceedings of the 21th IEEE International Parallel and Distributed Processing Symposium, Long Beach, CA, USA.","DOI":"10.1109\/IPDPS.2007.370667"},{"key":"ref_26","first-page":"938","article-title":"Task allocation in volunteer computing networks under monetary budget constraint","volume":"8","author":"Guler","year":"2015","journal-title":"P2P Netw. Appl."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"1583","DOI":"10.1016\/j.future.2012.08.010","article-title":"Cycloid Grid: A proximity-aware P2P-based resource discovery architecture in volunteer computing systems","volume":"29","author":"Ghafarian","year":"2013","journal-title":"Future Gener. Comput. Syst."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/j.future.2014.11.007","article-title":"Cloud-aware data intensive workflow scheduling on volunteer computing systems","volume":"51","author":"Ghafarian","year":"2015","journal-title":"Future Gener. Comput. Syst."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/j.cor.2016.11.004","article-title":"Optimal Distributed Task Scheduling in Volunteer Clouds","volume":"81","author":"Sebastio","year":"2016","journal-title":"Comput. Oper. Res."},{"key":"ref_30","first-page":"215","article-title":"Spatial Co-Location Patterns Mining over Uncertain Data Based on Possible Worlds","volume":"47","author":"Lu","year":"2010","journal-title":"J. Comput. Res. Dev."}],"container-title":["Future Internet"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-5903\/11\/6\/121\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T12:54:03Z","timestamp":1760187243000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-5903\/11\/6\/121"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,28]]},"references-count":30,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2019,6]]}},"alternative-id":["fi11060121"],"URL":"https:\/\/doi.org\/10.3390\/fi11060121","relation":{},"ISSN":["1999-5903"],"issn-type":[{"value":"1999-5903","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,5,28]]}}}