[gupu11] Jorge Guerra, Himabindu Pucha, Joseph S. Glider, Wendy Belluomini, and Raju Rangaswami. Cost effective storage using extent based dynamic tiering. In Proc. USENIX Conf. on File and Storage Technologies, pages 273-286, February 2011. [ bib | .pdf | .pdf ]
Includes a configuration advisor and a run-time tiering mechanism. The advisor uses a storage workload trace to estimate the capacity required in each tier during each time period, assuming that the run-time mechanism is moving each extent to the lowest cost tier that can satisfy the extent's I/O requirements during each epoch. The advisor recommends provisioning according to the maximum demand at each tier over all epochs. Epochs are assumed to be minutes/hours in duration. At run-time, a dynamic tier manager adjusts the placement of extents after each epoch. It choose a tier for each extent that will minimize power consumption, amont tiers that can satisfy the performance extent's performance demands. Within a tier, it also assigns extents to specific devices, attempting to consolidate so that devices can be powered down. Necessary migrations are then scheduled to run gradually.
[babo09] Shivnath Babu, Nedyalko Borisov, Sandeep Uttamchandani, Ramani Routray, and Aameek Singh. DIADS: Addressing the "my-problem-or-yours" syndrome with integrated san and database diagnosis. In Proc. USENIX Conference on File and Storage Technologies (FAST'09), 2009. [ bib | .pdf | .pdf ]
Describes a system that uses database query execution plans, storage layout and storage system configuration to attempt to pinpoint the cause of performance problems (e.g., slow queries) in a DBMS plus storage system stack.
[guah09] Ajay Gulati, Irfan Ahmad, and Carl A. Waldspurger. PARDA: Proportional allocation of resources for distributed storage access. In Proc. USENIX Conference on File and Storage Technologies (FAST'09), 2009. [ bib | .pdf | .pdf ]
Mechanism for proportional allocation of storage server bandwidth among multiple storage clients. Each client observes server response times to detect overload conditions, and then throttles it request stream by an amount determined by the share it expects to receive.
[solu09] Gokul Soundararajan, Daniel Lupei, Saeed Ghanbari, Adrian Daniel Popescu, Jin Chen, and Cristiana Amza. Dynamic resource allocation for database servers running on virtual storage. In Proc. USENIX Conference on File and Storage Technologies (FAST'09), 2009. [ bib | .pdf ]
Considers how to apportion database and storage server buffer cache space and storage system bandwidth across multiple workloads.
[guah08] Ajay Gulati and Irfan Ahmad. Towards distributed storage resource management using flow control. In Int'l Workshop on Storage and I/O Virtualization, Performance, Energy, Evaluation and Dependability (SPEED'08), February 2008. [ bib | .pdf | .pdf ]
[somi08] Gokul Soundararajan, Madalin Mihailescu, and Cristiana Amza. Context-aware prefetching at the storage server. In Proc. USENIX Annual Technical Conference, pages 377-390, 2008. [ bib | .pdf | .pdf ]
[qiiy06] Lin Qiao, Balakrishna R. Iyer, Divyakant Agrawal, and Amr El Abbadi. Automated storage management with qos guarantee in large-scale virtualized storage systems. Bulletin of the IEEE Technical Committee on Data Engineering, 29(3):47-54, September 2006. [ bib | .ps | .pdf ]
[qiag06] Lin Qiao, Divyakant Agrawal, Amr El Abbadi, and Balakrishna R. Iyer. Pulsatingstore: An analytic framework for automated storage management. In Proc. International Conference on Data Engineering Workshops, Workshop on Self-Managing Database Systems (SMDB'06), page 1213, 2006. [ bib | .pdf ]
[qiiy06b] Lin Qiao, Balakrishna R. Iyer, Divyakant Agrawal, and Amr El Abbadi. Automated storage management with qos guarantees. In Proc. International Conference on Data Engineering (ICDE'06), page 150, 2006. [ bib | .pdf ]
[mang05] Radhakrishnan Manga. Database layout with Data ONTAP. Technical Report TR-3411, Network Applicance Corp., September 2005. [ bib | .pdf | .pdf ]
[ansp05] Eric Anderson, Susan Spence, Ram Swaminathan, Mahesh Kallahalla, and Qian Wang. Quickly finding near-optimal storage designs. ACM Transactions on Computer Systems, 23(4):337-374, 2005. [ bib | DOI | .pdf ]
[liiy05] Lin Qiao, Balakrishna R Iyer, Divyakant Agrawal, and Amr El Abbadi. SVL: Storage virtualization engine leveraging DBMS technology. In Proceedings of the 21st International Conference on Data Engineering (ICDE'05), pages 1048-1059, 2005. [ bib | .pdf ]
[qiiy05] Lin Qiao, Balakrishna R. Iyer, Divyakant Agrawal, Amr El Abbadi, and Sandeep Uttamchandani. PULSTORE: Automated storage management with QoS guarantee. In Proc. International Conference on Autonomic Computing (ICAC'05), pages 302-303, 2005. [ bib | .pdf ]
[qiiy05b] Lin Qiao, Balakrishna R Iyer, Divyakant Agrawal, Amr El Abbadi, and Sandeep Uttamchandani. PULSTORE: Automated storage management with QoS guarantee in large-scale virtualized storage systems. This is a longer unpublished version of the ICAC'05 publication [qiiy05]., 2005. [ bib | .pdf ]
[utyi05] Sandeep Uttamchandani, Li Yin, Guillermo A. Alvarez, John Palmer, and Gul Agha. CHAMELEON: A self-evolving, fully-adaptive resource arbitrator for storage systems. In Proc. USENIX 2005 Annual Technical Conference, pages 75-88, 2005. [ bib | .pdf | .pdf ]
[wech04] Wei Jin, Jeffrey S. Chase, and Jasleen Kaur. Interposed proportional sharing for a storage service utility. In Proc. International Conference on Measurements and Modeling of Computer Systems (SIGMETRICS'04), pages 37-48, June 2004. [ bib | .pdf ]
[dech03] Murthy Devarakonda, David Chess, Ian Whalley, Alla Segal, Pawan Goyal, Aamer Sachedina, Keri Romanufa, Ed Lassettre, William Tetzlaff, and Bill Arnold. Policy-based autonomic storage allocation. In Proc. 14th IFIP/IEEE International Workshop on Distributed Systems: Operations and Management (DSOM), number 2867 in Lecture Notes in Computer Science, pages 143-154. Springer-Verlag, 2003. [ bib | .pdf ]
[goja03] Pawan Goyal, Divyesh Jadav, Dharmendra S. Modha, and Renu Tewari. CacheCOW: QoS for storage system caches. In Eleventh International Workshop on Quality of Service (IWQoS 03), 2003. [ bib | CiteSeer | .pdf ]
Allocation of buffer space in the face of a multi-class workload with QoS (mean response time) requirements for each class. Dynamic algorithms.
[lume03] Christopher Lumb, Arif Merchant, and Guillermo Alvarez. Facade: virtual storage devices with performance guarantees. In Proceedings of the 2nd USENIX Conference on File and Storage Technologies, pages 131-144, 2003. [ bib | CiteSeer | .pdf ]
Enforcement of SLOs for disk. SLOs are load/response time curves for reads and writes. Enforcement mechanism throttles requests from hosts to storage devices. Assumes offered loads are feasible for the underlying storage devices. Uses real-time scheduling (EDF) to put requests into device queues so that deadlines targets are met. Device queue lengths are managed with feedback control.
[anho02] Eric Anderson, Michael Hobbs, Kimberly Keeton, Susan Spence, Mustafa Uysal, and Alistair Veitch. Hippodrome: running circles around storage administration. In Conference on File and Storage Technology (FAST'02), pages 175-188, January 2002. [ bib | .pdf | .pdf ]
Given workload, configure block-level storage system. Workload is described as stores (logically contiguous set of blocks) and streams (details in [veke01]). Workload analysis tool can produce stream-based workload description from a request trace. A configuration consists of number of disks, grouping of disks into arrays, division of arrays into logical units, disk controller and cache settings, and a mapping of the stores in the workload onto the logical units. Includes a migration component to move the storage system between configurations. Details of configuration finder are in [anka01]. Iterative approach does not assume that workload remains constant as the system configuration changes.
[shvi02] Prashant J. Shenoy and Harrick M. Vin. Cello: A disk scheduling framework for next generation operating systems. Real-Time Systems, 22(1-2):9-48, 2002. [ bib ]
[waos02] Julie Ward, Michael O'Sullivan, Troy Shahoumian, and John Wilkes. Appia: automatic storage area network design. In Conference on File and Storage Technology (FAST'02), pages 203-217, January 2002. [ bib | .pdf | .pdf ]
[anka01] E. Anderson, M. Kallahalla, S. Spence, R. Swaminathan, and Q. Wang. Ergastulum: quickly finding near-optimal storage system designs. Technical Report HPL-SSP-2001-5, HP Laboratories, July 2001. [ bib | .pdf | .pdf ]
Input includes a workload description in terms of, logical stores and streams of accesses to the stores, a description of the available physical devices, a set of constraint on how those devices may be configured, maximum utilizations, or total system cost, and finally a cost function that can be used to compare alternative configurations. The output includes a grouping of devices into RAID logical units (LUs) and settings for configuration parameters, such as stripe sizes. Search through the design space is heuristic. Cost functions are externally defined, so the system cannot exploit their structure to improve the search.
[wilk01] John Wilkes. Traveling to Rome: QoS specifications for automated storage system management. In Proc. Intl. Workshop on Quality of Service (IWQoS'2001), number 2092 in Lecture Notes in Computer Science, pages 75-91. Springer-Verlag, June 2001. [ bib | CiteSeer | .pdf ]
Provides an historical overview of an HP effort in automated storage system management. Provides examples of specification language used to describe workloads and system configurations.
[albo01] Guillermo A. Alvarez, Elizabeth Borowsky, Susie Go, Theodore H. Romer, Ralph Becker-Szendy, Richard Golding, Arif Merchant, Mirjana Spasojevic, Alistair Veitch, and John Wilkes. Minerva: An automated resource provisioning tool for large-scale storage systems. ACM Transactions on Computer Systems, 19(4):483-518, 2001. [ bib | .ps.Z | .ps.Z ]
[brbr99] John L. Bruno, Jose Carlos Brustoloni, Eran Gabber, Banu Ozden, and Abraham Silberschatz. Disk scheduling with quality of service guarantees. In IEEE International Conference on Multimedia Computing and Systems (ICMCS 1999), Vol. 2, pages 400-405, 1999. [ bib | CiteSeer | .pdf ]