LH*RS: a high-availability scalable distributed data structure using Reed Solomon Codes
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
A Comprehensive Analytical Performance Model for Disk Devices under Random Workloads
IEEE Transactions on Knowledge and Data Engineering
A Fast Algorithm for Online Placement and Reorganization of Replicated Data
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Farsite: federated, available, and reliable storage for an incompletely trusted environment
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Hi-index | 0.00 |
We present a new SAN architecture by introducing the advantage of clustering technology into traditional SAN system, and discuss the implement of this system. Furthermore, a mathematical model and the corresponding algorithm are developed for representing related backup task. A scheduling algorithm is also developed on the basis of the quasi ordering for related backup task in timing submittal. Experiment results show that this algorithm can improve the performance of scheduling and executing related backup tasks.