{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T05:34:31Z","timestamp":1740461671275,"version":"3.37.3"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2010,8,25]],"date-time":"2010-08-25T00:00:00Z","timestamp":1282694400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Informatik Spektrum"],"published-print":{"date-parts":[[2010,10]]},"DOI":"10.1007\/s00287-010-0470-2","type":"journal-article","created":{"date-parts":[[2010,8,24]],"date-time":"2010-08-24T08:35:34Z","timestamp":1282638934000},"page":"468-474","source":"Crossref","is-referenced-by-count":0,"title":["Algorithmische Grundlagen verteilter Speichersysteme"],"prefix":"10.1007","volume":"33","author":[{"given":"Friedhelm","family":"Meyer auf der Heide","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Scheideler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,8,25]]},"reference":[{"key":"470_CR1","unstructured":"Azar Y, Broder A, Karlin A, Upfal E (1994) Balanced allocation. In: Proc of the 26th ACM Symp on Theory of Computing (STOC), pp 593\u2013602"},{"key":"470_CR2","doi-asserted-by":"crossref","unstructured":"Brinkmann A, Effert S, Meyer auf der Heide F, Scheideler C (2007) Dynamic and redundant data placement. In: IEEE International Conference on Distributed Computing Systems (ICDCS), pp 29\u201338","DOI":"10.1109\/ICDCS.2007.103"},{"key":"470_CR3","doi-asserted-by":"crossref","unstructured":"Brinkmann A, Salzwedel K, Scheideler C (2000) Efficient, distributed data placement strategies for storage area networks. In: Proc of the 12th ACM Symp on Parallel Algorithms and Architectures (SPAA), pp 119\u2013128","DOI":"10.1145\/341800.341815"},{"key":"470_CR4","unstructured":"Brinkmann A, Salzwedel K, Scheideler C (2002) Compact, adaptive placement schemes for non-uniform capacities. In: Proc of the 14th ACM Symp on Parallel Algorithms and Architectures (SPAA), pp 53\u201362"},{"issue":"2","key":"470_CR5","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"J Carter","year":"1979","unstructured":"Carter J, Wegman M (1979) Universal classes of hash functions. J Comput Sys Sci 18(2):143\u2013154","journal-title":"J Comput Sys Sci"},{"key":"470_CR6","unstructured":"Czumaj A, Riley C, Scheideler C (2004) Perfectly balanced allocation. In: 7th Int Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM), pp 240\u2013251"},{"key":"470_CR7","doi-asserted-by":"crossref","unstructured":"Dietzfelbinger M, Meyer auf der Heide F (1993) Simple, efficient shared memory simulations. In: Proc of the 5th ACM Symp on Parallel Algorithms and Architectures (SPAA), pp 110\u2013119","DOI":"10.1145\/165231.165246"},{"key":"470_CR8","doi-asserted-by":"crossref","unstructured":"Karger D, Lehman E, Leighton T, Levine M, Lewin D, Panigrahy R (1997) Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web. In: Proc of the 29th ACM Symp on Theory of Computing (STOC), pp 654\u2013663","DOI":"10.1145\/258533.258660"},{"key":"470_CR9","doi-asserted-by":"crossref","unstructured":"Karp R, Luby M, Meyer auf der Heide F (1992) Efficient PRAM simulation on a distributed memory machine. In: Proc of the 24th ACM Symp on Theory of Computing (STOC), pp 318\u2013326","DOI":"10.1145\/129712.129743"},{"key":"470_CR10","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/978-3-662-12788-9_6","volume-title":"Probabilistic Methods for Algorithmic Discrete Mathematics","author":"C McDiarmid","year":"1998","unstructured":"McDiarmid C (1998) Concentration. In: Habib M, McDiarmid C, Ramirez-Alfonsin J, Reed B (eds) Probabilistic Methods for Algorithmic Discrete Mathematics. Springer, Berlin, pp 195\u2013247"},{"key":"470_CR11","unstructured":"Mense M, Scheideler C (2008) SPREAD: an adaptive scheme for redundant and fair storage in dynamic heterogeneous storage systems. In: Proc of the 19th ACM\/SIAM Symp on Discrete Algorithms (SODA), pp 1135\u20131144"},{"key":"470_CR12","unstructured":"Meyer auf der Heide F, Scheideler C, Stemann V (1995) Exploiting storage redundancy to speed up randomized shared memory simulations. In: Proc of the 12th Symp on Theoretical Aspects of Computer Science (STACS), pp 267\u2013278"},{"key":"470_CR13","doi-asserted-by":"crossref","unstructured":"Naor M, Wieder U (2003) Novel architectures for P2P applications: the continuous-discrete approach. In: Proc of the 15th ACM Symp on Parallel Algorithms and Architectures (SPAA), pp 50\u201359","DOI":"10.1145\/777412.777421"},{"key":"470_CR14","unstructured":"Steger A, Berenbrink P, Czumaj A, V\u00f6cking B (2000) Balanced allocations: The heavily loaded case. In: Proc of the 32nd ACM Symp on Theory of Computing (STOC), pp 745\u2013754"},{"key":"470_CR15","doi-asserted-by":"crossref","unstructured":"Schindelhauer C, Schomaker G (2005) Weighted distributed hash tables. In: Proc of the 17th ACM Symp on Parallel Algorithms and Architectures (SPAA), pp 218\u2013227","DOI":"10.1145\/1073970.1074008"},{"key":"470_CR16","doi-asserted-by":"crossref","unstructured":"Stoica I, Morris R, Karger D, Kaashoek F, Balakrishnan H (2001) Chord: a scalable peer-to-peer lookup service for Internet applications. In: Proc of the SIGCOMM \u201901, pp 149\u2013160","DOI":"10.1145\/383059.383071"}],"container-title":["Informatik-Spektrum"],"original-title":[],"language":"de","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00287-010-0470-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00287-010-0470-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00287-010-0470-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,24]],"date-time":"2025-02-24T23:51:32Z","timestamp":1740441092000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00287-010-0470-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,8,25]]},"references-count":16,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2010,10]]}},"alternative-id":["470"],"URL":"https:\/\/doi.org\/10.1007\/s00287-010-0470-2","relation":{},"ISSN":["0170-6012","1432-122X"],"issn-type":[{"type":"print","value":"0170-6012"},{"type":"electronic","value":"1432-122X"}],"subject":[],"published":{"date-parts":[[2010,8,25]]}}}