MINERVA: An automated resource provisioning tool for large-scale storage systems

被引:104
作者
Alvarez, GA [1 ]
Borowsky, E [1 ]
Go, S [1 ]
Romer, TH [1 ]
Becker-Szendy, R [1 ]
Golding, R [1 ]
Merchant, A [1 ]
Spasojevic, M [1 ]
Veitch, A [1 ]
Wilkes, J [1 ]
机构
[1] Hewlett Packard Labs, Palo Alto, CA 94304 USA
来源
ACM TRANSACTIONS ON COMPUTER SYSTEMS | 2001年 / 19卷 / 04期
关键词
algorithms; performance; management; disk array; RAID; automatic design;
D O I
10.1145/502912.502915
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Enterprise-scale storage systems, which can contain hundreds of host computers and storage devices and up to tens of thousands of disks and logical volumes, are difficult to design. The volume of choices that need to be made is massive, and many choices have unforeseen interactions. Storage system design is tedious and complicated to do by hand, usually leading to solutions that are grossly over-provisioned, substantially under-performing or, in the worst case, both. To solve the configuration nightmare, we present MINERVA: a suite of tools for designing storage systems automatically. MINERVA uses declarative specifications of application requirements and device capabilities; constraint-based formulations of the various sub-problems; and optimization techniques to explore the search space of possible solutions. This paper also explores and evaluates the design decisions that went into MINERVA, using specialized micro- and macro-benchmarks. We show that MINERVA can successfully handle a workload with substantial complexity (a decision-support database benchmark). MINERVA created a 16-disk design in only a few minutes that achieved the same performance as a 30-disk system manually designed by human experts. Of equal importance, MINERVA was able to predict the resulting system's performance before it was built.
引用
收藏
页码:483 / 518
页数:36
相关论文
共 25 条
[1]  
*3COM CORP, 1996, GIG ETH COM AG
[2]  
[Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness
[3]  
[Anonymous], ACM SURV
[4]  
*ANSI, 1996, X32721996 ANSI
[5]  
Awerbuch B., 1993, Proceedings of the Twenty-Fifth Annual ACM Symposium on the Theory of Computing, P164, DOI 10.1145/167088.167142
[6]  
BOROWSKY E, 1997, P 5 INT WORKSH QUAL
[7]   A genetic algorithm for the generalised assignment problem [J].
Chu, PC ;
Beasley, JE .
COMPUTERS & OPERATIONS RESEARCH, 1997, 24 (01) :17-23
[8]  
Coffman E.G., 1984, Algorithm Design for Computer System Design, P49
[9]   A SIMULATED ANNEALING APPROACH TO THE MULTICONSTRAINT ZERO-ONE KNAPSACK-PROBLEM [J].
DREXL, A .
COMPUTING, 1988, 40 (01) :1-8
[10]   SYSTEM-MANAGED STORAGE [J].
GELB, JP .
IBM SYSTEMS JOURNAL, 1989, 28 (01) :77-103