Optimal inter-object correlation when replicating for availability

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2007, Pages 254-263

  Yu, Haifeng ^a   Gibbons, Phillip B ^b  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b INTEL CORPORATION   (United States)

Author keywords

Availability; Data replication; Inter object correlation; Multi object operation; Object assignment

Indexed keywords

DATA REPLICATION; MULTI OBJECT OPERATION; OBJECT ASSIGNMENT;

OBJECT RECOGNITION; PROBLEM SOLVING; USER INTERFACES;

DATA ACQUISITION;

EID: 36849087899     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1281100.1281137     Document Type: Conference Paper

References (27)

1. A. Adya, W. J. Bolosky, M. Castro, G. Cermak, R. Chaiken, J. R. Douceur, J. Howell, J. R. Lorch, M. Theimer, and R. P. Wattenhofer. FARSITE: Federated, Available, and Reliable Storage for an Incompletely Trusted Environment. In USENIX OSDI, 2002.
2. N. Alon and J. H. Spencer. The Probabilistic Method. John Wiley & Sons, 2000.
3. W. J. Bolosky, J. R. Douceur, D. Ely, and M. Theimer. Feasibility of a Serverless Distributed File System Deployed on an Existing Set of Desktop PCs. In ACM SIGMETRICS, 2000.
4. F. Dabek, M. F. Kaashoek, D. Karger, R. Morris, and I. Stoica. Wide-area Cooperative Storage with CFS. In ACM SOSP, 2001.
5. J. R. Douceur and R. P. Wattenhofer. Competitive Hill-Climbing Strategies for Replica Placement in a Distributed File System. In DISC, 2001.
6. S. Ghemawat, H. Gobioff, and S.-T. Leung. The Google File System. In ACM SOSP, 2003.
7. A. Haeberlen, A. Mislove, and P. Druschel. Glacier: Highly Durable, Decentralized Storage Despite Massive Correlated Failures. In USENIX NSDI, 2005.
8. L. Huston, R. Sukthankar, R. Wickremesinghe, M. Satyanarayanan, G. Ganger, E. Riedel, and A. Ailamaki. Diamond: A Storage Architecture for Early Discard in Interactive Search. In USENIX FAST, 2004.
9. S. Janson. Poisson Approximations for Large Deviations. Random Structures and Algorithms, 1:221-230, 1990.
10. S. Janson. New Versions of Suen's Correlation Inequality. Random Structures and Algorithms, 13(3-4):467-483, 1998.
11. S. Janson, T. Luczak, and A. Rucinski. An Exponential Bound for the Probability of Nonexistence of a Specified Subgraph in a Random Graph. In Random Graphs '87 (M. Karo'nski and J. Jaworski and A. Ruci'nski, Eds.). John Wiley & Sons, 1990.
12. 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 ACM STOC, 1997.
13. J. Kistler and M. Satyanarayanan. Disconnected Operation in the Coda File System. ACM Trans. Comput. Syst., 10(1):3-25, 1992.
14. D. E. Knuth. The Art of Computer Programming, Volume I. Addison Wesley, 1997.
15. 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 ACM ASPLOS, 2000.
16. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A Scalable Content-addressable Network. In ACM SIGCOMM, 2001.
17. S. Ratnasamy, B. Karp, S. Shenker, D. Estrin, R. Govindan, L. Yin, and F. Yu. Data-Centric Storage in Sensornets with GHT, A Geographic Hash Table. Mobile Networks and Applications, 8(4), 2003.
18. A. Rowstron and P. Druschel. Pastry: Scalable, Distributed Object Location and Routing for Large-scale Peer-to-peer Systems. In ACM Middleware, 2001.
19. J. Santos, R. Muntz, and B. Ribeiro-Neto. Comparing Random Data Allocation and Data Striping in Multimedia Serviers. In ACM SIGMETRICS, 2000.
20. I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan. Chord: A Scalable Peer-To-Peer Lookup Service for Internet Applications. In ACM SIGCOMM, 2001.
21. S. Suen. A Correlation Inequality and a Poisson Limit Theorem for Nonoverlapping Balanced Subgraphs of a Random. Graph. Random Structures and Algorithms, 1(2):231-242, 1990.
22. A. Szalay, P. Kunszt, A. Thakar, J. Gray, and D. Slutz. Designing and Mining Multi-Terabyte Astronomy Archives: The Sloan Digital Sky Survey. In ACM SIGMOD, 2000.
23. TPC Benchmark. http://www.tpc.org/.
24. L. G. Valiant. The Complexity of Enumeration and Reliability Problems. SIAM J. on Computing, 8(3):410-421, 1979.
25. R. van Renesse and F. B. Schneider. Chain Replication for Supporting High Throughput and Availability. In USENIX OSDI, 2004.
26. H. Yu, P. B. Gibbons, and S. Nath. Availability of Multi-Object Operations. In USENIX NSDI, 2006.
27. H. Yu and A. Vahdat. Minimal Replication Cost for Availability. In ACM PODC, 2002.