The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
MapReduce: Simplified Data Processing on Large Cluster
Abstract
MapReduce is a programming model and an associated implementation for processing and generating large data sets. Users specify a map function that processes a key/value pair to generate a set of intermediate key/value pairs, and a reduce function that merges all intermediate values associated with the same intermediate key. Many real world tasks are expressible in this model, as shown in the paper. Programs written in this functional style are automatically parallelized and executed on a large cluster of commodity machines. The run-time system takes care of the details of partitioning the input data, scheduling the program's execution across a set of machines, handling machine failures, and managing the required inter-machine communication. This allows programmers without any experience with parallel and distributed systems to easily utilize the resources of a large distributed system. Our implementation of MapReduce runs on a large cluster of commodity machines and is highly scalable: a typical MapReduce computation processes many terabytes of data on thousands of machines. Programmers find the system easy to use: hundreds of MapReduce programs have been implemented and upwards of one thousand MapReduce jobs are executed on Google's clusters every day.
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
Ghemawat, S., Gobioff, H., & Leung, S.-T. (2003) · ACM SIGOPS Operating Systems Review · doi:10.1145/1165389.945450 · Cited by 4,984
A Bridging Model for Parallel Computation
Valiant, L. G. (1990) · ACM eBooks · doi:10.1145/3749740.3749753 · Cited by 3,664
Efficient dispersal of information for security, load balancing, and fault tolerance
Rabin, M. O. (1989) · Journal of the ACM · doi:10.1145/62044.62050 · Cited by 1,365
Ladner, R. E., & Fischer, M. J. (1980) · Journal of the ACM · doi:10.1145/322217.322232 · Cited by 1,281
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
Scans as primitive parallel operations
Blelloch, G. E. (1989) · IEEE Transactions on Computers · doi:10.1109/12.42122 · Cited by 538
Cluster-based scalable network services
Fox, A., Gribble, S. D., Chawathe, Y., Brewer, E. A., & Gauthier, P. (1997) · Proceedings of the sixteenth ACM symposium on Operating systems principles · doi:10.1145/268998.266662 · Cited by 522
Charlotte: Metacomputing on the Web
Baratloo, A., Karaul, M., Kedem, Z. M., & Wijckoff, P. (1999) · Future Generation Computer Systems · doi:10.1016/s0167-739x(99)00009-6 · Cited by 241
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
Cluster I/O with River: making the fast case common
Arpaci-Dusseau, R. H., Anderson, E., Treuhaft, N., Culler, D. E., Hellerstein, J. M., Patterson, D., & Yelick, K. (1999) · Proceedings of the sixth workshop on I/O in parallel and distributed systems · doi:10.1145/301816.301823 · Cited by 176
High-performance sorting on networks of workstations
Arpaci-Dusseau, A. C., Arpaci-Dusseau, R. H., Culler, D., Hellerstein, J. M., & Patterson, D. A. (1997) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/253260.253322 · Cited by 138
Explicit control a batch-aware distributed file system
Bent, J., Thain, D., Arpaci-Dusseau, A. C., Arpaci-Dusseau, R. H., & Livny, M. (2004) · Cited by 115
Systematic efficient parallelization of scan and other list homomorphisms
Gorlatch, S. P. (1996) · Lecture notes in computer science · doi:10.1007/bfb0024729 · Cited by 67
Cited by
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
TensorFlow: A system for large-scale machine learning
Abadi, M., Barham, P., Chen, J., Chen, Z., Davis, A., Dean, J., Devin, M., Ghemawat, S., Irving, G., Isard, M., et al. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1605.08695 · Cited by 11,822
Buyya, R., Yeo, C. S., Venugopal, S., Broberg, J., & Brandic, I. (2009) · Future Generation Computer Systems · doi:10.1016/j.future.2008.12.001 · Cited by 5,937
The Hadoop Distributed File System
Shvachko, K., Kuang, H., Radia, S., & Chansler, R. (2010) · 2010 IEEE 26th Symposium on Mass Storage Systems and Technologies (MSST) · doi:10.1109/msst.2010.5496972 · Cited by 4,834
Apache Spark: A unified engine for big data processing
Zaharia, M., Xin, R. S., Wendell, P., Das, T., Armbrust, M., Dave, A., Meng, X., Rosen, J., Venkataraman, S., Franklin, M. J., et al. (2016) · Communications of the ACM · doi:10.1145/2934664 · Cited by 2,757
Metadata
- Authors
- Senior Software Developer, A. U., & Dayalan, M.
- Venue
- International Journal of Research and Engineering
- Publisher
- Marwah Infotech
- Published
- 2018-04
- Volume
- 5
- Issue
- 5
- Pages
- 399-403
- ISSN
- 2348-7852 (ISSN-L)
- 2348-7860
- OpenAlex
- W2122465391
- Cited by
- 2,948
- References
- 13
- FWCI
- 215.33
- 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.