A fast algorithm for online placement and reorganization of replicated data

Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2003

Volumn , Issue , 2003, Pages

  Honicky, R J ^a   Miller, Ethan L ^a  

^a University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DISTRIBUTED PARAMETER NETWORKS; NETWORK MANAGEMENT;

CENTRAL SERVERS; DATA DISTRIBUTION; FAST ALGORITHMS; GLOBAL CONFIGURATION; OBJECT REPLICATION; PERMIT SYSTEMS; REPLICATED DATA; STORAGE SYSTEMS;

DIGITAL STORAGE;

EID: 84947268357     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2003.1213151     Document Type: Conference Paper

References (27)

1. A. Adya, W . J. Bolosky, M. Castro, R. Chaiken, G. Cermak, J. R. Douceur, J. Howell, J. R. Lorch, M. Theimer, and R. Wattenhofer. FARSITE: Federated, a vailable, and reliable storage for an incompletely trusted environment. In Proceedings of the 5th Symposium on Operating Systems Design and Implementation (OSDI), Boston, MA, Dec. 2002. USENIX.
2. Y. Breitbart, R. Vingralek, and G. Weikum. Load control in scalable distributed file structures. Distributed and Parallel Databases, 4(4):319-354, 1996.
3. A. Brinkmann, K. Salzwedel, and C. Scheideler. Efficient, distributed data placement strategies for storage area networks. In Proceedings of the 12th ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 119-128. ACM Press, 2000. Extended Abstract.
4. A. Brinkmann, K. Salzwedel, and C. Scheideler. Compact, adaptive placement schemes for non-uniform capacities. In Proceedings of the 14th ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 53-62, Winnipeg, Manitoba, Canada, Aug. 2002.
5. S.-C. Chau and A. W.-C. Fu. A gracefully degradable declustered RAID architecture. Cluster Computing Journal, 5(1):97-105, 2002.
6. P. M. Chen, E. K. Lee, G. A. Gibson, R. H. Katz, and D. A. Patterson. RAID: High-performance, reliable secondary storage. ACM Computing Surveys, 26(2), June 1994.
7. I. Clarke, O. Sandberg, B. Wiley, and T. W. Hong. Freenet: A distributed anonymous information storage and retrieval system. Lecture Notes in Computer Science, 2009:46+, 2001.
8. P. D. Coddington. Random number generators for parallel computers. NHSE Review, 1(2), 1996.
9. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms, Second Edition. MIT Press, Cambridge, Massachusetts, 2001.
10. F. Dabek, M. F. Kaashoek, D. Karger, R. Morris, and I. Stoica. Wide-area cooperative storage with CFS. In Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP '01), pages 202-215, Banff, Canada, Oct. 2001. ACM.
11. G. A. Gibson, D. F. Nagle, K. Amiri, J. Butler, F. W. Chang, H. Gobioff, C. Hardin, E. Riedel, D. Rochberg, and J. Zelenka. A cost-effective, high-bandwidth storage architecture. In Proceedings of the 8th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS), pages 92-103, San Jose, CA, Oct. 1998.
12. J. L. Hennessy and D. A. Patterson. Computer Architecture-A Quantitative Approach. Morgan Kaufmann Publishers, 3rd edition, 2003.
13. J. H. Howard, M. L. Kazar, S. G. Menees, D. A. Nichols, M. Satyanarayanan, R. N. Sidebotham, and M. J. Wes. Scale and performance in a distributed file system. ACM Transactions on Computer Systems, 6(1):51-81, Feb . 1988.
14. B. Kröll and P. Widmayer. Distributing a search tree among a growing number of processors. In Proceedings of the 1994 ACMSIGMOD International Conference on Management of Data, pages 265-276. ACM Press, 1994.
15. B. Kröll and P. Widmayer. Balanced distributed search trees do not exist. In Proceedings of the 4th International Workshop on Algorithms and Data Structures, pages 50-61. Springer, Aug. 1995.
16. J. Kubiatowicz, D. Bindel, Y. Chen, P. Eaton, D. Geels, R. Gummadi, S. Rhea, H. Weatherspoon, W . Weimer, C. Wells, and B. Zhao. OceanStore: An architecture for global-scale persistent storage. In Proceedings of the 9th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS), Cambridge, MA, Nov. 2000. ACM.
17. W. Litwin, J. Menon, and T. Risch. LH schemes with scalable availability. Technical Report RJ 10121 (91937), IBM Research, Almaden Center, May 1998.
18. W. Litwin, M. Neimat, G. Levy, S. Ndiaye, T. Seck, and T. Schwarz. LHS: A high-availability and high-security scalable distributed data structure. In Proceedings of the 7th International Workshop on Research Issues in Data Engineering, 1997, pages 141-150, Birmingham, UK, Apr. 1997. IEEE.
19. W. Litwin and M.-A. Neimat. High-availability LHschemes with mirroring. In Proceedings of the Conference on Cooperative Information Systems, pages 196-205, 1996.
20. W. Litwin, M.-A. Neimat, and D. A. Schneider. LH-A scalable, distrib uted data structure. ACM Transactions on Database Systems, 21(4):480-525, 1996.
21. W. Litwin and T. Risch. LHg: A high-availability scalable distributed data structure by record grouping. IEEE Transactions on Knowledge and Data Engineering, 14(4):923-927, 2002.
22. W. Litwin and T. Schwarz. LH RS: A high-availability scalable distributed data structure using Reed Solomon codes. In Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, pages 237-248, Dallas, TX, May 2000. ACM.
23. M. Ripeanu, A. Iamnitchi, and I. Foster. Mapping the Gnutella network. IEEE Internet Computing, 6(1):50-57, Aug. 2002.
24. A. Rowstron and P. Druschel. Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility. In Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP '01), pages 188-201, Banff, Canada, Oct. 2001. ACM.
25. R. O. Weber. Information technology-SCSI object-based storage device commands (OSD). Technical Council Proposal Document T10/1355-D, T echnical Committee T10, Aug. 2002.
26. B. A. Wichmann and I. D. Hill. Algorithm AS 183: An efficient and portable pseudo-random number generator. Applied Statistics, 31(2):188-190, 1982.
27. Q. Xin, E. L. Miller, D. D. E. Long, S. A. Brandt, T. Schwarz, and W. Litwin. Reliability mechanisms for very large storage systems. In Proceedings of the 20th IEEE / 11th NASA Goddard Conference on Mass Storage Systems and Technologies. IEEE, Apr . 2003. To appear.