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
A 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
VL2: a scalable and flexible data center network
Greenberg, A., Hamilton, J. R., Jain, N., Kandula, S., Kim, C., Lahiri, P., Maltz, D. A., Patel, P., & Sengupta, S. (2009) · Proceedings of the ACM SIGCOMM 2009 conference on Data communication · doi:10.1145/1592568.1592576 · Cited by 2,111
A scalable, commodity data center network architecture
Al-Fares, M., Loukissas, A., & Vahdat, A. (2008) · Proceedings of the ACM SIGCOMM 2008 conference on Data communication · doi:10.1145/1402958.1402967 · Cited by 1,679
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
BCube: a high performance, server-centric network architecture for modular data centers
Guo, C., Lu, G., Li, D., Wu, H., Zhang, X., Shi, Y., Tian, C., Zhang, Y., & Lu, S. (2009) · Proceedings of the ACM SIGCOMM 2009 conference on Data communication · doi:10.1145/1592568.1592577 · Cited by 1,372
Managing energy and server resources in hosting centers
Chase, J. S., Anderson, D. C., Thakar, P. N., Vahdat, A. M., & Doyle, R. P. (2001) · Proceedings of the eighteenth ACM symposium on Operating systems principles · doi:10.1145/502034.502045 · Cited by 1,284
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
Scheduling for Reduced CPU Energy
Weiser, M., Welch, B., Demers, A., & Shenker, S. (2007) · The Kluwer International Series in Engineering and Computer Science · doi:10.1007/978-0-585-29603-6_17 · Cited by 1,181
Dcell: a scalable and fault-tolerant network structure for data centers
Guo, C., Wu, H., Tan, K., Shi, L., Zhang, Y., & Lu, S. (2008) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1402946.1402968 · Cited by 994
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
Venti: A New Approach to Archival Storage
Quinlan, S., & Dorward, S. (2002) · Cited by 732
Dcell: a scalable and fault-tolerant network structure for data centers
Guo, C., Wu, H., Tan, K., Shi, L., Zhang, Y., & Lu, S. (2008) · Proceedings of the ACM SIGCOMM 2008 conference on Data communication · doi:10.1145/1402958.1402968 · Cited by 563
Chain replication for supporting high throughput and availability
van Renesse, R., & Schneider, F. B. (2004) · Operating Systems Design and Implementation · Cited by 495
Overview of the Blue Gene/L system architecture
Gara, A., Blumrich, M. A., Chen, D., Chiu, G. L.-T., Coteus, P., Giampapa, M. E., Haring, R. A., Heidelberger, P., Hoenicke, D., Kopcsay, G. V., et al. (2005) · IBM Journal of Research and Development · doi:10.1147/rd.492.0195 · Cited by 360
Ensemble-level Power Management for Dense Blade Servers
Ranganathan, P., Leech, P., Irwin, D., & Chase, J. (2006) · ACM SIGARCH Computer Architecture News · doi:10.1145/1150019.1136492 · Cited by 357
Hibernator: helping disk arrays sleep through the winter
Zhu, Q., Chen, Z., Tan, L., Zhou, Y., Keeton, K., & Wilkes, J. (2005) · ACM SIGOPS Operating Systems Review · doi:10.1145/1095809.1095828 · Cited by 287
Self-citationByzantine generals in action: implementing fail-stop processors
Schneider, F. B. (1984) · ACM Transactions on Computer Systems · doi:10.1145/190.357399 · Cited by 266
JouleSort: a balanced energy-efficiency benchmark
Rivoire, S., Shah, M. A., Ranganathan, P., & Kozyrakis, C. (2007) · Proceedings of the 2007 ACM SIGMOD international conference on Management of data · doi:10.1145/1247480.1247522 · Cited by 231
Active disks for large-scale data processing
Riedel, E., Faloutsos, C., Gibson, G. A., & Nagle, D. (2001) · Computer · doi:10.1109/2.928624 · Cited by 224
Hibernator: helping disk arrays sleep through the winter
Zhu, Q., Chen, Z., Tan, L., Zhou, Y., Keeton, K., & Wilkes, J. (2005) · Proceedings of the twentieth ACM symposium on Operating systems principles · doi:10.1145/1095810.1095828 · Cited by 161
Self-citationDelivering energy proportionality with non energy-proportional systems: optimizing the ensemble
Tolia, N. H., Wang, Z., Marwah, M., Bash, C. E., Ranganathan, P., & Zhu, X. (2008) · Cited by 153
Pergamum: replacing tape with energy efficient, reliable, disk-based archival storage
Storer, M. W., Greenan, K. M., Miller, E. L., & Voruganti, K. (2008) · Cited by 140
Enriching network security analysis with time travel
Maier, G., Sommer, R., Dreger, H., Feldmann, A., Paxson, V., & Schneider, F. (2008) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1402946.1402980 · Cited by 95
SmartSaver: Turning Flash Drive into a Disk Energy Saver for Mobile Computers
Chen, F., Jiang, S., & Zhang, X. (2006) · International Symposium on Low Power Electronics and Design (ISLPED) · doi:10.1145/1165573.1165674 · Cited by 81
Low-power amdahl-balanced blades for data intensive computing
Szalay, A. S., Bell, G. C., Huang, H. H., Terzis, A., & White, A. (2010) · ACM SIGOPS Operating Systems Review · doi:10.1145/1740390.1740407 · Cited by 79
Object storage on CRAQ: high-throughput chain replication for read-mostly workloads
Terrace, J., & Freedman, M. J. (2009) · Cited by 66
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
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.