-
1
-
-
55849133671
-
Sinfonia: a new paradigm for building scalable distributed systems
-
Oct
-
M. Aguilera, A. Merchant, M. Shah, A. Veitch, and C. Karamanolis. Sinfonia: a new paradigm for building scalable distributed systems. In Proc. SOSP'07, pages 159-174, Oct. 2007.
-
(2007)
Proc. SOSP'07
, pp. 159-174
-
-
Aguilera, M.1
Merchant, A.2
Shah, M.3
Veitch, A.4
Karamanolis, C.5
-
2
-
-
84964194161
-
Scalable, efficient range queries for grid information services
-
Sept
-
A. Andrzejak and Z. Xu. Scalable, efficient range queries for grid information services. In Proc. P2P'02, pages 33-40, Sept. 2002.
-
(2002)
Proc. P2P'02
, pp. 33-40
-
-
Andrzejak, A.1
Xu, Z.2
-
3
-
-
85071319367
-
Bigtable:A distributed storage system for structured data
-
Nov
-
F. Chang, J. Dean, S. Ghemawat, W. C. Hsieh, D. A. Wallach, M. Burrows, T. Chandra, A. Fikes, and R. Gruber. Bigtable: A distributed storage system for structured data. In Proc. SOSP'06, pages 205-218, Nov. 2006.
-
(2006)
Proc. SOSP'06
, pp. 205-218
-
-
Chang, F.1
Dean, J.2
Ghemawat, S.3
Hsieh, W.C.4
Wallach, D.A.5
Burrows, M.6
Chandra, T.7
Fikes, A.8
Gruber, R.9
-
4
-
-
70450064414
-
Dynamo: Amazon's highly available key-value store
-
Oct
-
G. DeCandia, D. Hastorun, M. Jampani, G. Kakulapati, A. Lakshman, A. Pilchin, S. Sivasubramanian, P. Vosshall, and W. Vogels. Dynamo: Amazon's highly available key-value store. In Proc. SOSP'07, pages 205-220, Oct. 2007.
-
(2007)
Proc. SOSP'07
, pp. 205-220
-
-
DeCandia, G.1
Hastorun, D.2
Jampani, M.3
Kakulapati, G.4
Lakshman, A.5
Pilchin, A.6
Sivasubramanian, S.7
Vosshall, P.8
Vogels, W.9
-
5
-
-
84947258073
-
Scalable, distributed data structures for Internet service construction
-
Oct
-
S. Gribble, E. Brewer, J. Hellerstein, and D. Culler. Scalable, distributed data structures for Internet service construction. In Proc. OSDI'00, pages 319-332, Oct. 2000.
-
(2000)
Proc. OSDI'00
, pp. 319-332
-
-
Gribble, S.1
Brewer, E.2
Hellerstein, J.3
Culler, D.4
-
6
-
-
1142293109
-
Software transactional memory for ynamic-sized data structures
-
July
-
M. Herlihy, V. Luchangco, M. Moir, and I. William N. Scherer. Software transactional memory for ynamic-sized data structures. In Proc. PODC'03, pages 92-101, July 2003.
-
(2003)
Proc. PODC'03
, pp. 92-101
-
-
Herlihy, M.1
Luchangco, V.2
Moir, M.3
William, I.4
Scherer, N.5
-
7
-
-
0027262011
-
Transactional memory: architectural support for lock-free data structures
-
May
-
M. Herlihy and J. E. B. Moss. Transactional memory: architectural support for lock-free data structures. In Proc. ISCA'93, pages 289-300, May 1993.
-
(1993)
Proc. ISCA'93
, pp. 289-300
-
-
Herlihy, M.1
Moss, J.E.B.2
-
9
-
-
0026977857
-
A distributed data-balanced dictionary based on the B-link tree
-
Mar A longer version appears as MIT Tech Report MIT/LCS/TR-530, Feb. 1992
-
T. Johnson and A. Colbrook. A distributed data-balanced dictionary based on the B-link tree. In Proc. IPPS'92, pages 319-324, Mar. 1992. A longer version appears as MIT Tech Report MIT/LCS/TR-530, Feb. 1992.
-
(1992)
Proc. IPPS'92
, pp. 319-324
-
-
Johnson, T.1
Colbrook, A.2
-
10
-
-
0019574432
-
On optimistic methods for concurrency control
-
June
-
H. T. Kung and J. T. Robinson. On optimistic methods for concurrency control. ACM Trans. Database Syst., 6(2):213-226, June 1981.
-
(1981)
ACM Trans. Database Syst.
, vol.6
, Issue.2
, pp. 213-226
-
-
Kung, H.T.1
Robinson, J.T.2
-
11
-
-
0019666493
-
1981 Efficient locking for concurrent operations on B-trees
-
Dec
-
P. L. Lehman and S. B. Yao. Efficient locking for concurrent operations on B-trees. ACM Transactions on Database Systems, 6(4):650-670, Dec. 1981.
-
ACM Transactions on Database Systems
, vol.6
, Issue.4
, pp. 650-670
-
-
Lehman, P.L.1
Yao, S.B.2
-
12
-
-
12444261097
-
RP*: A Family of Order Preserving Scalable Distributed Data Structures
-
Sept
-
W. Litwin, M.-A. Neimat, and D. Schneider. RP*: A Family of Order Preserving Scalable Distributed Data Structures. In Proc. VLDB'94, pages 342-353, Sept. 1994.
-
(1994)
Proc. VLDB'94
, pp. 342-353
-
-
Litwin, W.1
Neimat, M.-A.2
Schneider, D.3
-
13
-
-
0030400983
-
LH* - a scalable, distributed data structure
-
Dec
-
W. Litwin, M.-A. Neimat, and D. A. Schneider. LH* - a scalable, distributed data structure. ACM Trans. Database Syst., 21(4):480-525, Dec. 1996.
-
(1996)
ACM Trans. Database Syst.
, vol.21
, Issue.4
, pp. 480-525
-
-
Litwin, W.1
Neimat, M.-A.2
Schneider, D.A.3
-
14
-
-
84889681906
-
Boxwood: Abstractions as the foundation for storage infrastructure
-
Dec
-
J. MacCormick, N. Murphy, M. Najork, C. Thekkath, and L. Zhou. Boxwood: Abstractions as the foundation for storage infrastructure. In Proc. OSDI'04, pages 105-120, Dec. 2004.
-
(2004)
Proc. OSDI'04
, pp. 105-120
-
-
MacCormick, J.1
Murphy, N.2
Najork, M.3
Thekkath, C.4
Zhou, L.5
-
15
-
-
0005297489
-
ARIES/KVL: A key-value locking method for concurrency control of multiaction transactions operating on B-tree indexes
-
Aug
-
C. Mohan. ARIES/KVL: A key-value locking method for concurrency control of multiaction transactions operating on B-tree indexes. In Proc. VLDB'90, pages 392-405, Aug. 1990.
-
(1990)
Proc. VLDB'90
, pp. 392-405
-
-
Mohan, C.1
-
16
-
-
0034775826
-
A scalable content-addressable network
-
Aug
-
S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A scalable content-addressable network. In Proc. SIGCOMM'01, pages 161-172, Aug. 2001.
-
(2001)
Proc. SIGCOMM'01
, pp. 161-172
-
-
Ratnasamy, S.1
Francis, P.2
Handley, M.3
Karp, R.4
Shenker, S.5
-
17
-
-
0001824544
-
Concurrent operations on B-trees with overtaking
-
Mar
-
Y. Sagiv. Concurrent operations on B-trees with overtaking. In Proc. PODS'85, pages 28-37, Mar. 1985.
-
(1985)
Proc. PODS'85
, pp. 28-37
-
-
Sagiv, Y.1
-
18
-
-
0029203481
-
Software transactional memory
-
Aug
-
N. Shavit and D. Touitou. Software transactional memory. In Proc. PODC'95, pages 204-213, Aug. 1995.
-
(1995)
Proc. PODC'95
, pp. 204-213
-
-
Shavit, N.1
Touitou, D.2
-
19
-
-
57149122176
-
Efficient bulk insertion into a distributed ordered table
-
June
-
A. Silberstein, B. F. Cooper, U. Srivastava, E. Vee, R. Yerneni, and R. Ramakrishnan. Efficient bulk insertion into a distributed ordered table. In Proc. SIGMOD'08, pages 765-778, June 2008.
-
(2008)
Proc. SIGMOD'08
, pp. 765-778
-
-
Silberstein, A.1
Cooper, B.F.2
Srivastava, U.3
Vee, E.4
Yerneni, R.5
Ramakrishnan, R.6
-
20
-
-
0034782005
-
Chord A scalable peer-to-peer lookup service for Internet applications
-
Aug
-
I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for Internet applications. In Proc. SIGCOMM'01, pages 149-160, Aug. 2001. [21] Sun Microsystems. Lustre, 2008. Online: http://lustre.org/.
-
(2001)
Proc. SIGCOMM'01
, pp. 149-160
-
-
Stoica, I.1
Morris, R.2
Karger, D.3
Kaashoek, F.4
Balakrishnan, H.5
-
21
-
-
85038459702
-
-
Sun Microsystems. Lustre, Online
-
The Apache Software Foundation. Hadoop, 2008. Online: http://hadoop.apache.org/.
-
(2008)
-
-
-
22
-
-
85038450484
-
-
The Apache Software Foundation. Hadoop Online
-
(2008)
-
-
|