메뉴 건너뛰기




Volumn 21, Issue 5, 2009, Pages 367-384

Optimal inter-object correlation when replicating for availability

Author keywords

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

Indexed keywords

AVAILABILITY; DATA REPLICATION; INTER-OBJECT CORRELATION; MULTI-OBJECT OPERATION; OBJECT ASSIGNMENT;

EID: 60449104785     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00446-008-0072-2     Document Type: Conference Paper
Times cited : (6)

References (25)
  • 3
    • 0001975809 scopus 로고    scopus 로고
    • Feasibility of a serverless distributed file system deployed on an existing set of desktop PCs
    • Bolosky, W.J., Douceur, J.R., Ely, D., Theimer, M.: Feasibility of a serverless distributed file system deployed on an existing set of desktop PCs. In: ACM SIGMETRICS (2000)
    • (2000) ACM SIGMETRICS
    • Bolosky, W.J.1    Douceur, J.R.2    Ely, D.3    Theimer4
  • 5
    • 0012612933 scopus 로고    scopus 로고
    • Competitive hill-climbing strategies for replica placement in a distributed file system
    • Douceur, J.R., Wattenhofer, R.P.: Competitive hill-climbing strategies for replica placement in a distributed file system. In: DISC (2001)
    • (2001) DISC
    • Douceur, J.R.1    Wattenhofer, R.2
  • 7
    • 33947159079 scopus 로고    scopus 로고
    • Highly durable, decentralized storage despite massive correlated failures
    • Haeberlen, A., Mislove, A., Druschel, P.: Glacier: highly durable, decentralized storage despite massive correlated failures. In: USENIX NSDI (2005)
    • (2005) USENIX NSDI
    • Haeberlen, A.1    Mislove, A.2    Druschel, P.3    Glaci4
  • 8
    • 84990712091 scopus 로고
    • Poisson approximations for large deviations
    • S. Janson 1990 Poisson approximations for large deviations Random Struct Algorithm 1 221 230
    • (1990) Random Struct Algorithm , vol.1 , pp. 221-230
    • Janson, S.1
  • 9
    • 0003063741 scopus 로고
    • An exponential bound for the probability of nonexistence of a specified subgraph in a random graph
    • Karo'nski, M., Jaworski, J., Ruci'nski, A. (eds.) Wiley, New York
    • Janson, S., Luczak, T., Rucinski, A.: An exponential bound for the probability of nonexistence of a specified subgraph in a random graph. In: Karo'nski, M., Jaworski, J., Ruci'nski, A. (eds.) Random Graphs'87. Wiley, New York (1990)
    • (1990) Random Graphs'87
    • Janson, S.1    Luczak, T.2    Rucinski3
  • 10
    • 0002130821 scopus 로고    scopus 로고
    • Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web
    • Karger, D., Lehman, E., Leighton, T., Levine, M., Lewin, D., Panigrahy, R.: Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web. In: ACM STOC (1997)
    • (1997) ACM STOC
    • Karger, D.1    Lehman, E.2    Leighton, T.3    Levine, M.4    Lewin, D.5    Panigrahy6
  • 17
    • 57349153372 scopus 로고    scopus 로고
    • Chain replication for supporting high throughput and availability
    • van Renesse, R., Schneider, F.B.: Chain replication for supporting high throughput and availability. In: USENIX OSDI (2004)
    • (2004) USENIX OSDI
    • Van Renesse, R.1    Schneider, F.2
  • 18
    • 0003007594 scopus 로고    scopus 로고
    • Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems
    • Rowstron, A., Druschel, P.: Pastry: scalable, distributed object location and routing for large-scale peer-to-peer systems. In: ACM Middleware (2001)
    • (2001) ACM Middleware
    • Rowstron, A.1    Druschel2
  • 19
    • 0002834465 scopus 로고    scopus 로고
    • Comparing random data allocation and data striping in multimedia serviers
    • Santos, J., Muntz, R., Ribeiro-Neto, B.: Comparing random data allocation and data striping in multimedia serviers. In: ACM SIGMETRICS (2000)
    • (2000) ACM SIGMETRICS
    • Santos, J.1    Muntz, R.2    Ribeiro-Neto3
  • 20
  • 21
    • 0003873676 scopus 로고    scopus 로고
    • Designing and mining multi-terabyte astronomy archives: The sloan digital sky survey
    • Szalay, A., Kunszt, P., Thakar, A., Gray, J., Slutz, D.: Designing and mining multi-terabyte astronomy archives: the sloan digital sky survey. In: ACM SIGMOD (2000)
    • (2000) ACM SIGMOD
    • Szalay, A.1    Kunszt, P.2    Thakar, A.3    Gray, J.4    Slutz5
  • 22
    • 60449083428 scopus 로고    scopus 로고
    • TPC Benchmark
    • TPC Benchmark. http://www.tpc.org/
  • 23
    • 0000142982 scopus 로고
    • The complexity of enumeration and reliability problems
    • 3
    • L.G. Valiant 1979 The complexity of enumeration and reliability problems SIAM J. Comput. 8 3 410 421
    • (1979) SIAM J. Comput. , vol.8 , pp. 410-421
    • Valiant, L.G.1
  • 24
    • 59249108570 scopus 로고    scopus 로고
    • Availability of multi-object operations
    • Yu, H., Gibbons, P.B., Nath, S.: Availability of multi-object operations. In: USENIX NSDI (2006)
    • (2006) USENIX NSDI
    • Yu, H.1    Gibbons, P.B.2    Nath3
  • 25
    • 36849053072 scopus 로고    scopus 로고
    • Minimal replication cost for availability
    • Yu, H., Vahdat, A.: Minimal replication cost for availability. In: ACM PODC (2002)
    • (2002) ACM PODC
    • Yu, H.1    Vahdat2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.