{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T12:35:33Z","timestamp":1723034133091},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,9,23]],"date-time":"2014-09-23T00:00:00Z","timestamp":1411430400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2015,1]]},"DOI":"10.1007\/s11227-014-1291-x","type":"journal-article","created":{"date-parts":[[2014,9,24]],"date-time":"2014-09-24T00:01:38Z","timestamp":1411516898000},"page":"144-161","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The $$k$$ k -Set consensus problem with weight consideration"],"prefix":"10.1007","volume":"71","author":[{"given":"Chien-Fu","family":"Cheng","sequence":"first","affiliation":[]},{"given":"Hsien-Chun","family":"Liao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,9,23]]},"reference":[{"key":"1291_CR1","unstructured":"White T (2009) Hadoop: the definitive guide, MapReduce for the cloud. O\u2019Reilly Media, New York"},{"key":"1291_CR2","doi-asserted-by":"crossref","unstructured":"Afrati FN, Ullman JD (2011) Optimizing multiway joins in a map-reduce environment. IEEE Trans Knowl Data Eng 23(9)","DOI":"10.1109\/TKDE.2011.47"},{"key":"1291_CR3","doi-asserted-by":"crossref","unstructured":"Jiang D, Tung AKH, Chen G (2011) MAP-JOIN-REDUCE: toward scalable and efficient data analysis on large clusters. IEEE Trans Knowl Data Eng 23(9)","DOI":"10.1109\/TKDE.2010.248"},{"key":"1291_CR4","unstructured":"Attiya H, Welch J (2004) Distributed computing\u2014fundamentals, simulation and advanced topics, 2nd edn. Wiley, New York, pp 414"},{"issue":"2","key":"1291_CR5","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1109\/TDSC.2011.48","volume":"9","author":"F Borran","year":"2012","unstructured":"Borran F, Hutle M, Santos N, Schiper A (2012) Quantitative analysis of consensus algorithms. IEEE Trans Depend Secure Comput 9(2):236\u2013249","journal-title":"IEEE Trans Depend Secure Comput"},{"key":"1291_CR6","unstructured":"Silberschatz A, Galvin PB, Gagne G (2009) Operating system concepts, 8th edn. Wiley, New York"},{"issue":"2","key":"1291_CR7","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1145\/152610.152612","volume":"25","author":"M Barborak","year":"1993","unstructured":"Barborak M, Malek M, Dahubra A (1993) The consensus problem in fault-tolerant computing. ACM Comput Surv 25(2):171\u2013220","journal-title":"ACM Comput Surv"},{"issue":"3","key":"1291_CR8","doi-asserted-by":"crossref","first-page":"524","DOI":"10.1145\/79147.79158","volume":"37","author":"H Attiya","year":"1990","unstructured":"Attiya H, Bar-noy A, Dolev D, Peleg D, Reischuk R (1990) Renaming in an asynchronous environment. J ACM 37(3):524\u2013548","journal-title":"J ACM"},{"issue":"5","key":"1291_CR9","doi-asserted-by":"crossref","first-page":"912","DOI":"10.1145\/355483.355489","volume":"47","author":"S Chaudhuri","year":"2000","unstructured":"Chaudhuri S, Herlihy M, Lynch N, Tuttle M (2000) Tight bounds for $$k$$ k -set agreement. J ACM 47(5):912\u2013943","journal-title":"J ACM"},{"key":"1291_CR10","doi-asserted-by":"crossref","unstructured":"Parvedy PR, Raynal M, Travers C (2005) Decision optimal early-stopping $$k$$ k -set agreement in synchronous systems prone to send omission failures. In: Proceedings of the 11th Pacific Rim international symposium on dependable computing","DOI":"10.1109\/PRDC.2005.28"},{"issue":"5","key":"1291_CR11","doi-asserted-by":"crossref","first-page":"1449","DOI":"10.1137\/S0097539796307698","volume":"29","author":"M Saks","year":"2000","unstructured":"Saks M, Zaharoglou F (2000) Wait-free $$k$$ k -set agreement is impossible: the topology of public knowledge. SIAM J Comput 29(5):1449\u20131483","journal-title":"SIAM J Comput"},{"key":"1291_CR12","doi-asserted-by":"crossref","unstructured":"Garg VK, Bridgman J (2011) The weighted Byzantine agreement problem. In: Proceedings of the IEEE parallel and distributed processing symposium","DOI":"10.1109\/IPDPS.2011.57"},{"key":"1291_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0035753","volume-title":"Asymptotically optimal distributed consensus","author":"P Berman","year":"1989","unstructured":"Berman P, Garay JA (1989) Asymptotically optimal distributed consensus. Proceedings of the international colloquium on automata, languages and programming, Copenhagen"},{"key":"1291_CR14","doi-asserted-by":"crossref","unstructured":"Berman P, Garay JA, Perry KJ (1989) Towards optimal distributed consensus. In: Proceedings of the annual symposium on foundations of computer science, pp 410\u2013415","DOI":"10.1109\/SFCS.1989.63511"},{"issue":"3","key":"1291_CR15","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0020-0190(82)90033-3","volume":"14","author":"M Fisher","year":"1982","unstructured":"Fisher M, Lynch N (1982) A lower bound for the time to assure interactive consistency. Inf Process Lett 14(3):183\u2013186","journal-title":"Inf Process Lett"},{"issue":"2","key":"1291_CR16","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1145\/3149.214121","volume":"32","author":"M Fischer","year":"1985","unstructured":"Fischer M, Lynch N, Paterson M (1985) Impossibility of distributed consensus with one faulty process. J ACM 32(2):378\u2013382","journal-title":"J ACM"},{"key":"1291_CR17","doi-asserted-by":"crossref","first-page":"4260","DOI":"10.1016\/j.tcs.2010.11.012","volume":"412","author":"M Biely","year":"2011","unstructured":"Biely M, Hutle M (2011) Consensus when all processes may be Byzantine for some time. Theor Comput Sci 412:4260\u20134272","journal-title":"Theor Comput Sci"},{"issue":"2","key":"1291_CR18","doi-asserted-by":"crossref","first-page":"874","DOI":"10.1007\/s11227-012-0758-x","volume":"62","author":"CF Cheng","year":"2012","unstructured":"Cheng CF, Tsai KT (2012) From immediate agreement to eventual agreement: early stopping agreement protocol for dynamic networks with malicious faulty processors. J Supercomput 62(2):874\u2013894","journal-title":"J Supercomput"},{"key":"1291_CR19","doi-asserted-by":"crossref","unstructured":"Ma ZS, Krings AW (2011) Dynamic hybrid fault modeling and extended evolutionary game theory for reliability, survivability and fault tolerance analyses. IEEE Trans Reliab 60(1)","DOI":"10.1109\/TR.2011.2104997"},{"issue":"2","key":"1291_CR20","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0890-5401(92)90035-E","volume":"97","author":"A Bar-Noy","year":"1992","unstructured":"Bar-Noy A, Dolev D, Dwork C, Raymond Strong H (1992) Shifting gears: changing algorithms on the fly to expedite Byzantine agreement. Inf Comput 97(2):205\u2013233","journal-title":"Inf Comput"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-014-1291-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-014-1291-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-014-1291-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T10:40:36Z","timestamp":1559385636000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-014-1291-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9,23]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["1291"],"URL":"https:\/\/doi.org\/10.1007\/s11227-014-1291-x","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,9,23]]}}}