MapReduce
Communications of the ACM · 2008 · 19,031 citationsOpen access
No retraction on record in OpenAlex.Check Crossref now
Cite this paper
Dean, J., & Ghemawat, S. (2008). MapReduce. Communications of the ACM, 51(1), 107–113. https://doi.org/10.1145/1327452.1327492
In text: (Dean & Ghemawat, 2008)
Ask a question about this research
One question, free, no account. Anchorcite finds the papers, checks each against Crossref and links every sentence of the answer to the passage it comes from.
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.
Related papers
- Array programming with NumPy2020
- LINCS: A linear constraint solver for molecular simulations1997
- GROMACS 4: Algorithms for Highly Efficient, Load-Balanced, and Scalable Molecular Simulation2008
- LAMMPS - a flexible simulation tool for particle-based materials modeling at the atomic, meso, and continuum scales2021
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment1973
Metadata from OpenAlex (CC0). Citations are generated from the published record.