{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T18:35:36Z","timestamp":1771698936515,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,10,26]],"date-time":"2011-10-26T00:00:00Z","timestamp":1319587200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["DAAD19-02-1-0389"],"award-info":[{"award-number":["DAAD19-02-1-0389"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["CCF-0964474"],"award-info":[{"award-number":["CCF-0964474"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,10,26]]},"DOI":"10.1145\/2038916.2038939","type":"proceedings-article","created":{"date-parts":[[2011,10,27]],"date-time":"2011-10-27T13:17:33Z","timestamp":1319721453000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":65,"title":["Small cache, big effect"],"prefix":"10.1145","author":[{"given":"Bin","family":"Fan","sequence":"first","affiliation":[{"name":"Carnegie Mellon University"}]},{"given":"Hyeontaek","family":"Lim","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University"}]},{"given":"David G.","family":"Andersen","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University"}]},{"given":"Michael","family":"Kaminsky","sequence":"additional","affiliation":[{"name":"Intel Labs"}]}],"member":"320","published-online":{"date-parts":[[2011,10,26]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Hadoop. http:\/\/hadoop.apache.org\/.2011.  Hadoop. http:\/\/hadoop.apache.org\/.2011."},{"key":"e_1_3_2_1_2_1","unstructured":"HBase. http:\/\/hbase.apache.org\/ 2011.  HBase. http:\/\/hbase.apache.org\/ 2011."},{"key":"e_1_3_2_1_3_1","volume-title":"http:\/\/threadingbuildingblocks.org\/","author":"Building Blocks Intel Threading","year":"2011","unstructured":"Intel Threading Building Blocks . http:\/\/threadingbuildingblocks.org\/ , 2011 . Intel Threading Building Blocks. http:\/\/threadingbuildingblocks.org\/, 2011."},{"key":"e_1_3_2_1_4_1","volume-title":"https:\/\/thrift.apache.org\/","author":"Thrift Apache","year":"2011","unstructured":"Apache Thrift . https:\/\/thrift.apache.org\/ , 2011 . Apache Thrift. https:\/\/thrift.apache.org\/, 2011."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1402958.1402967"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1629575.1629577"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/MASCOT.2003.1240667"},{"key":"e_1_3_2_1_8_1","volume-title":"Proc. 9th USENIX OSDI","author":"Beaver D.","year":"2010","unstructured":"D. Beaver , S. Kumar , H. C. Li , J. Sobel , and P. Vajgel . Finding a needle in Haystack: Facebook's photo storage . In Proc. 9th USENIX OSDI , Oct. 2010 . D. Beaver, S. Kumar, H. C. Li, J. Sobel, and P. Vajgel. Finding a needle in Haystack: Facebook's photo storage. In Proc. 9th USENIX OSDI, Oct. 2010."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/IGCC.2011.6008565"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/613782.613998"},{"key":"e_1_3_2_1_11_1","volume-title":"Proc. 7th USENIX OSDI","author":"Chang F.","year":"2006","unstructured":"F. Chang , J. Dean , S. Ghemawat , W. C. Hsieh , D. A. Wallach , M. Burrows , T. Chandra , A. Fikes , and R. E. Gruber . Bigtable: A distributed storage system for structured data . In Proc. 7th USENIX OSDI , Nov. 2006 . F. Chang, J. Dean, S. Ghemawat, W. C. Hsieh, D. A. Wallach, M. Burrows, T. Chandra, A. Fikes, and R. E. Gruber. Bigtable: A distributed storage system for structured data. In Proc. 7th USENIX OSDI, Nov. 2006."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/502034.502054"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1498759.1498761"},{"key":"e_1_3_2_1_14_1","volume-title":"Proc. 6th USENIX OSDI","author":"Dean J.","year":"2004","unstructured":"J. Dean and S. Ghemawat . MapReduce: Simplified data processing on large clusters . In Proc. 6th USENIX OSDI , Dec. 2004 . J. Dean and S. Ghemawat. MapReduce: Simplified data processing on large clusters. In Proc. 6th USENIX OSDI, Dec. 2004."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1294261.1294281"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1629575.1629578"},{"key":"e_1_3_2_1_17_1","volume-title":"Proc. 9th USENIX OSDI","author":"Ford D.","year":"2010","unstructured":"D. Ford , F. Labelle , F. Popovici , M. Stokely , V.-A. Truong , L. Barroso , C. Grimes , and S. Quinlan . Availability in globally distributed storage systems . In Proc. 9th USENIX OSDI , Oct. 2010 . D. Ford, F. Labelle, F. Popovici, M. Stokely, V.-A. Truong, L. Barroso, C. Grimes, and S. Quinlan. Availability in globally distributed storage systems. In Proc. 9th USENIX OSDI, Oct. 2010."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/945445.945450"},{"key":"e_1_3_2_1_19_1","volume-title":"Proc. 4th USENIX OSDI","author":"Gribble S. D.","year":"2000","unstructured":"S. D. Gribble , E. A. Brewer , J. M. Hellerstein , and D. Culler . Scalable, distributed data structures for Internet service construction . In Proc. 4th USENIX OSDI , Nov. 2000 . S. D. Gribble, E. A. Brewer, J. M. Hellerstein, and D. Culler. Scalable, distributed data structures for Internet service construction. In Proc. 4th USENIX OSDI, Nov. 2000."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1851182.1851207"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1272996.1273005"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1815961.1816002"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258660"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0140-3664(00)00308-X"},{"key":"e_1_3_2_1_25_1","unstructured":"Memcached. A distributed memory object caching system. http:\/\/memcached.org\/ 2011.  Memcached. A distributed memory object caching system. http:\/\/memcached.org\/ 2011."},{"key":"e_1_3_2_1_26_1","first-page":"255","volume-title":"Handbook of Randomized Computing","author":"Mitzenmacher M.","year":"2000","unstructured":"M. Mitzenmacher , A. W. Richa , and R. Sitaraman . The power of two random choices: A survey of techniques and results . In Handbook of Randomized Computing , pages 255 -- 312 . Kluwer , 2000 . M. Mitzenmacher, A. W. Richa, and R. Sitaraman. The power of two random choices: A survey of techniques and results. In Handbook of Randomized Computing, pages 255--312. Kluwer, 2000."},{"key":"e_1_3_2_1_27_1","volume-title":"Apr.","author":"O'Malley O.","year":"2009","unstructured":"O. O'Malley and A. Murthy . Winning a 60 Second Dash with a Yellow Elephant http:\/\/sortbenchmark.org\/Yahoo2009.pdf , Apr. 2009 . O. O'Malley and A. Murthy. Winning a 60 Second Dash with a Yellow Elephant http:\/\/sortbenchmark.org\/Yahoo2009.pdf, Apr. 2009."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1713254.1713276"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/50202.50214"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/646975.711521"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/s007780050053"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/383059.383071"}],"event":{"name":"SOCC '11: ACM Symposium on Cloud Computing in conjunction with SOSP 2011","location":"Cascais Portugal","acronym":"SOCC '11","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGOPS ACM Special Interest Group on Operating Systems"]},"container-title":["Proceedings of the 2nd ACM Symposium on Cloud Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2038916.2038939","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2038916.2038939","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:48:53Z","timestamp":1750240133000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2038916.2038939"}},"subtitle":["provable load balancing for randomly partitioned cluster services"],"short-title":[],"issued":{"date-parts":[[2011,10,26]]},"references-count":32,"alternative-id":["10.1145\/2038916.2038939","10.1145\/2038916"],"URL":"https:\/\/doi.org\/10.1145\/2038916.2038939","relation":{},"subject":[],"published":{"date-parts":[[2011,10,26]]},"assertion":[{"value":"2011-10-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}