Cited by 18,476Cloud Computing and Resource ManagementDistributed and Parallel Computing SystemsParallel Computing and Optimization Techniques

MapReduce: simplified data processing on large clusters

Open access
Dean, Jeffrey, Ghemawat, Sanjay·2008·Communications of the ACM

Abstract

MapReduce is a programming model and an associated implementation for processing and generating large datasets that is amenable to a broad variety of real-world tasks. Users specify the computation in terms of a map and a reduce function, and the underlying runtime system automatically parallelizes the computation across large-scale clusters of machines, handles machine failures, and schedules inter-machine communication to make efficient use of the network and disks. Programmers find the system easy to use: more than ten thousand distinct MapReduce programs have been implemented internally at Google over the past four years, and an average of one hundred thousand MapReduce jobs are executed on Google's clusters every day, processing a total of more than twenty petabytes of data per day.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/1327452.1327492

Cites

21 of 21 references verified0 citation errors · 0 not checkable

Statistics

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.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Dean, J., & Ghemawat, S.
Affiliations
Google (United States) (US)
Venue
Communications of the ACM
Published
2008-01
Volume
51
Issue
1
Pages
107-113
ISSN
  • 0001-0782 (ISSN-L)
  • 1557-7317
OpenAlex
W2173213060
Cited by
18,476
References
21
Citations by year
2026: 214 · 2025: 366 · 2024: 358 · 2023: 384 · 2022: 463 · 2021: 670 · 2020: 873 · 2019: 1185 · 2018: 1354 · 2017: 1470 · 2016: 1807 · 2015: 1975 · 2014: 1899 · 2013: 1654 · 2012: 1322
FWCI
2464.11
Type
journal article
Language
en
Open access
Locations
Communications of the ACM (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Information Systems › Cloud Computing and Resource Management
  • Physical Sciences › Computer Science › Computer Networks and Communications › Distributed and Parallel Computing Systems
  • Physical Sciences › Computer Science › Hardware and Architecture › Parallel Computing and Optimization Techniques
Keywords
MapReduce, distributed computing, parallel programming models, big data processing, fault tolerance, cluster computing, Google, job scheduling

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