International Conference on Dependable Systems and Networks (DSN'06) (2006)
June 25, 2006 to June 28, 2006
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/DSN.2006.27
Shravan Gaonkar , University of Illinois at Urbana-Champaign
Kimberly Keeton , Hewlett Packard Labs, Palo Alto, California
Arif Merchant , Hewlett Packard Labs, Palo Alto, California
William H. Sanders , University of Illinois at Urbana-Champaign
The costs of data loss and unavailability can be large, so businesses use many data protection techniques, such as remote mirroring, snapshots and backups, to guard against failures. Choosing an appropriate combination of techniques is difficult because there are numerous approaches for protecting data and allocating resources. Storage system designers typically use ad hoc techniques, often resulting in over-engineered, expensive solutions or under-provisioned, inadequate ones. In contrast, this paper presents a principled, automated approach for designing dependable storage solutions for multiple applications in shared environments. Our contributions include search heuristics for intelligently exploring the large design space and modeling techniques for capturing interactions between applications during recovery. Using realistic storage system requirements, we show that our design tool can produce designs that cost up to 3X less in initial outlays and expected data penalties than the designs produced by an emulated human design process.
A. Merchant, S. Gaonkar, K. Keeton and W. H. Sanders, "Designing dependable storage solutions for shared application environments," International Conference on Dependable Systems and Networks (DSN'06)(DSN), Philadelphia, Pennsylvania, 2006, pp. 371-382.