-
1
-
-
10444279524
-
FARSITE: Federated, available, and reliable storage for an incompletely trusted environment
-
Adya, A., Bolosky, W.J., Castro, M., Cermak, G., Chaiken, R., Douceur, J.R., Howell, J., Lorch, J.R., Theimer, M., Wattenhofer, R.P.: FARSITE: federated, available, and reliable storage for an incompletely trusted environment. In: USENIX OSDI (2002)
-
(2002)
USENIX OSDI
-
-
Adya, A.1
Bolosky, W.J.2
Castro, M.3
Cermak, G.4
Chaiken, R.5
Douceur, J.R.6
Howell, J.7
Lorch, J.R.8
Theimer, M.9
Wattenhofer, R.10
-
3
-
-
0001975809
-
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
-
4
-
-
2342599575
-
Wide-area cooperative storage with CFS
-
Dabek, F., Kaashoek, M.F., Karger, D., Morris, R., Stoica, I.: Wide-area cooperative storage with CFS. In: ACM SOSP (2001)
-
(2001)
ACM SOSP
-
-
Dabek, F.1
Kaashoek, M.F.2
Karger, D.3
Morris, R.4
Stoica5
-
5
-
-
0012612933
-
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
-
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
-
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
-
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
-
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
-
13
-
-
4544277389
-
OceanStore: An architecture for global-scale persistent storage
-
Kubiatowicz, J., Bindel, D., Chen, Y., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., Wells, C., Zhao, B.: OceanStore: an architecture for global-scale persistent storage. In: ACM ASPLOS (2000)
-
(2000)
ACM ASPLOS
-
-
Kubiatowicz, J.1
Bindel, D.2
Chen, Y.3
Eaton, P.4
Geels, D.5
Gummadi, R.6
Rhea, S.7
Weatherspoon, H.8
Weimer, W.9
Wells, C.10
Zhao11
-
14
-
-
34848849828
-
Defragmenting DHT-based distributed file systems
-
Pang, J., Gibbons, P.B., Kaminsky, M., Seshan, S., Yu, H.: Defragmenting DHT-based distributed file systems. In: Proceedings of International Conference on Distributed Computing Systems (2007)
-
(2007)
Proceedings of International Conference on Distributed Computing Systems
-
-
Pang, J.1
Gibbons, P.B.2
Kaminsky, M.3
Seshan, S.4
Yu5
-
15
-
-
0003242071
-
A scalable content-addressable network
-
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: ACM SIGCOMM (2001)
-
(2001)
ACM SIGCOMM
-
-
Ratnasamy, S.1
Francis, P.2
Handley, M.3
Karp, R.4
Shenker5
-
16
-
-
0042564491
-
Data-centric storage in sensornets with GHT: A geographic hash table
-
Ratnasamy, S., Karp, B., Shenker, S., Estrin, D., Govindan, R., Yin, L., Yu, F.: Data-centric storage in sensornets with GHT: a geographic hash table. Mobile Netw. Appl. 8(4), 427-442 (2003)
-
(2003)
Mobile Netw. Appl.
, vol.8
, Issue.4
, pp. 427-442
-
-
Ratnasamy, S.1
Karp, B.2
Shenker, S.3
Estrin, D.4
Govindan, R.5
Yin, L.6
Yu7
-
17
-
-
57349153372
-
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
-
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
-
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
-
-
0002245383
-
Chord: A scalable peer-to-peer lookup service for internet applications
-
Stoica, I., Morris, R., Karger, D., Kaashoek, F., Balakrishnan, H.: Chord: a scalable peer-to-peer lookup service for internet applications. In: ACM SIGCOMM (2001)
-
(2001)
ACM SIGCOMM
-
-
Stoica, I.1
Morris, R.2
Karger, D.3
Kaashoek, F.4
Balakrishnan5
-
21
-
-
0003873676
-
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
-
-
TPC Benchmark
-
TPC Benchmark. http://www.tpc.org/
-
-
-
-
23
-
-
0000142982
-
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
-
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
-
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
|