Adaptive Multi-copy Layout Algorithm Based on Mass Storage System
暂无分享,去创建一个
[1] S.A. Brandt,et al. CRUSH: Controlled, Scalable, Decentralized Placement of Replicated Data , 2006, ACM/IEEE SC 2006 Conference (SC'06).
[2] David R. Karger,et al. Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web , 1997, STOC '97.
[3] Friedhelm Meyer auf der Heide,et al. Dynamic and Redundant Data Placement , 2007, 27th International Conference on Distributed Computing Systems (ICDCS '07).
[4] Ethan L. Miller,et al. A fast algorithm for online placement and reorganization of replicated data , 2003, Proceedings International Parallel and Distributed Processing Symposium.
[5] Alan M. Frieze,et al. Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION , 1995, IPCO.
[6] Christian Scheideler,et al. Compact, adaptive placement schemes for non-uniform requirements , 2002, SPAA '02.
[7] Ben Y. Zhao,et al. OceanStore: an architecture for global-scale persistent storage , 2000, SIGP.
[8] Ethan L. Miller,et al. Replication under scalable hashing: a family of algorithms for scalable decentralized data distribution , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..
[9] Antony I. T. Rowstron,et al. Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility , 2001, SOSP.
[10] Efficient Reliable Internet Storage ∗ , 2004 .
[11] David R. Karger,et al. Wide-area cooperative storage with CFS , 2001, SOSP.
[12] Carlos Maltzahn,et al. RADOS: a scalable, reliable storage service for petabyte-scale storage clusters , 2007, PDSW '07.