.png){kind=icon}
Return
Designing Dependable Storage Solutions for Shared Application Environments
.png){kind=icon}
OA
AI
DOI：10.1109/TDSC.2008.38.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 architects typically use ad hoc techniques, often resulting in overengineered expensive solutions or underprovisioned 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 intelligent exploration of 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 produces designs that cost up to two times less in initial outlays and expected data penalties than the designs produced by an emulated human design process. Additionally, we compare our design tool to a random search heuristic and a genetic algorithm metaheuristic, and show that our approach consistently produces better designs for the cases we have studied. Finally, we study the sensitivity of our design tool to several input parameters.
Keywords:
Data protection techniques
design space exploration
discrete-event simulation
genetic algorithm
search heuristic
storage system design
Journal
IF:
7.5
Papers:
2.6K
Citations:
9.6K
Organization
Cited Papers
ShareSaveTwo Distinct Ferritin-like Molecules in Pseudomonas aeruginosa: The Product of the bfrA Gene Is a Bacterial Ferritin (FtnA) and Not a Bacterioferritin (Bfr).png)
BiochemistryOAAI
BiochemistryIF0
OAAIShareSaveShareSaveShareSaveOptimization by direct search: New perspectives on some classical and modern methodsSIAM REVIEW
OAAI
SIAM REVIEWIF6.1
OAAIShareSave
View more