The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
The case for RAMClouds: scalable high-performance storage entirely in DRAM
Abstract
Disk-oriented approaches to online storage are becoming increasingly problematic: they do not scale gracefully to meet the needs of large-scale Web applications, and improvements in disk capacity have far outstripped improvements in access latency and bandwidth. This paper argues for a new approach to datacenter storage called RAMCloud, where information is kept entirely in DRAM and large-scale systems are created by aggregating the main memories of thousands of commodity servers. We believe that RAMClouds can provide durable and available storage with 100-1000x the throughput of disk-based systems and 100-1000x lower access latency. The combination of low latency and large scale will enable a new breed of dataintensive applications.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Above the Clouds: A Berkeley View of Cloud Computing
Armbrust, M., Fox, A., Griffith, R., Joseph, A. D., Katz, R. H., Konwinski, A., Lee, G., Patterson, D. A., Rabkin, A., Stoica, I. G., et al. (2009) · UC Berkeley · Cited by 6,274
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 · cited 6×
“For example, Bigtable [4] does not support transactions involving more than a single row and Dynamo [8] does not guarantee immediate and consistent updates of replicas.”
BackgroundResultInfluentialA case for redundant arrays of inexpensive disks (RAID)
Patterson, D. A., Gibson, G., & Katz, R. H. (1988) · ACM SIGMOD Record · doi:10.1145/971701.50214 · Cited by 2,281
A case for redundant arrays of inexpensive disks (RAID)
Patterson, D. A., Gibson, G., & Katz, R. H. (1988) · Proceedings of the 1988 ACM SIGMOD international conference on Management of data - SIGMOD '88 · doi:10.1145/50202.50214 · Cited by 1,443
(2014) · Elsevier eBooks · doi:10.1016/b978-0-12-799957-9.00002-x · Cited by 1,313
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-citationPrinciples of transaction-oriented database recovery
Haerder, T., & Reuter, A. (1983) · ACM Computing Surveys · doi:10.1145/289.291 · Cited by 1,217
The design and implementation of a log-structured file system
Rosenblum, M., & Ousterhout, J. K. (1991) · Proceedings of the thirteenth ACM symposium on Operating systems principles · doi:10.1145/121132.121137 · Cited by 970
Self-citationPNUTS: 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
FAWN: a fast array of wimpy nodes
Andersen, D. G., Franklin, J., Kaminsky, M., Phanishayee, A., Tan, L., & Vasudevan, V. (2009) · Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles · doi:10.1145/1629575.1629577 · Cited by 561
The end of an architectural era: (it's time for a complete rewrite)
Stonebraker, M. R., Madden, S. R., Abadi, D. J., Harizopoulos, S., Hachem, N. I., & Helland, P. (2007) · Cited by 558
DRAM errors in the wild: a large-scale field study
Schroeder, B., Pinheiro, E., & Weber, W.-D. (2009) · Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems · doi:10.1145/1555349.1555372 · Cited by 557 · cited 1×
“First, bit error rates for DRAM are relatively high [22] so ECC memory will be necessary to avoid undetected errors.”
BackgroundH-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
Gray, J., & Putzolu, F. (1987) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/38713.38755 · Cited by 137
Cited by
The Datacenter as a Computer: An Introduction to the Design of Warehouse-Scale Machines
Barroso, L. A., & Hölzle, U. (2009) · Synthesis lectures on computer architecture · doi:10.2200/s00193ed1v01y200905cac006 · Cited by 1,714
ONOS: 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
Self-citationA scalable processing-in-memory accelerator for parallel graph processing
Ahn, J., Hong, S., Yoo, S., Mutlu, O., & Choi, K. (2015) · Proceedings of the 42nd Annual International Symposium on Computer Architecture · doi:10.1145/2749469.2750386 · Cited by 767
HyPer: A hybrid OLTP&OLAP main memory database system based on virtual memory snapshots
Kemper, A., & Neumann, T. (2011) · 2011 IEEE 27th International Conference on Data Engineering · doi:10.1109/icde.2011.5767867 · Cited by 589
CACTI 7: New Tools for Interconnect Exploration in Innovative Off-Chip Memories
Balasubramonian, R., Kahng, A. B., Muralimanohar, N., Shafiee, A., & Srinivas, V. (2017) · ACM Transactions on Architecture and Code Optimization · doi:10.1145/3085572 · Cited by 559
Metadata
- Authors
- Ousterhout, J., Agrawal, P., Erickson, D., Kozyrakis, C., Leverich, J., Mazières, D., Mitra, S., Narayanan, A., Parulkar, G., Rosenblum, M., Rumble, S. M., Stratmann, E., & Stutsman, R.
- Venue
- ACM SIGOPS Operating Systems Review
- Published
- 2010-01-27
- Volume
- 43
- Issue
- 4
- Pages
- 92-105
- ISSN
- 0163-5980 (ISSN-L)
- OpenAlex
- W2144518192
- Cited by
- 447
- References
- 16
- FWCI
- 57.83
- Type
- journal article
- Language
- en
- Open access
- closed
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.