|
Abstract : |
At the heart of any configuration or capacity planning algorithm for storage systems, there lies a "what if" question: given a device and a set of workloads accessing data on the device, will the quality of service requirement for each workload be satisfied? This is, in general, a hard question to answer because of the complexity of workloads in real life. In this paper, we consider QoS bounds on the 95th percentile of response time and demonstrate an approximate method to verify that the QoS requirement is satisfied for a complex and fairly general set of workloads, including workloads with phasing (on/off behavior) and correlations with other workloads. 1, |
