{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,8]],"date-time":"2026-09-08T12:10:38Z","timestamp":1788869438721,"version":"build-2803163510"},"reference-count":43,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2014,7,1]],"date-time":"2014-07-01T00:00:00Z","timestamp":1404172800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["CCF-0937938 and IIP-0934401"],"award-info":[{"award-number":["CCF-0937938 and IIP-0934401"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003329","name":"Ministerio de Econom\u00eda y Competitividad","doi-asserted-by":"publisher","award":["TIN2012-34557"],"award-info":[{"award-number":["TIN2012-34557"]}],"id":[{"id":"10.13039\/501100003329","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000151","name":"Division of Industrial Innovation and Partnerships","doi-asserted-by":"publisher","award":["CCF-0937938 and IIP-0934401"],"award-info":[{"award-number":["CCF-0937938 and IIP-0934401"]}],"id":[{"id":"10.13039\/100000151","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Catalan Government","award":["2009-SGR-980"],"award-info":[{"award-number":["2009-SGR-980"]}]},{"DOI":"10.13039\/501100004963","name":"Seventh Framework Programme","doi-asserted-by":"publisher","award":["238808"],"award-info":[{"award-number":["238808"]}],"id":[{"id":"10.13039\/501100004963","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006358","name":"University of California, Santa Cruz","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006358","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Storage"],"published-print":{"date-parts":[[2014,7]]},"abstract":"<jats:p>The ever-growing amount of data requires highly scalable storage solutions. The most flexible approach is to use storage pools that can be expanded and scaled down by adding or removing storage devices. To make this approach usable, it is necessary to provide a solution to locate data items in such a dynamic environment. This article presents and evaluates the Random Slicing strategy, which incorporates lessons learned from table-based, rule-based, and pseudo-randomized hashing strategies and is able to provide a simple and efficient strategy that scales up to handle exascale data. Random Slicing keeps a small table with information about previous storage system insert and remove operations, drastically reducing the required amount of randomness while delivering a perfect load distribution.<\/jats:p>","DOI":"10.1145\/2632230","type":"journal-article","created":{"date-parts":[[2014,8,13]],"date-time":"2014-08-13T16:33:25Z","timestamp":1407947605000},"page":"1-35","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Random Slicing"],"prefix":"10.1145","volume":"10","author":[{"given":"Alberto","family":"Miranda","sequence":"first","affiliation":[{"name":"Barcelona Supercomputing Center, Barcelona, Spain"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sascha","family":"Effert","sequence":"additional","affiliation":[{"name":"Christmann Informationstechnik + Medien, Ilsede, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yangwook","family":"Kang","sequence":"additional","affiliation":[{"name":"University of California, Santa Cruz, CA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ethan L.","family":"Miller","sequence":"additional","affiliation":[{"name":"University of California, Santa Cruz, CA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ivan","family":"Popov","sequence":"additional","affiliation":[{"name":"Johannes Gutenberg-University, Mainz, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andre","family":"Brinkmann","sequence":"additional","affiliation":[{"name":"Johannes Gutenberg-University, Mainz, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tom","family":"Friedetzky","sequence":"additional","affiliation":[{"name":"Durham University, Durham, England, U.K."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Toni","family":"Cortes","sequence":"additional","affiliation":[{"name":"Barcelona Supercomputing Center and Technical University of Catalonia, Barcelona, Spain"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2014,8,7]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"S. Amarasinghe D. Campbell W. Carlson A. Chien W. Dally E. Elnohazy M. Hall etal 2010. ExaScale software study: Software challenges in extreme scale systems. Tech. Rep. sponsored by DARPA IPTO in the context of the ExaScale Computing Study.  S. Amarasinghe D. Campbell W. Carlson A. Chien W. Dally E. Elnohazy M. Hall et al. 2010. ExaScale software study: Software challenges in extreme scale systems. Tech. Rep. sponsored by DARPA IPTO in the context of the ExaScale Computing Study."},{"key":"e_1_2_1_2_1","volume-title":"Proceedings of the 20th IEEE Conference on Mass Storage Systems and Technologies (MSST). 165--176","author":"Azagury A.","unstructured":"A. Azagury , V. Dreizin , M. Factor , E. Henis , D. Naor , Y. Rinetzky , O. Rodeh , J. Satran , A. Tavory , and L. Yerushalmi . 2003. Towards an object store . In Proceedings of the 20th IEEE Conference on Mass Storage Systems and Technologies (MSST). 165--176 . A. Azagury, V. Dreizin, M. Factor, E. Henis, D. Naor, Y. Rinetzky, O. Rodeh, J. Satran, A. Tavory, and L. Yerushalmi. 2003. Towards an object store. In Proceedings of the 20th IEEE Conference on Mass Storage Systems and Technologies (MSST). 165--176."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795288490"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/191995.192033"},{"key":"e_1_2_1_6_1","volume-title":"Proceedings of the 5th Australian Supercomputer Conference. 95--104","author":"Brent R. P.","year":"1992","unstructured":"R. P. Brent . 1992 . Uniform random number generators for supercomputers . In Proceedings of the 5th Australian Supercomputer Conference. 95--104 . R. P. Brent. 1992. Uniform random number generators for supercomputers. In Proceedings of the 5th Australian Supercomputer Conference. 95--104."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92221-6_38"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2007.103"},{"key":"e_1_2_1_9_1","volume-title":"Proceedings of the 21st IEEE Conference on Mass Storage Systems and Technologies (MSST). 153--157","author":"Brinkmann A.","unstructured":"A. Brinkmann , M. Heidebuer , F. Meyer Auf Der Heide, U. R\u00fcckert, K. Salzwedel, and M. Vodisek. 2004. V: Drive - Costs and Benefits of an Out-of-Band Storage Virtualization System . In Proceedings of the 21st IEEE Conference on Mass Storage Systems and Technologies (MSST). 153--157 . A. Brinkmann, M. Heidebuer, F. Meyer Auf Der Heide, U. R\u00fcckert, K. Salzwedel, and M. Vodisek. 2004. V: Drive - Costs and Benefits of an Out-of-Band Storage Virtualization System. In Proceedings of the 21st IEEE Conference on Mass Storage Systems and Technologies (MSST). 153--157."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/341800.341815"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/564870.564878"},{"key":"e_1_2_1_12_1","first-page":"4","article-title":"On inversive maximal period polynomials over finite fields","volume":"6","author":"Chou W. S.","year":"1995","unstructured":"W. S. Chou . 1995 . On inversive maximal period polynomials over finite fields . Appl. Algeb. Eng. Commun. Comput. 6 , 4 -- 5 , 245--250. W. S. Chou. 1995. On inversive maximal period polynomials over finite fields. Appl. Algeb. Eng. Commun. Comput. 6, 4--5, 245--250.","journal-title":"Appl. Algeb. Eng. Commun. Comput."},{"key":"e_1_2_1_13_1","volume-title":"Proceedings of the 3rd USENIX Conference on File and Storage Technologies (FAST). 1--14","author":"Corbett P.","unstructured":"P. Corbett , B. English , A. Goel , T. Grcanac , S. Kleiman , J. Leong , and S. Sankar . 2004. Row-diagonal parity for double disk failure correction . In Proceedings of the 3rd USENIX Conference on File and Storage Technologies (FAST). 1--14 . P. Corbett, B. English, A. Goel, T. Grcanac, S. Kleiman, J. Leong, and S. Sankar. 2004. Row-diagonal parity for double disk failure correction. In Proceedings of the 3rd USENIX Conference on File and Storage Technologies (FAST). 1--14."},{"key":"e_1_2_1_14_1","volume-title":"Proceedings of the USENIX Annual Technical Conference. 119--132","author":"Cortes T.","unstructured":"T. Cortes and J. Labarta . 2001. Extending heterogeneity to RAID level 5 . In Proceedings of the USENIX Annual Technical Conference. 119--132 . T. Cortes and J. Labarta. 2001. Extending heterogeneity to RAID level 5. In Proceedings of the USENIX Annual Technical Conference. 119--132."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77974-2"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1323293.1294281"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/SNAPI.2008.14"},{"key":"e_1_2_1_18_1","doi-asserted-by":"crossref","unstructured":"D. Eastlake and P. Jones. 2001. US secure hash algorithm 1 (SHA1).  D. Eastlake and P. Jones. 2001. US secure hash algorithm 1 (SHA1).","DOI":"10.17487\/rfc3174"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88871-0_64"},{"key":"e_1_2_1_20_1","volume-title":"Proceedings of the 17th IEEE International Parallel and Distributed Processing Symposium (IPDPS).","author":"Honicky R. J.","unstructured":"R. J. Honicky and E. L. Miller . 2003. A fast algorithm for online placement and reorganization of replicated data . In Proceedings of the 17th IEEE International Parallel and Distributed Processing Symposium (IPDPS). R. J. Honicky and E. L. Miller. 2003. A fast algorithm for online placement and reorganization of replicated data. In Proceedings of the 17th IEEE International Parallel and Distributed Processing Symposium (IPDPS)."},{"key":"e_1_2_1_21_1","volume-title":"Proceedings of the 18th IEEE International Parallel and Distributed Processing Symposium (IPDPS).","author":"Honicky R. J.","unstructured":"R. J. Honicky and E. L. Miller . 2004. Replication under scalable hashing: A family of algorithms for scalable decentralized data distribution . In Proceedings of the 18th IEEE International Parallel and Distributed Processing Symposium (IPDPS). R. J. Honicky and E. L. Miller. 2004. Replication under scalable hashing: A family of algorithms for scalable decentralized data distribution. In Proceedings of the 18th IEEE International Parallel and Distributed Processing Symposium (IPDPS)."},{"key":"e_1_2_1_22_1","unstructured":"N. L. Johnson and S. Kotz. 1977. Urn Models and Their Applications. Wiley New York.  N. L. Johnson and S. Kotz. 1977. Urn Models and Their Applications. Wiley New York."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258660"},{"key":"e_1_2_1_24_1","unstructured":"D. E. Knuth. 1997. Volume 2: Seminumerical Algorithms. In the Art of Computer Programming 192.  D. E. Knuth. 1997. Volume 2: Seminumerical Algorithms. In the Art of Computer Programming 192."},{"key":"e_1_2_1_25_1","first-page":"141","article-title":"Mathematical methods in large-scale computing units","volume":"26","author":"Lehmer D. H.","year":"1951","unstructured":"D. H. Lehmer . 1951 . Mathematical methods in large-scale computing units . Ann. Comput. Lab. Harvard Univ. 26 , 141 -- 146 . D. H. Lehmer. 1951. Mathematical methods in large-scale computing units. Ann. Comput. Lab. Harvard Univ. 26, 141--146.","journal-title":"Ann. Comput. Lab. Harvard Univ."},{"key":"e_1_2_1_26_1","volume-title":"Pseudorandomness and Cryptographic Applications","author":"Luby M.","unstructured":"M. Luby . 1996. Pseudorandomness and Cryptographic Applications . Princeton University Press . M. Luby. 1996. Pseudorandomness and Cryptographic Applications. Princeton University Press."},{"key":"e_1_2_1_27_1","doi-asserted-by":"crossref","unstructured":"G. Marsaglia and A. Zaman. 1991. A new class of random number generators. Ann. Appl. Probab. 462--480.  G. Marsaglia and A. Zaman. 1991. A new class of random number generators. Ann. Appl. Probab. 462--480.","DOI":"10.1214\/aoap\/1177005878"},{"key":"e_1_2_1_28_1","volume-title":"Proceedings of the 19th ACM-SIAM Symposium on Discrete Algorithms (SODA).","author":"Mense M.","unstructured":"M. Mense and C. Scheideler . 2008. SPREAD: An adaptive scheme for redundant and fair storage in dynamic heterogeneous storage systems . In Proceedings of the 19th ACM-SIAM Symposium on Discrete Algorithms (SODA). M. Mense and C. Scheideler. 2008. SPREAD: An adaptive scheme for redundant and fair storage in dynamic heterogeneous storage systems. In Proceedings of the 19th ACM-SIAM Symposium on Discrete Algorithms (SODA)."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/50202.50214"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/PDP.2012.58"},{"key":"e_1_2_1_32_1","doi-asserted-by":"crossref","unstructured":"M. Raab and A. Steger. 1998. Balls into BINSA simple and tight analysis. Random. Approx. Tech. Comput. Sci. 159--170.   M. Raab and A. Steger. 1998. Balls into BINSA simple and tight analysis. Random. Approx. Tech. Comput. Sci. 159--170.","DOI":"10.1007\/3-540-49543-6_13"},{"key":"e_1_2_1_33_1","volume-title":"Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM, 67--76","author":"Sanders P.","year":"2001","unstructured":"P. Sanders . 2001 . Reconciling simplicity and realism in parallel disk models . In Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM, 67--76 . P. Sanders. 2001. Reconciling simplicity and realism in parallel disk models. In Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM, 67--76."},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073970.1074008"},{"key":"e_1_2_1_35_1","volume-title":"System Modeling and Simulation: An Introduction","author":"Severence F. L.","unstructured":"F. L. Severence . 2009. System Modeling and Simulation: An Introduction . Wiley . F. L. Severence. 2009. System Modeling and Simulation: An Introduction. Wiley."},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72540-4_1"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03356-8_4"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2002.808407"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.5555\/956415.956443"},{"key":"e_1_2_1_40_1","unstructured":"J. Walker. 1998. ENT Test suite. http:\/\/www.fourmilab.ch\/random.  J. Walker. 1998. ENT Test suite. http:\/\/www.fourmilab.ch\/random."},{"key":"e_1_2_1_41_1","unstructured":"T. Wang. 2007. Integer hash function. http:\/\/www.concentric.net\/ttwang\/tech\/inthash.htm.  T. Wang. 2007. Integer hash function. http:\/\/www.concentric.net\/ttwang\/tech\/inthash.htm."},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/11535218_2"},{"key":"e_1_2_1_43_1","volume-title":"Proceedings of the 7th Symposium on Operating Systems Design and Implementation (OSDI). 307--320","author":"Weil S. A.","unstructured":"S. A. Weil , S. A. Brandt , E. L. Miller , D. D. E. Long , and C. Maltzahn . 2006a. Ceph: A scalable, high-performance distributed file system . In Proceedings of the 7th Symposium on Operating Systems Design and Implementation (OSDI). 307--320 . S. A. Weil, S. A. Brandt, E. L. Miller, D. D. E. Long, and C. Maltzahn. 2006a. Ceph: A scalable, high-performance distributed file system. In Proceedings of the 7th Symposium on Operating Systems Design and Implementation (OSDI). 307--320."},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/1188455.1188582"},{"key":"e_1_2_1_45_1","volume-title":"Proceedings of the 9th USENIX Conference on File and Storage Technologies (FAST).","author":"Zheng W.","unstructured":"W. Zheng and G. Zhang . 2011. FastScale: Accelerate RAID Scaling by minimizing data migration . In Proceedings of the 9th USENIX Conference on File and Storage Technologies (FAST). W. Zheng and G. Zhang. 2011. FastScale: Accelerate RAID Scaling by minimizing data migration. In Proceedings of the 9th USENIX Conference on File and Storage Technologies (FAST)."}],"container-title":["ACM Transactions on Storage"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2632230","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2632230","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:56:13Z","timestamp":1750215373000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2632230"}},"subtitle":["Efficient and Scalable Data Placement for Large-Scale Storage Systems"],"short-title":[],"issued":{"date-parts":[[2014,7]]},"references-count":43,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,7]]}},"alternative-id":["10.1145\/2632230"],"URL":"https:\/\/doi.org\/10.1145\/2632230","relation":{},"ISSN":["1553-3077","1553-3093"],"issn-type":[{"value":"1553-3077","type":"print"},{"value":"1553-3093","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,7]]},"assertion":[{"value":"2012-11-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2013-09-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2014-08-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}