The DOI matches its Crossref record; 36 of the 36 references it cites were found in a registry or an index.
FAWN: a fast array of wimpy nodes
Abstract
This paper presents a new cluster architecture for low-power data-intensive computing. FAWN couples low-power embedded CPUs to small amounts of local flash storage, and balances computation and I/O capabilities to enable efficient, massively parallel access to data.The key contributions of this paper are the principles of the FAWN architecture and the design and implementation of FAWN-KV--a consistent, replicated, highly available, and high-performance key-value storage system built on a FAWN prototype. Our design centers around purely log-structured datastores that provide the basis for high performance on flash storage, as well as for replication and consistency obtained using chain replication on a consistent hashing ring. Our evaluation demonstrates that FAWN clusters can handle roughly 350 key-value queries per Joule of energy--two orders of magnitude more than a disk-based system.
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
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
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Rowstron, A., & Druschel, P. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45518-3_18 · Cited by 7,276
Xen and the art of virtualization
Barham, P., Dragovic, B., Fraser, K., Hand, S., Harris, T., Ho, A., Neugebauer, R., Pratt, I., & Warfield, A. (2003) · ACM SIGOPS Operating Systems Review · doi:10.1145/1165389.945462 · Cited by 5,915
Ghemawat, S., Gobioff, H., & Leung, S.-T. (2003) · ACM SIGOPS Operating Systems Review · doi:10.1145/1165389.945450 · Cited by 4,984
(2007) · doi:10.1145/1294261.1294281 · Cited by 3,447
A scalable, commodity data center network architecture
Al-Fares, M., Loukissas, A., & Vahdat, A. (2008) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1402946.1402967 · Cited by 3,175
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
Maymounkov, P., & Mazières, D. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45748-8_5 · Cited by 3,004
MapReduce: Simplified Data Processing on Large Cluster
Senior Software Developer, A. U., & Dayalan, M. (2018) · International Journal of Research and Engineering · doi:10.21276/ijre.2018.5.5.4 · Cited by 2,948
Lamport, L. (1998) · ACM Transactions on Computer Systems · doi:10.1145/279227.279229 · Cited by 2,737
The Case for Energy-Proportional Computing
Barroso, L. A., & Hölzle, U. (2007) · Computer · doi:10.1109/mc.2007.443 · Cited by 2,491
Cited by
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
Don't settle for eventual: scalable causal consistency for wide-area storage with COPS
Lloyd, W., Freedman, M. J., Kaminsky, M., & Andersen, D. G. (2011) · Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles · doi:10.1145/2043556.2043593 · Cited by 565
Self-citationNetCache: Balancing Key-Value Stores with Fast In-Network Caching
Jin, X., Li, X., Zhang, H., Soulé, R., Lee, J., Foster, N., Kim, C., & Stoica, I. (2017) · Proceedings of the 26th Symposium on Operating Systems Principles · doi:10.1145/3132747.3132764 · Cited by 556
The case for RAMClouds: scalable high-performance storage entirely in DRAM
Ousterhout, J., Agrawal, P., Erickson, D., Kozyrakis, C., Leverich, J., Mazières, D., Mitra, S., Narayanan, A., Parulkar, G., Rosenblum, M., et al. (2010) · ACM SIGOPS Operating Systems Review · doi:10.1145/1713254.1713276 · Cited by 447
Trinity: a distributed graph engine on a memory cloud
Shao, B., Wang, H., & Li, Y. (2013) · Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data · doi:10.1145/2463676.2467799 · Cited by 432
In-Memory Big Data Management and Processing: A Survey
Zhang, H., Chen, G., Ooi, B. C., Tan, K.-L., & Zhang, M. (2015) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2015.2427795 · Cited by 414
Optimizing energy consumption for data centers
Rong, H., Zhang, H., Xiao, S., Li, C., & Hu, C. (2016) · Renewable and Sustainable Energy Reviews · doi:10.1016/j.rser.2015.12.283 · Cited by 398
Profiling a warehouse-scale computer
Kanev, S., Darago, J. P., Hazelwood, K., Ranganathan, P., Moseley, T., Wei, G.-Y., & Brooks, D. (2015) · Proceedings of the 42nd Annual International Symposium on Computer Architecture · doi:10.1145/2749469.2750392 · Cited by 397
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
Self-citationConsistent and durable data structures for non-volatile byte-addressable memory
Venkataraman, S., Tolia, N. H., Ranganathan, P., & Campbell, R. H. (2011) · doi:10.5555/1960475.1960480 · Cited by 356
Information-centric networking: seeing the forest for the trees
Ghodsi, A., Shenker, S., Koponen, T., Singla, A., Raghavan, B., & Wilcox, J. (2011) · Proceedings of the 10th ACM Workshop on Hot Topics in Networks · doi:10.1145/2070562.2070563 · Cited by 321
WiscKey: Separating Keys from Values in SSD-Conscious Storage
Lu, L., Pillai, T. S., Gopalakrishnan, H., Arpaci-Dusseau, A. C., & Arpaci-Dusseau, R. H. (2017) · ACM Transactions on Storage · doi:10.1145/3033273 · Cited by 301
SILT: a memory-efficient, high-performance key-value store
Lim, H., Fan, B., Andersen, D. G., & Kaminsky, M. (2011) · Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles · doi:10.1145/2043556.2043558 · Cited by 294
Self-citationCloud Computing: Survey on Energy Efficiency
Mastelic, T., Oleksiak, A., Claussen, H., Brandic, I., Pierson, J.-M., & Vasilakos, A. V. (2015) · ACM Computing Surveys · doi:10.1145/2656204 · Cited by 276
Workload analysis of a large-scale key-value store
Atikoglu, B., Xu, Y., Frachtenberg, E., Jiang, S., & Paleczny, M. (2012) · ACM SIGMETRICS Performance Evaluation Review · doi:10.1145/2318857.2254766 · Cited by 268
Piccolo: building fast, distributed programs with partitioned tables
Power, R., & Li, J. (2010) · doi:10.5555/1924943.1924964 · Cited by 252
Towards continuous policy-driven demand response in data centers
Irwin, D., Sharma, N., & Shenoy, P. (2011) · Proceedings of the 2nd ACM SIGCOMM workshop on Green networking · doi:10.1145/2018536.2018541 · Cited by 22
Metadata
- Authors
- Andersen, D. G., Franklin, J., Kaminsky, M., Phanishayee, A., Tan, L., & Vasudevan, V.
- Venue
- Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles
- Publisher
- ACM
- Published
- 2009-10-11
- Pages
- 1-14
- OpenAlex
- W2133394135
- Cited by
- 561
- References
- 36
- FWCI
- 56.14
- Type
- conference paper
- 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.