{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T22:20:02Z","timestamp":1761862802793},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540922209"},{"type":"electronic","value":"9783540922216"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-92221-6_41","type":"book-chapter","created":{"date-parts":[[2008,12,3]],"date-time":"2008-12-03T03:25:04Z","timestamp":1228274704000},"page":"564-567","source":"Crossref","is-referenced-by-count":4,"title":["A Distributed Algorithm for Resource Clustering in Large Scale Platforms"],"prefix":"10.1007","author":[{"given":"Olivier","family":"Beaumont","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Bonichon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philippe","family":"Duchon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lionel","family":"Eyraud-Dubois","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hubert","family":"Larchev\u00eaque","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"41_CR1","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1109\/GRID.2004.14","volume-title":"GRID 2004: Proceedings of the Fifth IEEE\/ACM International Workshop on Grid Computing","author":"D.P. Anderson","year":"2004","unstructured":"Anderson, D.P.: Boinc: A system for public-resource computing and storage. In: GRID 2004: Proceedings of the Fifth IEEE\/ACM International Workshop on Grid Computing, Washington, DC, USA, pp. 4\u201310. IEEE Computer Society, Los Alamitos (2004)"},{"key":"41_CR2","unstructured":"(Folding@home), http:\/\/folding.stanford.edu\/"},{"key":"41_CR3","unstructured":"(World community grid), http:\/\/www.worldcommunitygrid.org"},{"key":"41_CR4","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1145\/581571.581573","volume":"45","author":"D.P. 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\u00a045, 56\u201361 (2002)","journal-title":"Commun. ACM"},{"key":"41_CR5","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1016\/0196-6774(84)90004-X","volume":"5","author":"S. Assmann","year":"1984","unstructured":"Assmann, S., Johnson, D., Kleitman, D., Leung, J.: On a dual version of the one-dimensional bin packing problem. Journal of algorithms (Print)\u00a05, 502\u2013525 (1984)","journal-title":"Journal of algorithms (Print)"},{"key":"41_CR6","unstructured":"Franceschetti, M., Cook, M., Bruck, J.: A geometric theorem for approximate disk covering algorithms (2001)"},{"key":"41_CR7","doi-asserted-by":"crossref","unstructured":"Beaumont, O., Bonichon, N., Duchon, P., Eyraud-Dubois, L., Larcheveque, H.: A dsitributed algorithm for resource clustering in large scale platforms. Research report, INRIA Bordeaux Sud-Ouest, France, 15 pages (2008)","DOI":"10.1007\/978-3-540-92221-6_41"},{"key":"41_CR8","unstructured":"Csirik, J., Johnson, D., Kenyon, C.: Better approximation algorithms for bin covering. In: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, pp. 557\u2013566 (2001)"},{"key":"41_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69355-0_7","volume-title":"Structural Information and Communication Complexity","author":"O. Beaumont","year":"2008","unstructured":"Beaumont, O., Bonichon, N., Duchon, P., Larcheveque, H.: Distributed approximation algorithm for resource clustering. In: Shvartsman, A.A., Felber, P. (eds.) SIROCCO 2008. LNCS, vol.\u00a05058. Springer, Heidelberg (2008)"},{"key":"41_CR10","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1145\/972374.972394","volume":"34","author":"R. Cox","year":"2004","unstructured":"Cox, R., Dabek, F., Kaashoek, F., Li, J., Morris, R.: Practical, distributed network coordinates. ACM SIGCOMM Computer Communication Review\u00a034, 113\u2013118 (2004)","journal-title":"ACM SIGCOMM Computer Communication Review"},{"key":"41_CR11","doi-asserted-by":"crossref","unstructured":"Dabek, F., Cox, R., Kaashoek, F., Morris, R.: Vivaldi: a decentralized network coordinate system. In: Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications, pp. 15\u201326 (2004)","DOI":"10.1145\/1015467.1015471"},{"key":"41_CR12","unstructured":"Aspnes, J., Shah, G.: Skip graphs. In: Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, pp. 384\u2013393 (2003)"},{"key":"41_CR13","doi-asserted-by":"crossref","unstructured":"Ganesh, A., Kermarrec, A., Massouli\u00e9, L.: Peer-to-Peer Membership Management for Gossip-Based Protocols (2003)","DOI":"10.1109\/TC.2003.1176982"},{"key":"41_CR14","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/s10922-005-4441-x","volume":"13","author":"S. Voulgaris","year":"2005","unstructured":"Voulgaris, S., Gavidia, D., van Steen, M.: CYCLON: Inexpensive Membership Management for Unstructured P2P Overlays. Journal of Network and Systems Management\u00a013, 197\u2013217 (2005)","journal-title":"Journal of Network and Systems Management"},{"key":"41_CR15","doi-asserted-by":"crossref","unstructured":"Ng, T., Zhang, H.: Predicting internet network distance with coordinates-based approaches. In: IEEE (ed.) Proceedings of INFOCOM 2002, pp. 170\u2013179 (2002)","DOI":"10.1109\/INFCOM.2002.1019258"}],"container-title":["Lecture Notes in Computer Science","Principles of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92221-6_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,24]],"date-time":"2021-09-24T15:58:18Z","timestamp":1632499098000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92221-6_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540922209","9783540922216"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92221-6_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}