The DOI matches its Crossref record; 41 of the 41 references it cites were found in a registry or an index.
The RAMCloud Storage System
Open accessAbstract
RAMCloud is a storage system that provides low-latency access to large-scale datasets. To achieve low latency, RAMCloud stores all data in DRAM at all times. To support large capacities (1PB or more), it aggregates the memories of thousands of servers into a single coherent key-value store. RAMCloud ensures the durability of DRAM-based data by keeping backup copies on secondary storage. It uses a uniform log-structured mechanism to manage both DRAM and secondary storage, which results in high performance and efficient memory usage. RAMCloud uses a polling-based approach to communication, bypassing the kernel to communicate directly with NICs; with this approach, client applications can read small objects from any RAMCloud storage server in less than 5μs, durable writes of small objects take about 13.5μs. RAMCloud does not keep multiple copies of data online; instead, it provides high availability by recovering from crashes very quickly (1 to 2 seconds). RAMCloud’s crash recovery mechanism harnesses the resources of the entire cluster working concurrently so that recovery performance scales with cluster size.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
MapReduce: simplified data processing on large clusters
Dean, J., & Ghemawat, S. (2008) · Communications of the ACM · doi:10.1145/1327452.1327492 · Cited by 18,476
Chord: A scalable peer-to-peer lookup service for internet applications
Stoica, I., Morris, R., Karger, D., Kaashoek, M. F., & Balakrishnan, H. (2001) · Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/383059.383071 · Cited by 9,623
Ghemawat, S., Gobioff, H., & Leung, S.-T. (2003) · ACM SIGOPS Operating Systems Review · doi:10.1145/1165389.945450 · Cited by 4,984
Benchmarking cloud serving systems with YCSB
Cooper, B. F., Silberstein, A., Tam, E., Ramakrishnan, R., & Sears, R. (2010) · Proceedings of the 1st ACM symposium on Cloud computing · doi:10.1145/1807128.1807152 · Cited by 3,716
Resilient distributed datasets: a fault-tolerant abstraction for in-memory cluster computing
Zaharia, M., Chowdhury, M., Das, T., Dave, A., Ma, J. H., McCauley, M., Franklin, M. J. M., Shenker, S. J., & Stoica, I. G. (2012) · Cited by 3,622
Bigtable: A Distributed Storage System for Structured Data
Chang, F., Dean, J., Ghemawat, S., Hsieh, W. C., Wallach, D. A., Burrows, M., Chandra, T., Fikes, A., & Gruber, R. E. (2008) · ACM Transactions on Computer Systems · doi:10.1145/1365815.1365816 · Cited by 3,460
(2007) · doi:10.1145/1294261.1294281 · Cited by 3,447
Linearizability: a correctness condition for concurrent objects
Herlihy, M. P., & Wing, J. M. (1990) · ACM Transactions on Programming Languages and Systems · doi:10.1145/78969.78972 · Cited by 3,176
Chord: a scalable peer-to-peer lookup protocol for internet applications
Stoica, I., Morris, R., Liben-Nowell, D., Karger, D. R., Kaashoek, M. F., Dabek, F., & Balakrishnan, H. (2003) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2002.808407 · Cited by 3,133
In search of an understandable consensus algorithm
Ongaro, D., & Ousterhout, J. K. (2014) · Cited by 1,909
Self-citationPowerGraph: distributed graph-parallel computation on natural graphs
Gonzalez, J. E., Low, Y., Gu, H., Bickson, D., & Guestrin, C. (2012) · doi:10.5555/2387880.2387883 · Cited by 1,451
Ghemawat, S., Gobioff, H., & Leung, S.-T. (2003) · Proceedings of the nineteenth ACM symposium on Operating systems principles · doi:10.1145/945445.945450 · Cited by 1,423
The power of two choices in randomized load balancing
Mitzenmacher, M. (2001) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/71.963420 · Cited by 1,399
ZooKeeper: wait-free coordination for internet-scale systems
Hunt, P. G., Konar, M., Junqueira, F., & Reed, B. C. (2010) · Cited by 1,357
The design and implementation of a log-structured file system
Rosenblum, M., & Ousterhout, J. K. (1992) · ACM Transactions on Computer Systems · doi:10.1145/146941.146943 · Cited by 1,268
Self-citationONOS: towards an open, distributed SDN OS
Berde, P., Gerola, M., Hart, J., Higuchi, Y., Kobayashi, M., Koide, T., Lantz, B., O'Connor, B., Radoslavov, P., Snow, W., et al. (2014) · Proceedings of the third workshop on Hot topics in software defined networking · doi:10.1145/2620728.2620744 · Cited by 1,118
Web search for a planet: the google cluster architecture
Barroso, L. A., Dean, J., & Holzle, U. (2003) · IEEE Micro · doi:10.1109/mm.2003.1196112 · Cited by 1,025
Ritchie, D. M., & Thompson, K. (1983) · Communications of the ACM · doi:10.1145/357980.358014 · Cited by 960
PNUTS: Yahoo!'s hosted data serving platform
Cooper, B. F., Ramakrishnan, R., Srivastava, U., Silberstein, A., Bohannon, P., Jacobsen, H.-A., Puz, N., Weaver, D., & Yerneni, R. (2008) · Proceedings of the VLDB Endowment · doi:10.14778/1454159.1454167 · Cited by 958
Workload analysis of a large-scale key-value store
Atikoglu, B., Xu, Y., Frachtenberg, E., Jiang, S., & Paleczny, M. (2012) · Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems · doi:10.1145/2254756.2254766 · Cited by 901
Ritchie, D. M., & Thompson, K. (1974) · Communications of the ACM · doi:10.1145/361011.361061 · Cited by 826
Proceedings of the 2017 USENIX Annual Technical Conference (USENIX ATC ’17)
Quoc, D. L., Beck, M. S., Bhatotia, P., Chen, R., Fetzer, C. W., & Strufe, T. (2017) · Cited by 611
Sparrow: distributed, low latency scheduling
Ousterhout, K., Wendell, P., Zaharia, M., & Stoica, I. (2013) · Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles · doi:10.1145/2517349.2522716 · Cited by 586
A lightweight infrastructure for graph analytics
Nguyen, D., Lenharth, A., & Pingali, K. (2013) · Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles · doi:10.1145/2517349.2522739 · Cited by 579
H-store: a high-performance, distributed main memory transaction processing system
Kallman, R., Kimura, H., Natkins, J., Pavlo, A., Rasin, A., Zdonik, S., Jones, E. P. C., Madden, S., Stonebraker, M., Zhang, Y., et al. (2008) · Proceedings of the VLDB Endowment · doi:10.14778/1454159.1454211 · Cited by 520
Leases: an efficient fault-tolerant mechanism for distributed file cache consistency
Gray, C., & Cheriton, D. (1989) · Proceedings of the twelfth ACM symposium on Operating systems principles · doi:10.1145/74850.74870 · Cited by 487
The Sprite network operating system
Ousterhout, J. K., Cherenson, A. R., Douglis, F., Nelson, M. N., & Welch, B. B. (1988) · Computer · doi:10.1109/2.16 · Cited by 460
Self-citationUsing RDMA efficiently for key-value services
Kalia, A., Kaminsky, M., & Andersen, D. G. (2014) · Proceedings of the 2014 ACM conference on SIGCOMM · doi:10.1145/2619239.2626299 · Cited by 395
MICA: A Holistic Approach to Fast In-Memory Key-Value Storage
Lim, H., Han, D., Andersen, D. G., & Kaminsky, M. (2018) · Figshare · doi:10.1184/r1/6607280 · Cited by 361
Fast crash recovery in RAMCloud
Ongaro, D., Rumble, S. M., Stutsman, R., Ousterhout, J., & Rosenblum, M. (2011) · Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles · doi:10.1145/2043556.2043560 · Cited by 360
Self-citationIX: a protected dataplane operating system for high throughput and low latency
Belay, A., Prekas, G., Klimovic, A., Grossman, S., Kozyrakis, C., & Bugnion, E. (2014) · doi:10.5555/2685048.2685053 · Cited by 314
Arrakis: The Operating System is the Control Plane
Peter, S., Li, J., Zhang, I. Y., Ports, D. R. K., Woos, D., Krishnamurthy, A., Anderson, T. E., & Roscoe, T. (n.d.) · Cited by 239
Efficient transaction processing in SAP HANA database
Sikka, V., Färber, F., Lehner, W., et al. (2012) · Proceedings - ACM-SIGMOD International Conference on Management of Data · doi:10.1145/2213836.2213946 · Cited by 189
HyperDex: a distributed, searchable key-value store
Escriva, R., Wong, B., & Sirer, E. G. (2012) · Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/2342356.2342360 · Cited by 177
Improving the performance of log-structured file systems with adaptive methods
Matthews, J. N., Roselli, D., Costello, A. M., Wang, R. Y., & Anderson, T. E. (1997) · Proceedings of the sixteenth ACM symposium on Operating systems principles · doi:10.1145/268998.266700 · Cited by 164
Ousterhout, J., Agrawal, P., Erickson, D., Kozyrakis, C., Leverich, J., Mazières, D., Mitra, S., Narayanan, A., Ongaro, D., Parulkar, G., et al. (2011) · Communications of the ACM · doi:10.1145/1965724.1965751 · Cited by 159
Self-citationBalanced allocations (extended abstract)
Azar, Y., Broder, A., Karlin, A. R., et al. (1994) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/195058.195412 · Cited by 139
Log-structured memory for DRAM-based storage
Rumble, S. M., Kejriwal, A. A., & Ousterhout, J. K. (2014) · doi:10.5555/2591305.2591307 · Cited by 105
Self-citationImplementing linearizability at large scale and low latency
Lee, C., Park, S. J., Kejriwal, A. A., Matsushita, S., & Ousterhout, J. K. (2015) · ACM SIGOPS Symposium on Operating Systems Principles (SOSP) · doi:10.1145/2815400.2815416 · Cited by 76
Self-citationImproving the performance of log-structured file systems with adaptive methods
Matthews, J. N., Roselli, D. S., Costello, A. M., Wang, R. Y., & Anderson, T. E. (1997) · ACM SIGOPS Operating Systems Review · doi:10.1145/269005.266700 · Cited by 22
Availability in the Sprite distributed file system
Baker, M. G., & Ousterhout, J. K. (1991) · ACM SIGOPS Operating Systems Review · doi:10.1145/122120.122131 · Cited by 21
Self-citation
Cited by
Cloud Programming Simplified: A Berkeley View on Serverless Computing
Jonas, E., Schleier-Smith, J., Sreekanti, V., Tsai, C.-C., Khandelwal, A., Pu, Q., Shankar, V., Carreira, J., Krauth, K., Yadwadkar, N. J., et al. (2019) · arXiv (Cornell University) · doi:10.4230/oasics.microservices.2020-2022.5 · Cited by 409
Preble: Efficient Distributed Prompt Scheduling for LLM Serving
Srivatsa, V., He, Z., Abhyankar, R., Li, D., & Zhang, Y. (2024) · arXiv · doi:10.48550/arxiv.2407.00023 · Cited by 1
“First, traditional systems usually separate the state layer and the computation layer ( e.g. , an application cluster and a RAM-based storage cluster [39], serverless functions and a separate intermediate computation state layer [20]).”
Background
Metadata
- Authors
- Ousterhout, J., Gopalan, A., Gupta, A., Kejriwal, A., Lee, C., Montazeri, B., Ongaro, D., Park, S. J., Qin, H., Rosenblum, M., Rumble, S., Stutsman, R., & Yang, S.
- Venue
- ACM Transactions on Computer Systems
- Published
- 2015-08-31
- Volume
- 33
- Issue
- 3
- Pages
- 1-55
- ISSN
- 0734-2071 (ISSN-L)
- 1557-7333
- OpenAlex
- W2074881976
- Cited by
- 268
- References
- 41
- FWCI
- 36.07
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.