{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T07:46:37Z","timestamp":1759131997969,"version":"3.41.0"},"reference-count":43,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2005,11,1]],"date-time":"2005-11-01T00:00:00Z","timestamp":1130803200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Comput. Syst."],"published-print":{"date-parts":[[2005,11]]},"abstract":"<jats:p>\n            Despite the importance of storage in enterprise computer systems, there are few adequate tools to design and configure a storage system to meet application data requirements efficiently. Storage system design involves choosing the disk arrays to use, setting the configuration options on those arrays, and determining an efficient mapping of application data onto the configured system. This is a complex process because of the multitude of disk array configuration options, and the need to take into account both capacity and potentially contending I\/O performance demands when placing the data. Thus, both existing tools and administrators using rules of thumb often generate designs that are of poor quality.This article presents the\n            <jats:italic>Disk Array Designer<\/jats:italic>\n            (DAD), which is a tool that can be used both to guide administrators in their design decisions and to automate the design process. DAD uses a generalized best-fit bin packing heuristic with randomization and backtracking to search efficiently through the huge number of possible design choices. It makes decisions using device models that estimate storage system performance. We evaluate DAD's designs based on traces from a variety of database, filesystem, and e-mail workloads. We show that DAD can handle the difficult task of configuring midrange and high-end disk arrays, even with complex real-world workloads. We also show that DAD quickly generates near-optimal storage system designs, improving in both speed and quality over previous tools.\n          <\/jats:p>","DOI":"10.1145\/1113574.1113575","type":"journal-article","created":{"date-parts":[[2006,2,6]],"date-time":"2006-02-06T15:07:09Z","timestamp":1139238429000},"page":"337-374","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":56,"title":["Quickly finding near-optimal storage designs"],"prefix":"10.1145","volume":"23","author":[{"given":"Eric","family":"Anderson","sequence":"first","affiliation":[{"name":"HP Labs, Palo Alto, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Susan","family":"Spence","sequence":"additional","affiliation":[{"name":"HP Labs, Palo Alto, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ram","family":"Swaminathan","sequence":"additional","affiliation":[{"name":"HP Labs, Palo Alto, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mahesh","family":"Kallahalla","sequence":"additional","affiliation":[{"name":"DoCoMo Labs, San Jose, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qian","family":"Wang","sequence":"additional","affiliation":[{"name":"Pennsylvania State University, University Park, PA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2005,11]]},"reference":[{"volume-title":"Don't waste your storage dollars: What you need to know. Research note COM-13-1217. Gartner","author":"Allen N.","key":"e_1_2_1_1_1","unstructured":"Allen , N. 2001. Don't waste your storage dollars: What you need to know. Research note COM-13-1217. Gartner , Inc. Stanford, CT. Go online to http:\/\/www.gartner.com. Allen, N. 2001. Don't waste your storage dollars: What you need to know. Research note COM-13-1217. Gartner, Inc. Stanford, CT. Go online to http:\/\/www.gartner.com."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/502912.502915"},{"volume-title":"Simple table-based modeling of storage devices. Technical note HPL-SSP-2001-4. HP Labs","author":"Anderson E.","key":"e_1_2_1_3_1","unstructured":"Anderson , E. 2001. Simple table-based modeling of storage devices. Technical note HPL-SSP-2001-4. HP Labs , Palo Alto, CA . Go online to http:\/\/www.hpl.hp.com\/SSP\/papers\/. Anderson, E. 2001. Simple table-based modeling of storage devices. Technical note HPL-SSP-2001-4. HP Labs, Palo Alto, CA. Go online to http:\/\/www.hpl.hp.com\/SSP\/papers\/."},{"volume-title":"Proceedings of the USENIX Conference on File and Storage Technologies (FAST). USENIX","author":"Anderson E.","key":"e_1_2_1_4_1","unstructured":"Anderson , E. , Hobbs , M. , Keeton , K. , Spence , S. , Uysal , M. , and Veitch , A . 2002a. Hippodrome: Running rings around storage administration . In Proceedings of the USENIX Conference on File and Storage Technologies (FAST). USENIX , Monterey, CA, 175--188. Anderson, E., Hobbs, M., Keeton, K., Spence, S., Uysal, M., and Veitch, A. 2002a. Hippodrome: Running rings around storage administration. In Proceedings of the USENIX Conference on File and Storage Technologies (FAST). USENIX, Monterey, CA, 175--188."},{"key":"e_1_2_1_5_1","volume-title":"Ergastulum: An approach to solving the workload and device configuration problem. Go online to http:\/\/www.hpl.hp.com\/SSP\/papers\/.","author":"Anderson E.","year":"2001","unstructured":"Anderson , E. , Kallahalla , M. , Spence , S. , Swaminathan , R. , and Wang , Q . 2001 . Ergastulum: An approach to solving the workload and device configuration problem. Go online to http:\/\/www.hpl.hp.com\/SSP\/papers\/. Anderson, E., Kallahalla, M., Spence, S., Swaminathan, R., and Wang, Q. 2001. Ergastulum: An approach to solving the workload and device configuration problem. Go online to http:\/\/www.hpl.hp.com\/SSP\/papers\/."},{"volume-title":"Proceedings of the USENIX Conference on File and Storage Technologies (FAST). USENIX","author":"Anderson E.","key":"e_1_2_1_6_1","unstructured":"Anderson , E. , Swaminathan , R. , Veitch , A. , Alvarez , G. , and Wilkes , J . 2002b. Selecting RAID levels for disk arrays . In Proceedings of the USENIX Conference on File and Storage Technologies (FAST). USENIX , Monterey, CA. Anderson, E., Swaminathan, R., Veitch, A., Alvarez, G., and Wilkes, J. 2002b. Selecting RAID levels for disk arrays. In Proceedings of the USENIX Conference on File and Storage Technologies (FAST). USENIX, Monterey, CA."},{"volume-title":"Proceedings of the 5th International Workshop on Quality of Service. Kluwer","author":"Borowsky E.","key":"e_1_2_1_7_1","unstructured":"Borowsky , E. , Golding , R. , Merchant , A. , Schrier , L. , Shriver , E. , Spasojevic , M. , and Wilkes , J . 1997. Using attribute-managed storage to achieve QoS . In Proceedings of the 5th International Workshop on Quality of Service. Kluwer , Norwell, MA, 199--202. Borowsky, E., Golding, R., Merchant, A., Schrier, L., Shriver, E., Spasojevic, M., and Wilkes, J. 1997. Using attribute-managed storage to achieve QoS. In Proceedings of the 5th International Workshop on Quality of Service. Kluwer, Norwell, MA, 199--202."},{"volume-title":"Proceedings of the AFIPS National Computer Conference (NCC), S. P. Ghosh and L. Y. Liu, Eds. AFIPS Press","author":"Buzen J. P.","key":"e_1_2_1_8_1","unstructured":"Buzen , J. P. , Goldberg , R. P. , Langer , A. M. , Lentz , E. , Schwenk , H. S. , Sheetz , D. A. , and Shum , A . 1978. BEST\/1---design of a tool for computer system capacity planning . In Proceedings of the AFIPS National Computer Conference (NCC), S. P. Ghosh and L. Y. Liu, Eds. AFIPS Press , Montvale, NJ, 447--455. Buzen, J. P., Goldberg, R. P., Langer, A. M., Lentz, E., Schwenk, H. S., Sheetz, D. A., and Shum, A. 1978. BEST\/1---design of a tool for computer system capacity planning. In Proceedings of the AFIPS National Computer Conference (NCC), S. P. Ghosh and L. Y. Liu, Eds. AFIPS Press, Montvale, NJ, 447--455."},{"key":"e_1_2_1_9_1","volume-title":"Proceedings of the 18th ACM Symposium on Operating System Principles. (SOSP'01)","author":"Chase J.","year":"2034","unstructured":"Chase , J. , Anderson , D. , Thakar , P. , Vahdat , A. , and Doyle , R . 2001. Managing energy and server resources in hosting centers . In Proceedings of the 18th ACM Symposium on Operating System Principles. (SOSP'01) Chateau Lake Louise, Banff, Canada. ACM Press, New York, NY, 103--116. 10.1145\/50 2034 .502045 Chase, J., Anderson, D., Thakar, P., Vahdat, A., and Doyle, R. 2001. Managing energy and server resources in hosting centers. In Proceedings of the 18th ACM Symposium on Operating System Principles. (SOSP'01) Chateau Lake Louise, Banff, Canada. ACM Press, New York, NY, 103--116. 10.1145\/502034.502045"},{"volume-title":"Proceedings of the SIGMOD International Conference on Management of Data Seattle WA, ACM Press","author":"Chaudhuri S.","key":"e_1_2_1_10_1","unstructured":"Chaudhuri , S. and Narasayya , V. 1998. AutoAdmin \u201cWhat-if\u201d index analysis utility . In Proceedings of the SIGMOD International Conference on Management of Data Seattle WA, ACM Press , New York, NY, 367--378. 10.1145\/276304.276337 Chaudhuri, S. and Narasayya, V. 1998. AutoAdmin \u201cWhat-if\u201d index analysis utility. In Proceedings of the SIGMOD International Conference on Management of Data Seattle WA, ACM Press, New York, NY, 367--378. 10.1145\/276304.276337"},{"key":"e_1_2_1_11_1","unstructured":"Coffman Jr. E. G. Garey M. R. and Johnson D. S. 1997. Approximation algorithms for bin packing: A survey. In Approximation Algorithms for NP-Hard Problems D. Hochbaum ed PWS Publishing Boston MA 46--93.   Coffman Jr. E. G. Garey M. R. and Johnson D. S. 1997. Approximation algorithms for bin packing: A survey. In Approximation Algorithms for NP-Hard Problems D. Hochbaum ed PWS Publishing Boston MA 46--93."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(02)00120-0"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/356876.356883"},{"key":"e_1_2_1_14_1","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/BF02579456","article-title":"Bin packing can be solved within 1&plus;&epsi; in linear time","volume":"1","author":"Fernandez W.","year":"1981","unstructured":"Fernandez , W. and Lueker , G. 1981 . Bin packing can be solved within 1&plus;&epsi; in linear time . Combinatorica 1 , 4, 349 -- 355 . Fernandez, W. and Lueker, G. 1981. Bin packing can be solved within 1&plus;&epsi; in linear time. Combinatorica 1, 4, 349--55.","journal-title":"Combinatorica"},{"key":"e_1_2_1_15_1","volume-title":"Proceedings of the Human Factors in Computing Systems CHI '94 Conference","author":"Furnas G. W.","year":"1916","unstructured":"Furnas , G. W. and Zacks , J . 1994. Multitrees: Enriching and reusing hierarchical structure . In Proceedings of the Human Factors in Computing Systems CHI '94 Conference ( Boston, MA). 330--336. 10.1145\/ 1916 66.191778 Furnas, G. W. and Zacks, J. 1994. Multitrees: Enriching and reusing hierarchical structure. In Proceedings of the Human Factors in Computing Systems CHI '94 Conference (Boston, MA). 330--336. 10.1145\/191666.191778"},{"key":"e_1_2_1_16_1","unstructured":"Garey M. and Johnson D. 1979. Computers and Intractability. W. H. Freeman and Company New York NY.   Garey M. and Johnson D. 1979. Computers and Intractability. W. H. Freeman and Company New York NY."},{"key":"e_1_2_1_17_1","unstructured":"Hewlett-Packard Company. 1998. Model 30\/FC High Availability Disk Array---User's Guide. Hewlett-Packard Pub. No. A3661-90001. Hewlett-Packard Palo Alto CA.  Hewlett-Packard Company. 1998. Model 30\/FC High Availability Disk Array---User's Guide. Hewlett-Packard Pub. No. A3661-90001. Hewlett-Packard Palo Alto CA."},{"volume-title":"HP SureStore E Disk Array FC60---Advanced User's Guide. Hewlett-Packard","author":"Hewlett-Packard Company 0.","key":"e_1_2_1_18_1","unstructured":"Hewlett-Packard Company . 200 0. HP SureStore E Disk Array FC60---Advanced User's Guide. Hewlett-Packard , Palo Alto, CA . Hewlett-Packard Company. 2000. HP SureStore E Disk Array FC60---Advanced User's Guide. Hewlett-Packard, Palo Alto, CA."},{"volume-title":"HP Surestore Disk Array XP256---Configuration Guide","author":"Hewlett-Packard Company","key":"e_1_2_1_19_1","unstructured":"P Hewlett-Packard Company . 2001. HP Surestore Disk Array XP256---Configuration Guide , Chapter 4.7.5, HP e3000 Business Servers Configuration Guide. Hewlett-Packard, Palo Alto, CA. PHewlett-Packard Company. 2001. HP Surestore Disk Array XP256---Configuration Guide, Chapter 4.7.5, HP e3000 Business Servers Configuration Guide. Hewlett-Packard, Palo Alto, CA."},{"volume-title":"HP Managed Services: Delivering more storage value on demand. HP StorageWorks case study. Hewlett-Packard","author":"Hewlett-Packard Development","key":"e_1_2_1_20_1","unstructured":"Hewlett-Packard Development Company. 2003. HP Managed Services: Delivering more storage value on demand. HP StorageWorks case study. Hewlett-Packard , Palo Alto, CA . Hewlett-Packard Development Company. 2003. HP Managed Services: Delivering more storage value on demand. HP StorageWorks case study. Hewlett-Packard, Palo Alto, CA."},{"key":"e_1_2_1_21_1","volume-title":"System for managing data storage based on vector-summed size-frequency vectors for data sets, devices, and residual storage on devices. US Patent 5,345,584","author":"Hill R. A.","year":"1994","unstructured":"Hill , R. A. 1994. System for managing data storage based on vector-summed size-frequency vectors for data sets, devices, and residual storage on devices. US Patent 5,345,584 , 6 September 1994 . Hill, R. A. 1994. System for managing data storage based on vector-summed size-frequency vectors for data sets, devices, and residual storage on devices. US Patent 5,345,584, 6 September 1994."},{"key":"e_1_2_1_22_1","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1137\/0203025","article-title":"Worst case bounds for simple one-dimensional packing algorithms","volume":"3","author":"Johnson D.","year":"1974","unstructured":"Johnson , D. , Demers , A. , Ullman , J. , Garey , M. , and Graham , R. 1974 a. Worst case bounds for simple one-dimensional packing algorithms . SIAM J. Comput. 3 , 299 -- 325 . Johnson, D., Demers, A., Ullman, J., Garey, M., and Graham, R. 1974a. Worst case bounds for simple one-dimensional packing algorithms. SIAM J. Comput. 3, 299--325.","journal-title":"SIAM J. Comput."},{"key":"e_1_2_1_23_1","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1137\/0203025","article-title":"Worst-case performance bounds for simple one-dimensional packing algorithms","volume":"3","author":"Johnson D. S.","year":"1974","unstructured":"Johnson , D. S. , Demers , A. , Ullman , J. D. , Garey , M. R. , and Graham , R. L. 1974 b. Worst-case performance bounds for simple one-dimensional packing algorithms . SIAM J. Comput. 3 , 4 (Dec.), 299--325. Johnson, D. S., Demers, A., Ullman, J. D., Garey, M. R., and Graham, R. L. 1974b. Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM J. Comput. 3, 4 (Dec.), 299--325.","journal-title":"SIAM J. Comput."},{"key":"e_1_2_1_24_1","volume-title":"SODA: ACM-SIAM Symposium on Discrete Algorithms","author":"Kenyon C.","year":"1996","unstructured":"Kenyon , C. 1996 . Best-fit bin-packing with random order . In SODA: ACM-SIAM Symposium on Discrete Algorithms ( Atlanta, GA). ACM Press, New York, NY. Kenyon, C. 1996. Best-fit bin-packing with random order. In SODA: ACM-SIAM Symposium on Discrete Algorithms (Atlanta, GA). ACM Press, New York, NY."},{"key":"e_1_2_1_25_1","volume-title":"Proceedings of ACM-SIAM Symposium on Discrete Algorithms. ACM Press","author":"Kenyon C.","year":"1997","unstructured":"Kenyon , C. 1997 . Best-fit bin packing with random order . In Proceedings of ACM-SIAM Symposium on Discrete Algorithms. ACM Press , New York, NY. Kenyon, C. 1997. Best-fit bin packing with random order. In Proceedings of ACM-SIAM Symposium on Discrete Algorithms. ACM Press, New York, NY."},{"key":"e_1_2_1_26_1","unstructured":"Lamb E. 2001. Hardware spending matters. Red Herring 32--33.  Lamb E. 2001. Hardware spending matters. Red Herring 32--33."},{"volume-title":"Optimal storage configuration made easy. White paper 295","author":"Loaiza J.","key":"e_1_2_1_27_1","unstructured":"Loaiza , J. 2002. Optimal storage configuration made easy. White paper 295 . Oracle Corporation, Redwood Shores , CA. Loaiza, J. 2002. Optimal storage configuration made easy. White paper 295. Oracle Corporation, Redwood Shores, CA."},{"key":"e_1_2_1_28_1","unstructured":"Merchant A. and Alvarez G. A. 2001. Disk array models in Minerva. Tech. rep. HPL-2001-118. HP Labs. Palo Alto CA. Go online to http:\/\/www.hpl.hp.com\/techreports\/2001\/HPL-2001-118.html.  Merchant A. and Alvarez G. A. 2001. Disk array models in Minerva. Tech. rep. HPL-2001-118. HP Labs. Palo Alto CA. Go online to http:\/\/www.hpl.hp.com\/techreports\/2001\/HPL-2001-118.html."},{"key":"e_1_2_1_29_1","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1063\/1.1699114","article-title":"Equations of state calculations by fast computing machines","volume":"21","author":"Metropolis N.","year":"1953","unstructured":"Metropolis , N. , Rosenbluth , A. , Rosenbluth , M. , Teller , A. , and Teller , E. 1953 . Equations of state calculations by fast computing machines . J. Chemi. Phys. 21 , 1087 -- 1091 . Metropolis, N., Rosenbluth, A., Rosenbluth, M., Teller, A., and Teller, E. 1953. Equations of state calculations by fast computing machines. J. Chemi. Phys. 21, 1087--1091.","journal-title":"J. Chemi. Phys."},{"key":"e_1_2_1_30_1","volume-title":"Storage: From atoms to people. Keynote speech at the Conference on File and Storage Technologies (FAST).","author":"Morris R.","year":"2002","unstructured":"Morris , R. 2002 . Storage: From atoms to people. Keynote speech at the Conference on File and Storage Technologies (FAST). Morris, R. 2002. Storage: From atoms to people. Keynote speech at the Conference on File and Storage Technologies (FAST)."},{"key":"e_1_2_1_31_1","doi-asserted-by":"crossref","unstructured":"Nemhauser G. and Wolsey L. 1988. Integer and Combinatorial Optimization. John Wiley and Sons New York NY.   Nemhauser G. and Wolsey L. 1988. Integer and Combinatorial Optimization. John Wiley and Sons New York NY.","DOI":"10.1002\/9781118627372"},{"volume-title":"Proceedings of the SIGMOD international Conference on the Management of Data","author":"Patterson D.","key":"e_1_2_1_32_1","unstructured":"Patterson , D. , Gibson , G. , and Katz , R . 1988. A case for Redundant Arrays of Inexpensive Disks (RAID) . In Proceedings of the SIGMOD international Conference on the Management of Data ( Chicago, IL). ACM Press, New York, NY, 109--116. 10.1145\/50202.50214 Patterson, D., Gibson, G., and Katz, R. 1988. A case for Redundant Arrays of Inexpensive Disks (RAID). In Proceedings of the SIGMOD international Conference on the Management of Data (Chicago, IL). ACM Press, New York, NY, 109--116. 10.1145\/50202.50214"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/s007780050053"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579171"},{"volume-title":"A formalization of the attribute mapping problem. Tech. rep. HPL-SSP-95-10. HP Labs","author":"Shriver E.","key":"e_1_2_1_35_1","unstructured":"Shriver , E. 1996. A formalization of the attribute mapping problem. Tech. rep. HPL-SSP-95-10. HP Labs , Palo Alto, CA . Go online to http:\/\/www.hpl.hp.com\/SSP\/papers. Shriver, E. 1996. A formalization of the attribute mapping problem. Tech. rep. HPL-SSP-95-10. HP Labs, Palo Alto, CA. Go online to http:\/\/www.hpl.hp.com\/SSP\/papers."},{"key":"e_1_2_1_37_1","first-page":"1417","article-title":"A simplified algorithm for obtaining approximate solutions to zero-one programming problems. Manage","volume":"21","author":"Toyoda Y.","year":"1975","unstructured":"Toyoda , Y. 1975 . A simplified algorithm for obtaining approximate solutions to zero-one programming problems. Manage . Sci. 21 , 12, 1417 -- 1427 . Toyoda, Y. 1975. A simplified algorithm for obtaining approximate solutions to zero-one programming problems. Manage. Sci. 21, 12, 1417--1427.","journal-title":"Sci."},{"key":"e_1_2_1_38_1","unstructured":"Uysal M. 2004. Personal communication.  Uysal M. 2004. Personal communication."},{"key":"e_1_2_1_39_1","volume-title":"Proceedings of the 9th International Symposium on Modeling, Analysis and Simulation on Computer and Telecommunications Systems (MASCOTS","author":"Uysal M.","year":"2001","unstructured":"Uysal , M. , Alvarez , G. A. , and Merchant , A . 2001. A modular, analytical throughput model for modern disk arrays . In Proceedings of the 9th International Symposium on Modeling, Analysis and Simulation on Computer and Telecommunications Systems (MASCOTS 2001 , Cincinnati, OH). IEEE, Computer Society Press, Los, Alamitos, CA. Uysal, M., Alvarez, G. A., and Merchant, A. 2001. A modular, analytical throughput model for modern disk arrays. In Proceedings of the 9th International Symposium on Modeling, Analysis and Simulation on Computer and Telecommunications Systems (MASCOTS 2001, Cincinnati, OH). IEEE, Computer Society Press, Los, Alamitos, CA."},{"key":"e_1_2_1_40_1","unstructured":"Veitch A. and Keeton K. 2003. The Rubicon workload characterization tool. Tech. rep. HPL-SSP-2003-13. HP Labs Palo Alto CA. Go online to http:\/\/www.hpl.hp.com\/SSP\/papers.  Veitch A. and Keeton K. 2003. The Rubicon workload characterization tool. Tech. rep. HPL-SSP-2003-13. HP Labs Palo Alto CA. Go online to http:\/\/www.hpl.hp.com\/SSP\/papers."},{"volume-title":"Proceedings of the Conference on File and Storage Technologies (FAST). USENIX","author":"Ward J.","key":"e_1_2_1_41_1","unstructured":"Ward , J. , O'Sullivan , M. , Shahoumian , T. , and Wilkes , J . 2002. Appia: Automatic storage area network fabric design . In Proceedings of the Conference on File and Storage Technologies (FAST). USENIX , Monterey, CA, 203--217. Ward, J., O'Sullivan, M., Shahoumian, T., and Wilkes, J. 2002. Appia: Automatic storage area network fabric design. In Proceedings of the Conference on File and Storage Technologies (FAST). USENIX, Monterey, CA, 203--217."},{"volume-title":"Proceedings of the SIGMOD Conference","author":"Weikum G.","key":"e_1_2_1_42_1","unstructured":"Weikum , G. , Zabback , P. , and Scheuermann , P . 1991. Dynamic file allocation in disk arrays . In Proceedings of the SIGMOD Conference ( Denver, CO). ACM Press, New York, NY, 406--415. 10.1145\/115790.115859 Weikum, G., Zabback, P., and Scheuermann, P. 1991. Dynamic file allocation in disk arrays. In Proceedings of the SIGMOD Conference (Denver, CO). ACM Press, New York, NY, 406--415. 10.1145\/115790.115859"},{"key":"e_1_2_1_43_1","volume-title":"Proceedings of the International Workshop on Quality of Service","author":"Wilkes J.","year":"2001","unstructured":"Wilkes , J. 2001 . Traveling to Rome: QoS specifications for automated storage system management . In Proceedings of the International Workshop on Quality of Service ( Karlsruhe, Germany). Springer, Berlin, Germany, 75--91. Wilkes, J. 2001. Traveling to Rome: QoS specifications for automated storage system management. In Proceedings of the International Workshop on Quality of Service (Karlsruhe, Germany). Springer, Berlin, Germany, 75--91."},{"key":"e_1_2_1_44_1","volume-title":"Proceedings of the ACM SIGMETRICS Conference","author":"Wolf J.","year":"1989","unstructured":"Wolf , J. 1989 . The placement optimization program: A practical solution to the disk file assignment problem . In Proceedings of the ACM SIGMETRICS Conference ( Berkeley, CA). ACM Press, New York, NY, 1--10. 10.1145\/75108.75373 Wolf, J. 1989. The placement optimization program: A practical solution to the disk file assignment problem. In Proceedings of the ACM SIGMETRICS Conference (Berkeley, CA). ACM Press, New York, NY, 1--10. 10.1145\/75108.75373"}],"container-title":["ACM Transactions on Computer Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1113574.1113575","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1113574.1113575","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T22:43:23Z","timestamp":1750286603000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1113574.1113575"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,11]]},"references-count":43,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2005,11]]}},"alternative-id":["10.1145\/1113574.1113575"],"URL":"https:\/\/doi.org\/10.1145\/1113574.1113575","relation":{},"ISSN":["0734-2071","1557-7333"],"issn-type":[{"type":"print","value":"0734-2071"},{"type":"electronic","value":"1557-7333"}],"subject":[],"published":{"date-parts":[[2005,11]]},"assertion":[{"value":"2005-11-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}