SPREAD: An adaptive scheme for redundant and fair storage in dynamic heterogeneous storage systems

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2008, Pages 1135-1144

  Mense, Mario ^a   Scheideler, Christian ^b  

^a UNIVERSITY OF PADERBORN   (Germany)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STORAGE; HASH TABLES; HIGH PROBABILITY; STORAGE DEVICES; STORAGE SYSTEMS;

DATA STORAGE EQUIPMENT;

EID: 58449084409     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. RS: A high-availability scalable distributed data structure using reed Solomon codes. In SIGMOD Conference, pages 237-248, 2000.
2. A. Brinkmann, S. Effert, F. M. auf der Heide, and C. Scheideler. Dynamic and redundant data placement. In Proc. of the IEEE International Conference on Distributed Computing Systems (ICDCS), 2007.
3. A. Brinkmann, K. Salzwedel, and C. Scheideler. Efficient, distributed data placement strategies for storage area networks. In Proc. of the 12th ACM Symposium on Parallel Algorithms and Architectures (SPAA'00), pages 119-128, 2000.
4. A. Brinkmann, K. Salzwedel, and C. Scheideler. Compact, adaptive placement schemes for non-uniform distribution requirements. In Proc. of the 14th ACM Symposium on Parallel Algorithms and Architectures (SPAA'02), pages 53-62, 2002.
5. R. J. Enbody and H. C. Du. Dynamic hashing schemes. ACM Comput. Surv., 20(2):850-113, 1988.
6. R. Honicky and E. Miller. A fast algorithm for online placement and reorganization of replicated data. 2003.
7. R. J. Honicky and E. L. Miller. Replication Under Scalable Hashing: A Family of Algorithms for Scalable Decentralized Data Distribution. In Proceedings of the 18th IPDPS Conference, 2004.
8. D. Karger, E. Lehman, T. Leighton, M. Levine, D. Lewin, and R. Panigrahy. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web. In Proc. of the 29th ACM Symposium on Theory of Computing, pages 654-663, 1997.
9. * schemes with scalable availability. Technical Report RJ 10121 (91937), IBM Research, Almaden Center, May 1998.
10. * schemes with mirroring. In Conference on Cooperative Information Systems, pages 196-205, 1996.
11. * - a scalable, distributed data structure. ACM Trans. Database Syst., 21(4):480-525, 1996.
12. G: A high-availability scalable distributed data structure by record grouping. IEEE Transactions on Knowledge and Data Engineering, 14(4):923-927, 2002.
13. C. McDiarmid. On the method of bounded differences. In J. Siemons, editor, Surveys in Combinatorics. London Mathematical Society Lecture Note Series 141, Cambridge University Press, 1989.
14. C. McDiarmid. Concentration. In M. Habib, C. Mc- Diarmid, J. Ramirez-Alfonsin, and B. Reed, editors, Probabilistic Methods for Algorithmic Discrete Mathematics, pages 195-247. Springer Verlag, Berlin, 1998.
15. P. Sanders. Reconciling simplicity and realism in parallel disk models. In Proc. of the 12th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 67-76. SIAM, Philadelphia, PA, 2001.
16. C. Schindelhauer and G. Schomaker. Weighted distributed hash tables. In SPAA '05: Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures, pages 218-227, New York, NY, USA, 2005. ACM Press.