{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T17:59:08Z","timestamp":1758477548083},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,10,23]],"date-time":"2017-10-23T00:00:00Z","timestamp":1508716800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Grid Computing"],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1007\/s10723-017-9411-5","type":"journal-article","created":{"date-parts":[[2017,10,23]],"date-time":"2017-10-23T21:59:22Z","timestamp":1508795962000},"page":"647-662","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Parallel Tree Search in Volunteer Computing: a Case Study"],"prefix":"10.1007","volume":"16","author":[{"given":"Wenjie","family":"Fang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Uwe","family":"Beckert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,10,23]]},"reference":[{"issue":"4","key":"9411_CR1","doi-asserted-by":"crossref","first-page":"042003","DOI":"10.1103\/PhysRevD.80.042003","volume":"80","author":"B Abbott","year":"2009","unstructured":"Abbott, B., Abbott, R., Adhikari, R., Ajith, P., Allen, B., Allen, G., Amin, R.S., Anderson, S.B., Anderson, W.G., Arain, M.A., et al.: Einstein@Home search for periodic gravitational waves in early S5 LIGO data. Phys. Rev. D 80(4), 042003 (2009)","journal-title":"Phys. Rev. D"},{"key":"9411_CR2","doi-asserted-by":"crossref","unstructured":"Aichholzer, O., Krasser, H.: Abstract order type extension and new results on the rectilinear crossing number. In: Proceedings of the Twenty-First Annual Symposium on Computational Geometry, pp. 91\u201398. ACM (2005)","DOI":"10.1145\/1064092.1064108"},{"key":"9411_CR3","doi-asserted-by":"crossref","unstructured":"Anderson, D.P.: BOINC: a system for public-resource computing and storage. In: Proceedings. Fifth IEEE\/ACM International Workshop on Grid Computing, pp. 4\u201310. IEEE (2004)","DOI":"10.1109\/GRID.2004.14"},{"issue":"11","key":"9411_CR4","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1145\/581571.581573","volume":"45","author":"DP Anderson","year":"2002","unstructured":"Anderson, D.P., Cobb, J., Korpela, E., Lebofsky, M., Werthimer, D.: SETI@home: an experiment in public-resource computing. Commun. ACM 45(11), 56\u201361 (2002)","journal-title":"Commun. ACM"},{"key":"9411_CR5","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511615320","volume-title":"Principles of Constraint Programming","author":"K Apt","year":"2003","unstructured":"Apt, K.: Principles of Constraint Programming. Cambridge University Press, Cambridge (2003)"},{"issue":"3","key":"9411_CR6","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/s10723-015-9348-5","volume":"14","author":"AL Bazinet","year":"2016","unstructured":"Bazinet, A.L., Cummings, M.P.: Subdividing long-running, variable-length analyses into short, fixed-length BOINC workunits. J. Grid Comput. 14(3), 429\u2013441 (2016)","journal-title":"J. Grid Comput."},{"issue":"2","key":"9411_CR7","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1145\/301970.301974","volume":"46","author":"GE Blelloch","year":"1999","unstructured":"Blelloch, G.E., Gibbons, P.B., Matias, Y.: Provably efficient scheduling for languages with fine-grained parallelism. J. ACM 46(2), 281\u2013321 (1999)","journal-title":"J. ACM"},{"issue":"1","key":"9411_CR8","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1006\/jpdc.1996.0107","volume":"37","author":"RD Blumofe","year":"1996","unstructured":"Blumofe, R.D., Joerg, C.F., Kuszmaul, B.C., Leiserson, C.E., Randall, K.H., Zhou, Y.: Cilk: an efficient multithreaded runtime system. J. Parallel Distrib. Comput. 37(1), 55\u201369 (1996)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"5","key":"9411_CR9","doi-asserted-by":"crossref","first-page":"720","DOI":"10.1145\/324133.324234","volume":"46","author":"RD Blumofe","year":"1999","unstructured":"Blumofe, R.D., Leiserson, C.E.: Scheduling multithreaded computations by work stealing. J. ACM 46(5), 720\u2013748 (1999)","journal-title":"J. ACM"},{"key":"9411_CR10","doi-asserted-by":"crossref","unstructured":"Bouguerra, M.S., Kondo, D., Trystram, D.: On the scheduling of checkpoints in desktop grids. In: 11th IEEE\/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid), 2011, pp. 305\u2013313. IEEE (2011)","DOI":"10.1109\/CCGrid.2011.63"},{"issue":"4","key":"9411_CR11","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1137\/070710111","volume":"51","author":"A Clauset","year":"2009","unstructured":"Clauset, A., Shalizi, C.R., Newman, M.E.J.: Power-law distributions in empirical data. SIAM Rev. 51(4), 661\u2013703 (2009)","journal-title":"SIAM Rev."},{"issue":"1","key":"9411_CR12","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1109\/99.660313","volume":"5","author":"L Dagum","year":"1998","unstructured":"Dagum, L., Menon, R.: OpenMP: an industry standard API for shared-memory programming. IEEE Comput. Sci. Eng. 5(1), 46\u201355 (1998)","journal-title":"IEEE Comput. Sci. Eng."},{"key":"9411_CR13","doi-asserted-by":"crossref","unstructured":"Distler, A., Jefferson, C., Kelsey, T., Kotthoff, L.: The semigroups of order 10. In: Principles and Practice of Constraint Programming, pp. 883\u2013899. Springer, Berlin (2012)","DOI":"10.1007\/978-3-642-33558-7_63"},{"key":"9411_CR14","unstructured":"Distributed.net: Distributed.net Faq-O-Matic: why is progress of OGR-28 stubspaces 1 and 2 so slow? http:\/\/faq.distributed.net\/cache\/299.html , Cited: 21 Jan 2015"},{"key":"9411_CR15","unstructured":"Distributed.net: Distributed.net: Project OGR. http:\/\/www.distributed.net\/OGR , Cited: 21 Jan 2015"},{"issue":"3","key":"9411_CR16","doi-asserted-by":"crossref","first-page":"547","DOI":"10.3934\/amc.2011.5.547","volume":"5","author":"K Drakakis","year":"2011","unstructured":"Drakakis, K., Iorio, F., Rickard, S., Walsh, J.: Results of the enumeration of Costas arrays of order 29. Adv. Math. Commun. 5(3), 547\u2013553 (2011)","journal-title":"Adv. Math. Commun."},{"key":"9411_CR17","unstructured":"Estrada, T., Flores, D.A., Taufer, M., Teller, P.J., Kerstens, A., Anderson, D.P.: The effectiveness of threshold-based scheduling policies in BOINC projects. In: Second IEEE International Conference on e-Science and Grid Computing, 2006 (e-Science\u201906), p. 88. IEEE (2006)"},{"key":"9411_CR18","doi-asserted-by":"crossref","unstructured":"Fischetti, M., Monaci, M., Salvagnin, D.: Self-splitting of workload in parallel computation. In: International Conference on AI and OR Techniques in Constriant Programming for Combinatorial Optimization Problems, pp. 394\u2013404. Springer, Berlin (2014)","DOI":"10.1007\/978-3-319-07046-9_28"},{"key":"9411_CR19","first-page":"DS6","volume":"Dynamic Surveys","author":"JA Gallian","year":"2014","unstructured":"Gallian, J.A.: A dynamic survey of graph labeling. Electron. J. Comb. Dynamic Surveys, DS6 (2014)","journal-title":"Electron. J. Comb."},{"key":"9411_CR20","doi-asserted-by":"crossref","unstructured":"Golle, P., Mironov, I.: Uncheatable distributed computations. In: Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer\u2019s Track at RSA, pp. 425\u2013440. Springer, Berlin (2001)","DOI":"10.1007\/3-540-45353-9_31"},{"issue":"1","key":"9411_CR21","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1023\/A:1006314320276","volume":"24","author":"CP Gomes","year":"2000","unstructured":"Gomes, C.P., Selman, B., Crato, N., Kautz, H.: Heavy-tailed phenomena in satisfiability and constraint satisfaction problems. J. Autom. Reason. 24(1), 67\u2013100 (2000)","journal-title":"J. Autom. Reason."},{"issue":"1","key":"9411_CR22","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1109\/69.755612","volume":"11","author":"A Grama","year":"1999","unstructured":"Grama, A., Kumar, V.: State of the art in parallel search techniques for discrete optimization problems. IEEE Trans. Knowl. Data Eng. 11(1), 28\u201335 (1999)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"4","key":"9411_CR23","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1007\/s10723-009-9131-6","volume":"7","author":"EM Heien","year":"2009","unstructured":"Heien, E.M., Anderson, D.P., Hagihara, K.: Computing low latency batches with unreliable workers in volunteer computing environments. J Grid Comput. 7(4), 501 (2009)","journal-title":"J Grid Comput."},{"key":"9411_CR24","doi-asserted-by":"crossref","unstructured":"Jaffar, J., Santosa, A.E., Yap, R.H.C., Zhu, K.Q.: Scalable distributed depth-first search with greedy work stealing. In: 16th IEEE International Conference on Tools with Artificial Intelligence, 2004, pp. 98\u2013103. IEEE (2004)","DOI":"10.1109\/ICTAI.2004.107"},{"issue":"11","key":"9411_CR25","doi-asserted-by":"crossref","first-page":"1896","DOI":"10.1109\/TPDS.2011.50","volume":"22","author":"B Javadi","year":"2011","unstructured":"Javadi, B., Kondo, D., Vincent, J.M., Anderson, D.P.: Discovering statistical models of availability in large distributed systems: An empirical study of SETI@home. IEEE Trans. Parallel Distrib. Syst. 22(11), 1896\u20131903 (2011)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"9411_CR26","doi-asserted-by":"crossref","unstructured":"Jia, H., Moore, C.: How much backtracking does it take to color random graphs? Rigorous results on heavy tails. In: Proceedings of Principles and Practice of Constraint Programming - CP 2004, pp. 472\u2013476 (2004)","DOI":"10.1007\/978-3-540-30201-8_58"},{"issue":"3","key":"9411_CR27","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1145\/174130.174145","volume":"40","author":"RM Karp","year":"1993","unstructured":"Karp, R.M., Zhang, Y.: Randomized parallel algorithms for backtrack search and branch-and-bound computation. J. ACM 40(3), 765\u2013789 (1993)","journal-title":"J. ACM"},{"key":"9411_CR28","unstructured":"Mersenne Research Inc.: GIMPS history. http:\/\/www.mersenne.org\/various\/history.php , Cited: 21 Jan 2015"},{"key":"9411_CR29","doi-asserted-by":"crossref","unstructured":"Nurmi, D., Brevik, J., Wolski, R.: Modeling machine availability in enterprise and wide-area distributed computing environments. In: Euro-Par 2005 Parallel Processing, pp. 612\u2013612. Springer, Berlin (2005)","DOI":"10.1007\/11549468_50"},{"issue":"1","key":"9411_CR30","first-page":"149","volume":"11","author":"M Pataki","year":"2013","unstructured":"Pataki, M., Marosi, A.C.: Searching for translated plagiarism with the help of desktop grids. J Grid Comput. 11(1), 149\u2013166 (2013)","journal-title":"J Grid Comput."},{"key":"9411_CR31","unstructured":"Rechenkraft.net e.V.: yoyo@home. http:\/\/www.rechenkraft.net\/wiki\/index.php?title=Yoyo%40home_en , Cited: 21 Jan 2015"},{"key":"9411_CR32","doi-asserted-by":"crossref","unstructured":"R\u00e9gin, J.C., Rezgui, M., Malapert, A.: Embarrassingly parallel search. In: Principles and Practice of Constraint Programming, pp. 596\u2013610. Springer, Berlin (2013)","DOI":"10.1007\/978-3-642-40627-0_45"},{"key":"9411_CR33","doi-asserted-by":"crossref","unstructured":"Reinefeld, A., Schnecke, V.: Work-load balancing in highly parallel depth-first search. In: Proceedings of the Scalable High-Performance Computing Conference 1994, pp. 773\u2013780. IEEE (1994)","DOI":"10.1109\/SHPCC.1994.296719"},{"key":"9411_CR34","doi-asserted-by":"crossref","unstructured":"Sonnek, J., Chandra, A., Weissman, J.: Adaptive reputation-based scheduling on unreliable distributed infrastructures. IEEE Trans. Parallel Distrib. Syst. 18(11) (2007)","DOI":"10.1109\/TPDS.2007.1094"},{"key":"9411_CR35","unstructured":"Stolee, D.: TreeSearch user guide. http:\/\/www.math.uiuc.edu\/stolee\/SearchLib\/TreeSearch.pdf (2011)"},{"issue":"2\u20134","key":"9411_CR36","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1002\/cpe.938","volume":"17","author":"D Thain","year":"2005","unstructured":"Thain, D., Tannenbaum, T., Livny, M.: Distributed computing in practice: the Condor experience. Concurr. Comput. - Pract. E 17(2\u20134), 323\u2013356 (2005)","journal-title":"Concurr. Comput. - Pract. E"},{"issue":"2","key":"9411_CR37","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1137\/0215039","volume":"15","author":"RA Wright","year":"1986","unstructured":"Wright, R.A., Richmond, B., Odlyzko, A., McKay, B.D.: Constant time generation of free trees. SIAM J. Comput. 15(2), 540\u2013548 (1986)","journal-title":"SIAM J. Comput."}],"container-title":["Journal of Grid Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10723-017-9411-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10723-017-9411-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10723-017-9411-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,5]],"date-time":"2019-10-05T01:38:18Z","timestamp":1570239498000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10723-017-9411-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,23]]},"references-count":37,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["9411"],"URL":"https:\/\/doi.org\/10.1007\/s10723-017-9411-5","relation":{},"ISSN":["1570-7873","1572-9184"],"issn-type":[{"value":"1570-7873","type":"print"},{"value":"1572-9184","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,10,23]]}}}