{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,16]],"date-time":"2025-07-16T11:52:00Z","timestamp":1752666720925},"reference-count":26,"publisher":"Engineering and Technology Publishing","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["jcm"],"published-print":{"date-parts":[[2019]]},"DOI":"10.12720\/jcm.14.10.971-979","type":"journal-article","created":{"date-parts":[[2019,12,31]],"date-time":"2019-12-31T03:31:16Z","timestamp":1577763076000},"page":"971-979","source":"Crossref","is-referenced-by-count":3,"title":["The Optimization Potential of Volunteer Computing for Compute or Data Intensive Applications"],"prefix":"10.12720","author":[{"name":"School of Engineering & Technology, Central Queensland University, Australia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"William W.","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"4977","published-online":{"date-parts":[[2019]]},"reference":[{"key":"ref0","unstructured":"[1] Oracle 2016. An Enterprise Architect's Guide to Big Data - Reference Architecture Overview, Oracle Enterprise Architecture White Paper. [Online]. Available: http:\/\/www.oracle.com\/technetwork\/topics\/entarch\/articles\/oea-big-data-guide-1522052.pdf"},{"key":"ref1","unstructured":"[2] L. Sarmenta, \"Volunteer computing,\" PhD thesis, Massachusetts Institute of Technology, 2001."},{"key":"ref2","doi-asserted-by":"publisher","unstructured":"[3] E. J. Korpela, SETI@home, BOINC, and Volunteer Distributed Computing, Annual Review of Earth and Planetary Sciences, vol. 40, pp. 69-87, 2012.","DOI":"10.1146\/annurev-earth-040809-152348"},{"key":"ref3","unstructured":"[4] ATLAS@home. (2018). [Online]. Available: http:\/\/lhcathome.web.cern.ch\/projects\/atlas"},{"key":"ref4","unstructured":"[5] DrugDiscovery@Home (2018). [Online]. Available: http:\/\/www.drugdiscoveryathome.com"},{"key":"ref5","unstructured":"[6] D. P. Anderson, E. Korpela, and R. Walton, \"High-Performance task distribution for volunteer computing,\" in Proc. 1st IEEE International Conference on e-Science and Grid Technologies, 2005, pp. 196-203."},{"key":"ref6","doi-asserted-by":"publisher","unstructured":"[7] W. Li and W. Guo, \"The competence of volunteer computing for MapReduce big data applications,\" Communications in Computer and Information Science, Springer, vol. 901, pp. 8-23, 2018.","DOI":"10.1007\/978-981-13-2203-7_2"},{"key":"ref7","doi-asserted-by":"publisher","unstructured":"[8] W. Li and W. Guo, \"The scalability of volunteer computing for MapReduce big data applications,\" Communications in Computer and Information Science, Springer, vol. 727, pp. 153-165, 2017.","DOI":"10.1007\/978-981-10-6385-5_14"},{"key":"ref8","doi-asserted-by":"publisher","unstructured":"[9] W. Li and W. Guo, \"Work stealing based volunteer computing coordination in P2P environments,\" Journal of Communications, vol. 12, no. 10, pp. 557-564, 2017.","DOI":"10.12720\/jcm.12.10.557-564"},{"key":"ref9","doi-asserted-by":"publisher","unstructured":"[10] R. D. Blumofe and C. E. Leiserson, \"Scheduling multithreaded computations by work stealing,\" Journal of the ACM, vol. 46, no. 5, pp. 720-748, 1999.","DOI":"10.1145\/324133.324234"},{"key":"ref10","doi-asserted-by":"publisher","unstructured":"[11] J. Dinan, D. B. Larkins, P. Sadayappan, S. Krishnamoorthy, and J. Nieplocha, \"Scalable work stealing,\" in Proc. International Conference on High Performance Computing Networking, Storage and Analysis, 2009, pp. 53-63.","DOI":"10.1145\/1654059.1654113"},{"key":"ref11","doi-asserted-by":"publisher","unstructured":"[12] J. Lifflander, S. Krishnamoorthy, and L. V. Kale, \"Steal Tree: Low-overhead tracing of work stealing schedulers,\" ACM SIGPLAN Notices, vol. 48, no. 6, pp. 507-518, 2013.","DOI":"10.1145\/2499370.2462193"},{"key":"ref12","doi-asserted-by":"publisher","unstructured":"[13] S. Perarnau and M. Sato, \"Victim selection and distributed work stealing performance: A case study,\" in Proc. 28th IEEE International Symposium on Parallel and Distributed Processing, 2014, pp. 659-668.","DOI":"10.1109\/IPDPS.2014.74"},{"key":"ref13","doi-asserted-by":"publisher","unstructured":"[14] N. R. Tallent and J. M. Mellor-Crummey, \"Identifying performance bottlenecks in work-stealing computations,\" Computer, vol. 42, no. 12, pp. 44-50, 2009.","DOI":"10.1109\/MC.2009.396"},{"key":"ref14","doi-asserted-by":"publisher","unstructured":"[15] V. Kumar, D. Frampton, S. M. Blackburn, D. Grove, and O. Tardieu, \"Work-stealing without the baggage,\" ACM SIGPLAN Notices, vol. 47, no. 10, pp. 297-314, 2012.","DOI":"10.1145\/2398857.2384639"},{"key":"ref15","unstructured":"[16] T. T. Vu and B. Derbel, \"Link-heterogeneous work stealing,\" in Proc. 4th IEEE\/ACM International Symposium on Cluster, Cloud and Grid Computing, 2014, pp. 354-363."},{"key":"ref16","doi-asserted-by":"publisher","unstructured":"[17] Z. Fadika, M. Govindaraju, R. Canon, and L. Ramakrishnan, \"Evaluating hadoop for data-intensive scientific operations,\" in Proc. IEEE 5th International Conference on Cloud Computing, 2012. pp. 67-74.","DOI":"10.1109\/CLOUD.2012.118"},{"key":"ref17","doi-asserted-by":"publisher","unstructured":"[18] E. Dede, Z. Fadika, M. Govindaraju, and L. Ramakrishnan, \"Benchmarking MapReduce implementations under different application scenarios,\" Future Generation Computer Systems, vol. 36, pp. 389-399, 2014.","DOI":"10.1016\/j.future.2014.01.001"},{"key":"ref18","doi-asserted-by":"publisher","unstructured":"[19] J. Dean and S. Ghemawat, \"MapReduce: Simplified data processing on large clusters,\" Communications of the ACM, vol. 51, no. 1, pp. 107-113, 2008.","DOI":"10.1145\/1327452.1327492"},{"key":"ref19","doi-asserted-by":"publisher","unstructured":"[20] Y. L. Su, P. C. Chen, J. B. Chang, and C. K. Shieh, \"Variable-sized map and locality-aware reduce on public-resource grids,\" Future Generation Computer Systems, vol. 27, no. 6, pp. 843-849, 2011.","DOI":"10.1016\/j.future.2010.09.001"},{"key":"ref20","doi-asserted-by":"publisher","unstructured":"[21] X. Zhang, Y. Wu, and C. Zhao, \"MrHeter: Improving MapReduce performance in heterogeneous environments,\" Cluster Computing, vol. 19, no. 4, pp. 1691-1701, 2016.","DOI":"10.1007\/s10586-016-0625-2"},{"key":"ref21","doi-asserted-by":"publisher","unstructured":"[22] A. Jothi and P. Indumathy, \"Increasing performance of parallel and distributed systems in high performance computing using weight based approach,\" in Proc. International Conference on Circuits, Power and Computing Technologies, 2015.","DOI":"10.1109\/ICCPCT.2015.7159347"},{"key":"ref22","doi-asserted-by":"publisher","unstructured":"[23] O. Yildiz, S. Ibrahim, and G. Antoniu, \"Enabling fast failure recovery in shared hadoop clusters: Towards failure-aware scheduling,\" Future Generation Computer Systems, vol. 74, pp. 208-219, 2017.","DOI":"10.1016\/j.future.2016.02.015"},{"key":"ref23","doi-asserted-by":"publisher","unstructured":"[24] I. Stoica, R. Morris, D. Liben-Nowell, D. R. Karger, M. F. Kaashoek, F. Dabek, and H. Balakrishnan, \"Chord: A scalable peer-to-peer lookup protocol for internet applications,\" IEEE\/ACM Transactions on Networking, vol. 11, no. 1, pp. 17-32, 2003.","DOI":"10.1109\/TNET.2002.808407"},{"key":"ref24","unstructured":"[25] R. Casado. (2013). The Three Generations of Big Data Processing. [Online]. Available: https:\/\/www.slideshare.net\/Datadopter\/the-three-generations-of-big-data-processing"},{"key":"ref25","unstructured":"[26] S. Kaffille and K. Loesing. (2007). Open Chord (1.0.4) User's Manual, The University of Bamberg, Germany. [Online]. Available: https:\/\/sourceforge.net\/projects\/open-chord\/."}],"container-title":["Journal of Communications"],"original-title":[],"link":[{"URL":"http:\/\/www.jocm.us\/uploadfile\/2019\/0909\/20190909054637239.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,4]],"date-time":"2021-01-04T02:59:03Z","timestamp":1609729143000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.jocm.us\/index.php?m=content&c=index&a=show&catid=231&id=1446"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":26,"URL":"https:\/\/doi.org\/10.12720\/jcm.14.10.971-979","relation":{},"ISSN":["2374-4367"],"issn-type":[{"type":"print","value":"2374-4367"}],"subject":[],"published":{"date-parts":[[2019]]}}}