Using utility to provision storage systems

FAST 2008 - 6th USENIX Conference on File and Storage Technologies

Volumn , Issue , 2008, Pages 313-328

  Strunk, John D ^a   Thereska, Eno ^b   Faloutsos, Christos ^a   Ganger, Gregory R ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b MICROSOFT RESEARCH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMMERCE; COSTS; DATA PRIVACY; DIGITAL STORAGE; ECONOMIC AND SOCIAL EFFECTS; SALES;

COST BENEFITS; MINIMUM COST; PURCHASE COST; PURCHASING DECISIONS; RE-TURN-ON; STORAGE SYSTEMS; SYSTEM METRICS; UTILITY FUNCTIONS;

COST BENEFIT ANALYSIS;

EID: 85091121431     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (39)

1. M. Abd-El-Malek, W. V. Courtright II, C. Cranor, G. R. Ganger, J. Hendricks, A. J. Klosterman, M. Mesnier, M. Prasad, B. Salmon, R. R. Sambasivan, S. Sinnamohideen, J. D. Strunk, E. Thereska, M. Wachs, and J. J. Wylie. Ursa Minor: Versatile cluster-based storage. In Conference on File and Storage Technologies, pages 59–72. USENIX Association, 2005. ISBN 978–1–931971–39–3.
2. G. A. Alvarez, J. Wilkes, E. Borowsky, S. Go, T. H. Romer, R. Becker-Szendy, R. Golding, A. Merchant, M. Spasojevic, and A. Veitch. Minerva: An automated resource provisioning tool for large-scale storage systems. ACM Transactions on Computer Systems, 19(4):483–518, November 2001. ISSN 0734–2071. doi: 10.1145/502912. 502915.
3. K. Amiri and J. Wilkes. Automatic design of storage systems to meet availability requirements. Technical Report HPL–SSP–96–17, Hewlett-Packard Laboratories, August 1996.
4. E. Anderson. Simple table-based modeling of storage devices. Technical Report HPL–SSP–2001–4, Hewlett-Packard Laboratories, July 2001.
5. E. Anderson, M. Kallahalla, S. Spence, R. Swaminathan, and Q. Wang. Ergastulum: Quickly finding near-optimal storage system designs. Technical Report HPL–SSP–2001–05, Hewlett-Packard Laboratories, 2001.
6. E. Anderson, M. Hobbs, K. Keeton, S. Spence, M. Uysal, and A. Veitch. Hippodrome: Running circles around storage administration. In Conference on File and Storage Technologies, pages 175–188. USENIX Association, 2002. ISBN 978–1–880446–03–4.
7. E. Anderson, S. Spence, R. Swaminathan, M. Kallahalla, and Q. Wang. Quickly finding near-optimal storage designs. ACM Transactions on Computer Systems, 23(4):337–374, November 2005. ISSN 0734–2071. doi: 10.1145/1113574.1113575.
8. A. AuYoung, L. Grit, J. Wiener, and J. Wilkes. Service contracts and aggregate utility functions. In International Symposium on High-Performance Distributed Computing, pages 119–131. IEEE, 2006. ISBN 978–1–4244–0307–3. doi: 10.1109/HPDC.2006.1652143.
9. I. D. Baev and R. Rajaraman. Approximation algorithms for data placement in arbitrary networks. In Symposium on Discrete Algorithms, pages 661–670. Society for Industrial and Applied Mathematics, 2001. ISBN 978–0–89871–490–6.
10. E. Borowsky, R. Golding, A. Merchant, L. Schreier, E. Shriver, M. Spasojevic, and J. Wilkes. Using attribute-managed storage to achieve QoS. In International Workshop on Quality of Service, pages 203–207. IFIP, 1997. ISBN 978–0–412–80940–8.
11. W. A. Burkhard and J. Menon. Disk array storage system reliability. In Symposium on Fault-Tolerant Computer Systems, pages 432–441. IEEE, 1993. ISBN 978–0–8186–3680–6. doi: 10.1109/FTCS.1993.627346.
12. L. W. Dowdy and D. V. Foster. Comparative models of the file assignment problem. ACM Computing Surveys, 14(2):287–313, June 1982. ISSN 0360–0300. doi: 10. 1145/356876.356883.
13. H. Feltl and G. R. Raidl. An improved hybrid genetic algorithm for the generalized assignment problem. In Symposium on Applied Computing, pages 990–995. ACM Press, 2004. ISBN 978–1–58113–812–2. doi: 10.1145/967900.968102.
14. S. Gaonkar, K. Keeton, A. Merchant, and W. H. Sanders. Designing dependable storage solutions for shared application environments. In International Conference on Dependable Systems and Networks, pages 371–382. IEEE Computer Society, 2006. ISBN 978–0–7695–2607–2. doi: 10.1109/DSN.2006.27.
15. R. Geist and K. Trivedi. An analytic treatment of the reliability and performance of mirrored disk subsystems. In Symposium on Fault-Tolerant Computer Systems, pages 442–450. IEEE, 1993. ISBN 978–0–8186–3680–6. doi: 10.1109/FTCS.1993.627347.
16. J. P. Gelb. System-managed storage. IBM Systems Journal, 28(1):77–103, 1989. ISSN 0018–8670.
17. G. R. Goodson, J. J. Wylie, G. R. Ganger, and M. K. Reiter. Efficient Byzantine-tolerant erasure-coded storage. In International Conference on Dependable Systems and Networks, pages 135–144. IEEE Computer Society, 2004. ISBN 978–0–7695–2052–0. doi: 10.1109/DSN. 2004.1311884.
18. N. Gunther and P. Harding. PDQ (pretty damn quick) version 4.2. http://www.perfdynamics.com/Tools/PDQ.html, 2007.
19. D. E. Irwin, L. E. Grit, and J. S. Chase. Balancing risk and reward in a market-based task service. In International Symposium on High-Performance Distributed Computing, pages 160–169. IEEE, 2004. ISBN 978–0–7695–2175–6. doi: 10.1109/HPDC.2004.1323519.
20. R. L. Keeney and H. Raiffa. Decisions with Multiple Objectives: Preferences and Value Tradeoffs. Cambridge University Press, 1993. ISBN 978–0–521–43883–4.
21. K. Keeton, C. Santos, D. Beyer, J. Chase, and J. Wilkes. Designing for disasters. In Conference on File and Storage Technologies, pages 59–72. USENIX Association, 2004. ISBN 978–1–931971–19–5.
22. K. Keeton, D. Beyer, E. Brau, A. Merchant, C. Santos, and A. Zhang. On the road to recovery: Restoring data after disasters. In European Systems Conference, pages 235–248. ACM Press, 2006. doi: 10.1145/ 1217935.1217958.
23. J. O. Kephart and W. E. Walsh. An artificial intelligence perspective on autonomic computing policies. In International Workshop on Policies for Distributed Systems and Networks, pages 3–12. IEEE, 2004. ISBN 978–0–7695–2141–1. doi: 10.1109/POLICY.2004.1309145.
24. M. Litzkow, M. Livny, and M. Mutka. Condor - a hunter of idle workstations. In International Conference on Distributed Computing Systems, pages 104–111. IEEE, 1988. ISBN 978–0–8186–0865–0. doi: 10.1109/DCS.1988. 12507.
25. M. P. Mesnier, M. Wachs, R. R. Sambasivan, A. Zheng, and G. R. Ganger. Modeling the relative fitness of storage. In Conference on Measurement and Modeling of Computer Systems, pages 37–48. ACM Press, 2007. doi: 10.1145/1254882.1254887.
26. T. M. Mitchell. Machine Learning. McGraw-Hill, 1997. ISBN 978–0–07–042807–2.
27. J.-F. Pâris, T. J. E. Schwarz, and D. D. E. Long. Evaluating the reliability of storage systems. Technical Report UH–CS–06–08, Department of Computer Science, University of Houston, June 2006.
28. E. Pinheiro, W.-D. Weber, and L. A. Barroso. Failure trends in a large disk drive population. In Conference on File and Storage Technologies, pages 17–28. USENIX Association, 2007. ISBN 978–1–931971–50–8.
29. Y. Saito, S. Frølund, A. Veitch, A. Merchant, and S. Spence. FAB: building distributed enterprise disk arrays from commodity components. In Architectural Support for Programming Languages and Operating Systems, pages 48–58. ACM Press, 2004. doi: 10.1145/ 1024393.1024400.
30. B. Schroeder and G. A. Gibson. Disk failures in the real world: What does an MTTF of 1,000,000 hours mean to you? In Conference on File and Storage Technologies, pages 1–16. USENIX Association, 2007. ISBN 978–1–931971–50–8.
31. E. St.Pierre. ILM: Tiered services & the need for classification. Technical tutorial, Storage Networking Industry Association, April 2007. http://www.snia.org/education/tutorials/2007/spring/ data-management/ILM-Tiered_Services.pdf.
32. X. Tang and J. Xu. On replica placement for QoS-aware content distribution. In Joint Conference of the IEEE Computer and Communications Societies, volume 2, pages 806–815. IEEE, 2004. ISBN 978–0–7803–8355–5.
33. E. Thereska, M. Abd-El-Malek, J. J. Wylie, D. Narayanan, and G. R. Ganger. Informed data distribution selection in a self-predicting storage system. In International Conference on Autonomic Computing, pages 187–198. IEEE, 2006. ISBN 978–1–4244–0175–8.
34. E. Varki, A. Merchant, J. Xu, and X. Qiu. Issues and challenges in the performance analysis of real disk arrays. IEEE Transactions on Parallel and Distributed Systems, 15(6):559–574, June 2004. ISSN 1045–9219. doi: 10. 1109/TPDS.2004.9.
35. W. E. Walsh, G. Tesauro, J. O. Kephart, and R. Das. Utility functions in autonomic systems. In International Conference on Autonomic Computing, pages 70–77. IEEE, 2004. ISBN 978–0–7695–2114–5. doi: 10.1109/ICAC. 2004.1301349.
36. C. Weddle, M. Oldham, J. Qian, A.-I. A. Wang, P. Reiher, and G. Kuenning. PARAID: A gear-shifting power-aware RAID. ACM Transactions on Storage, 3(3):13, October 2007. ISSN 1553–3077. doi: 10.1145/1289720.1289721.
37. J. Wilkes. Traveling to Rome: QoS specifications for automated storage system management. In International Workshop on Quality of Service, pages 75–91. IFIP, 2001. ISBN 978–3–540–42217–4.
38. J. Wolf. The Placement Optimization Program: A practical solution to the disk file assignment problem. Performance Evaluation Review, 17(1):1–9, May 1989. ISSN 0163–5999. doi: 10.1145/75108.75373.
39. Q. Zhu, Z. Chen, L. Tan, Y. Zhou, K. Keeton, and J. Wilkes. Hibernator: Helping disk arrays sleep through the winter. In Symposium on Operating System Principles, pages 177–190. ACM Press, 2005. ISBN 978–1–59593–079–8. doi: 10.1145/1095810.1095828.