{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T12:22:48Z","timestamp":1710332568025},"reference-count":32,"publisher":"Sociedade Brasileira de Computacao - SB","issue":"3","license":[{"start":{"date-parts":[[2012,10,25]],"date-time":"2012-10-25T00:00:00Z","timestamp":1351123200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/2.0"},{"start":{"date-parts":[[2012,10,25]],"date-time":"2012-10-25T00:00:00Z","timestamp":1351123200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/2.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Internet Serv Appl"],"published-print":{"date-parts":[[2012,12]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>Cycle sharing over the Internet has increased in popularity during the last decade, with increasingly powerful machines being made available to existing projects. In this paper, we present GiGi-MR, a framework that allows non-expert users to run CPU-intensive jobs on top of volunteer resources over the Internet. GiGi-MR has several distinctive features: it allows non-expert users to easily partition their jobs in several parallel tasks; such Bag-of-Tasks (BoT) are executed in parallel as a set of MapReduce applications; the volunteer resources that provide the best match for the tasks being executed are chosen (using attenuated bloom filters); it provides a portable checkpointing fault-tolerance mechanism based on virtualization; it does not rely exclusively on a central server (or servers) at all times (thus minimizing the bottleneck effect); it deals with malicious participants (possibly byzantine) using an efficient partial replication mechanism to validate the results obtained; and it is compatible with BOINC (one of the most popular open-source software platforms for computing using volunteered resources). We describe GiGi-MR\u2019s architecture and evaluate its performance by executing several MapReduce applications on a wide area testbed. Furthermore, we use micro-benchmarks to assess each one of GiGi-MR\u2019s components independently. The system\u2019s overhead is minimal. When compared to an unmodified volunteer computing system, GiGi-MR obtains a performance increase of over 60\u00a0% in application turnaround time, while reducing the bandwidth used by an order of magnitude.<\/jats:p>","DOI":"10.1007\/s13174-012-0072-0","type":"journal-article","created":{"date-parts":[[2012,10,24]],"date-time":"2012-10-24T19:44:39Z","timestamp":1351107879000},"page":"329-346","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Large-scale volunteer computing over the Internet"],"prefix":"10.5753","volume":"3","author":[{"given":"Fernando","family":"Costa","sequence":"first","affiliation":[]},{"given":"Jo\u00e3o Nuno","family":"Silva","sequence":"additional","affiliation":[]},{"given":"Lu\u00eds","family":"Veiga","sequence":"additional","affiliation":[]},{"given":"Paulo","family":"Ferreira","sequence":"additional","affiliation":[]}],"member":"3742","published-online":{"date-parts":[[2012,10,25]]},"reference":[{"key":"72_CR1","doi-asserted-by":"crossref","unstructured":"Abramson D, Sosic R, Giddy J, Hall B (1995) Nimrod: a tool for performing parametrised simulations using distributed workstations. In: Proceedings of the 4th IEEE international symposium on high performance distributed computing, HPDC \u201995. IEEE Computer Society, Washington, DC, USA, pp 112\u2013121.","DOI":"10.1109\/HPDC.1995.518701"},{"key":"72_CR2","doi-asserted-by":"crossref","unstructured":"Anderson DP (2004) Boinc: A system for public-resource computing and storage. In: Proceedings of the 5th IEEE\/ACM international workshop on grid computing, GRID \u201904. IEEE Computer Society, Washington, DC, USA, pp 4\u201310","DOI":"10.1109\/GRID.2004.14"},{"key":"72_CR3","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1145\/581571.581573","volume":"45","author":"DP Anderson","year":"2002","unstructured":"Anderson DP, Cobb J, Korpela E, Lebofsky M, Werthimer D (2002) Seti@home: an experiment in public-resource computing. Commun ACM 45:56\u201361","journal-title":"Commun ACM"},{"issue":"7","key":"72_CR4","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"BH Bloom","year":"1970","unstructured":"Bloom BH (1970) Space\/time trade-offs in hash coding with allowable errors. Commun ACM 13(7):422\u2013426","journal-title":"Commun ACM"},{"key":"72_CR5","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1016\/j.future.2004.04.011","volume":"21","author":"F Cappello","year":"2005","unstructured":"Cappello F, Djilali S, Fedak G, Herault T, Magniette F, N\u00e9ri V, Lodygensky O (2005) Computing on large-scale distributed systems: Xtremweb architecture, programming models, security, tests and convergence with grid. Future Gener Comput Syst 21:417\u2013437","journal-title":"Future Gener Comput Syst"},{"key":"72_CR6","unstructured":"Chazelle B, Kilian J, Rubinfeld R, Tal A (2004) The bloomier filter: an efficient data structure for static support lookup tables. In: Proceedings of the fifteenth annual ACM-SIAM symposium on discrete algorithms, Society for Industrial and Applied Mathematics, SODA \u201904, Philadelphia, PA, USA, pp 30\u201339"},{"key":"72_CR7","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/956993.956995","volume":"33","author":"B Chun","year":"2003","unstructured":"Chun B, Culler D, Roscoe T, Bavier A, Peterson L, Wawrzoniak M, Bowman M (2003) Planetlab: an overlay testbed for broad-coverage services. SIGCOMM Comput Commun Rev 33:3\u201312","journal-title":"SIGCOMM Comput Commun Rev"},{"key":"72_CR8","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s10723-006-9040-x","volume":"4","author":"W Cirne","year":"2006","unstructured":"Cirne W, Brasileiro F, Andrade N, Costa L, Andrade A, Novaes R, Mowbray M (2006) Labs of the world, unite!!!. J Grid Comput 4:225\u2013246","journal-title":"J Grid Comput"},{"issue":"3","key":"72_CR9","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1142\/S0129626408003466","volume":"18","author":"F Costa","year":"2008a","unstructured":"Costa F, Kelley I, Silva L, Fedak G (2008a) Optimizing data distribution in desktop grid platforms. Parallel Process Lett (PPL) 18(3):391\u2013410","journal-title":"Parallel Process Lett (PPL)"},{"key":"72_CR10","doi-asserted-by":"crossref","unstructured":"Costa F, Silva L, Fedak G, Kelley I (2008b) Optimizing the data distribution layer of boinc with bittorrent. In: International symposium on parallel and distributed processing symposium, pp 1\u20138","DOI":"10.1109\/IPDPS.2008.4536446"},{"key":"72_CR11","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/1327452.1327492","volume":"51","author":"J Dean","year":"2008","unstructured":"Dean J, Ghemawat S (2008) Mapreduce: simplified data processing on large clusters. Commun ACM 51:107\u2013113","journal-title":"Commun ACM"},{"issue":"3","key":"72_CR12","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1109\/90.851975","volume":"8","author":"L Fan","year":"2000","unstructured":"Fan L, Cao P, Almeida J, Broder AZ (2000) Summary cache: a scalable wide-area web cache sharing protocol. IEEE\/ACM Trans Netw 8(3):281\u2013293","journal-title":"IEEE\/ACM Trans Netw"},{"key":"72_CR13","doi-asserted-by":"crossref","unstructured":"Fedak G, He H, Cappello F (2008) Bitdew: a programmable environment for large-scale data management and distribution. In: Proceedings of the 2008 ACM\/IEEE conference on supercomputing, SC \u201908. IEEE Press, Piscataway, pp 45:1\u201345:12","DOI":"10.1109\/SC.2008.5213939"},{"key":"72_CR14","unstructured":"Goering P, Heijenk G (2006) Service discovery using bloom filters. In: Proceedings of twelfth annual conference of the advanced school for computing and imaging, pp 14\u201316"},{"key":"72_CR15","unstructured":"Goodwin P, Wright G (2004) Decision Analysis for Management Judgment. Wiley, New York"},{"key":"72_CR16","doi-asserted-by":"crossref","unstructured":"Gropp W, Lusk E (1995) Dynamic process management in an mpi setting. In: Proceedings of the seventh IEEE symposium on parallel and distributed processing, 1995, pp 530\u2013533","DOI":"10.1109\/SPDP.1995.530729"},{"key":"72_CR17","doi-asserted-by":"crossref","unstructured":"Guo Z, Fox G, Zhou M (2012) Investigation of data locality in mapreduce. In: Proceedings of the 2012 12th IEEE\/ACM international symposium on cluster, cloud and grid computing (ccgrid 2012), CCGRID \u201912. IEEE Computer Society, Washington, DC, pp 419\u2013426","DOI":"10.1109\/CCGrid.2012.42"},{"key":"72_CR18","doi-asserted-by":"crossref","unstructured":"Kondo D, Javadi B, Malecot P, Cappello F, Anderson DP (2009) Cost-benefit analysis of cloud computing versus desktop grids. In: Proceedings of the 2009 IEEE international symposium on parallel and distributed processing, IPDPS \u201909. IEEE Computer Society, Washington, DC, USA, pp 1\u201312","DOI":"10.1109\/IPDPS.2009.5160911"},{"key":"72_CR19","unstructured":"Larson SM, Snow CD, Shirts M, Pande VS (2002) Folding@home and genome@home: Using distributed computing to tackle previously intractable problems in computational biology. Comput. Genomics."},{"key":"72_CR20","doi-asserted-by":"crossref","unstructured":"Lin H, Ma X, Archuleta J, Feng Wc, Gardner M, Zhang Z (2010) Moon: mapreduce on opportunistic environments. In: Proceedings of the 19th ACM international symposium on high performance distributed computing, HPDC \u201910. ACM, New York, pp 95\u2013106","DOI":"10.1145\/1851476.1851489"},{"key":"72_CR21","doi-asserted-by":"crossref","unstructured":"Lv Q, Cao Q (2007) Service discovery using hybrid bloom filters in ad-hoc networks. In: International Conference on wireless communications, networking and mobile computing, 2007. WiCom 2007, pp 1542\u20131545","DOI":"10.1109\/WICOM.2007.388"},{"key":"72_CR22","unstructured":"Marozzo F, Talia D, Trunfio P (2008) Adapting mapreduce for dynamic environments using a peer-to-peer model. In: Proceedings of the first workshop on cloud computing and its applications (CCA 2008), Chicago, USA"},{"issue":"247","key":"72_CR23","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1080\/01621459.1949.10483310","volume":"44","author":"N Metropolis","year":"1949","unstructured":"Metropolis N, Ulam S (1949) The Monte Carlo method. J Am Stat Assoc 44(247):335\u2013341","journal-title":"J Am Stat Assoc"},{"key":"72_CR24","doi-asserted-by":"crossref","unstructured":"Pearson K (1905) The problem of the random walk. Nature 72","DOI":"10.1038\/072294b0"},{"key":"72_CR25","doi-asserted-by":"crossref","unstructured":"Ratnasamy S, Francis P, Handley M, Karp R, Shenker S (2001) A scalable content-addressable network. In: Proceedings of the 2001 conference on applications, technologies, architectures, and protocols for computer communications, SIGCOMM \u201901. ACM, New York, pp 161\u2013172","DOI":"10.1145\/383059.383072"},{"key":"72_CR26","doi-asserted-by":"crossref","unstructured":"Rhea S, Kubiatowicz J (2002) Probabilistic location and routing. In: Proceedings of INFOCOM 2002. Twenty-first annual joint conference of the IEEE computer and communications societies, vol 3. IEEE, New York, pp 1248\u20131257","DOI":"10.1109\/INFCOM.2002.1019375"},{"key":"#cr-split#-72_CR27.1","doi-asserted-by":"crossref","unstructured":"Rowstron A, Druschel P (2001) Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Guerraoui R","DOI":"10.1007\/3-540-45518-3_18"},{"key":"#cr-split#-72_CR27.2","unstructured":"(ed) Middleware 2001. Lecture Notes in Computer Science, vol 2218, Springer, Berlin, pp 329-350"},{"key":"72_CR28","doi-asserted-by":"crossref","unstructured":"Silva J, Ferreira P, Veiga L (2010) Service and resource discovery in cycle-sharing environments with a utility algebra. In: 2010 IEEE international symposium on parallel distributed processing (IPDPS), pp 1\u201311","DOI":"10.1109\/IPDPS.2010.5470410"},{"key":"72_CR29","volume-title":"MPI: the complete reference","author":"M Snir","year":"1995","unstructured":"Snir M, Otto SW, Walker DW, Dongarra J, Huss-Lederman S (1995) MPI: the complete reference. MIT Press, Cambridge"},{"key":"72_CR30","doi-asserted-by":"crossref","unstructured":"Stoica I, Morris R, Karger D, Kaashoek MF, Balakrishnan H (2001) Chord: a scalable peer-to-peer lookup service for internet applications. In: Proceedings of the 2001 conference on applications, technologies, architectures, and protocols for computer communications, SIGCOMM \u201901. ACM, New York, pp 149\u2013160","DOI":"10.1145\/383059.383071"},{"key":"72_CR31","doi-asserted-by":"crossref","unstructured":"Tang B, Moca M, Chevalier S, He H, Fedak G (2010) Towards mapreduce for desktop grid computing. In: Proceedings of the 2010 international conference on P2P, parallel, grid, cloud and internet computing, 3PGCIC \u201910. IEEE Computer Society, Washington, DC, pp 193\u2013200","DOI":"10.1109\/3PGCIC.2010.33"}],"container-title":["Journal of Internet Services and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13174-012-0072-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13174-012-0072-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/s13174-012-0072-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13174-012-0072-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,9]],"date-time":"2022-02-09T22:14:41Z","timestamp":1644444881000},"score":1,"resource":{"primary":{"URL":"https:\/\/jisajournal.springeropen.com\/articles\/10.1007\/s13174-012-0072-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,25]]},"references-count":32,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,12]]}},"alternative-id":["72"],"URL":"https:\/\/doi.org\/10.1007\/s13174-012-0072-0","relation":{},"ISSN":["1867-4828","1869-0238"],"issn-type":[{"value":"1867-4828","type":"print"},{"value":"1869-0238","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,10,25]]},"assertion":[{"value":"10 July 2012","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 October 2012","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 October 2012","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}