{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T04:50:03Z","timestamp":1776228603477,"version":"3.50.1"},"reference-count":17,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Commun. ACM"],"published-print":{"date-parts":[[2008,1]]},"abstract":"<jats:p>\n            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\n            <jats:italic>map<\/jats:italic>\n            and a\n            <jats:italic>reduce<\/jats:italic>\n            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.\n          <\/jats:p>","DOI":"10.1145\/1327452.1327492","type":"journal-article","created":{"date-parts":[[2008,1,3]],"date-time":"2008-01-03T18:20:10Z","timestamp":1199384410000},"page":"107-113","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11297,"title":["MapReduce"],"prefix":"10.1145","volume":"51","author":[{"given":"Jeffrey","family":"Dean","sequence":"first","affiliation":[{"name":"Google, Mountain View, CA"}]},{"given":"Sanjay","family":"Ghemawat","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA"}]}],"member":"320","published-online":{"date-parts":[[2008,1]]},"reference":[{"key":"e_1_2_2_1_1","unstructured":"Hadoop: Open source implementation of MapReduce. http:\/\/lucene. apache.org\/hadoop\/.  Hadoop: Open source implementation of MapReduce. http:\/\/lucene. apache.org\/hadoop\/."},{"key":"e_1_2_2_2_1","unstructured":"The Phoenix system for MapReduce programming. http:\/\/csl.stanford. edu\/~christos\/sw\/phoenix\/.  The Phoenix system for MapReduce programming. http:\/\/csl.stanford. edu\/~christos\/sw\/phoenix\/."},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/253260.253322"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2003.1196112"},{"key":"e_1_2_2_5_1","volume-title":"Proceedings of the 1st USENIX Symposium on Networked Systems Design and Implementation (NSDI).","author":"Bent J.","unstructured":"Bent , J. , Thain , D. , Arpaci-Dusseau , A. C. , Arpaci-Dusseau , R. H. , and Livny , M . 2004. Explicit control in a batch-aware distributed file system . In Proceedings of the 1st USENIX Symposium on Networked Systems Design and Implementation (NSDI). Bent, J., Thain, D., Arpaci-Dusseau, A. C., Arpaci-Dusseau, R. H., and Livny, M. 2004. Explicit control in a batch-aware distributed file system. In Proceedings of the 1st USENIX Symposium on Networked Systems Design and Implementation (NSDI)."},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.42122"},{"key":"e_1_2_2_7_1","volume-title":"Proceedings of Neural Information Processing Systems Conference (NIPS)","author":"Chu C.-T.","unstructured":"Chu , C.-T. , Kim , S. K. , Lin , Y. A. , Yu , Y. , Bradski , G. , Ng , A. , and Olukotun , K . 2006. Map-Reduce for machine learning on multicore . In Proceedings of Neural Information Processing Systems Conference (NIPS) . Vancouver, Canada. Chu, C.-T., Kim, S. K., Lin, Y. A., Yu, Y., Bradski, G., Ng, A., and Olukotun, K. 2006. Map-Reduce for machine learning on multicore. In Proceedings of Neural Information Processing Systems Conference (NIPS). Vancouver, Canada."},{"key":"e_1_2_2_8_1","first-page":"137","article-title":"MapReduce: Simplified data processing on large clusters. In Proceedings of Operating Systems Design and Implementation (OSDI). San Francisco","author":"Dean J.","year":"2004","unstructured":"Dean , J. and Ghemawat , S. 2004 . MapReduce: Simplified data processing on large clusters. In Proceedings of Operating Systems Design and Implementation (OSDI). San Francisco , CA. 137 - 150 . Dean, J. and Ghemawat, S. 2004. MapReduce: Simplified data processing on large clusters. In Proceedings of Operating Systems Design and Implementation (OSDI). San Francisco, CA. 137-150.","journal-title":"CA."},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/268998.266662"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/945445.945450"},{"key":"e_1_2_2_11_1","series-title":"Lecture Notes in Computer Science","volume-title":"Parallel Processing","author":"Gorlatch S.","unstructured":"Gorlatch , S. 1996. Systematic efficient parallelization of scan and other list homomorphisms . In L. Bouge, P. Fraigniaud, A. Mignotte, and Y. Robert, Eds. Euro-Par'96. Parallel Processing , Lecture Notes in Computer Science , vol. 1124 . Springer-Verlag . 401-408 Gorlatch, S. 1996. Systematic efficient parallelization of scan and other list homomorphisms. In L. Bouge, P. Fraigniaud, A. Mignotte, and Y. Robert, Eds. Euro-Par'96. Parallel Processing, Lecture Notes in Computer Science, vol. 1124. Springer-Verlag. 401-408"},{"key":"e_1_2_2_12_1","unstructured":"Gray J. Sort benchmark home page. http:\/\/research.microsoft.com\/barc\/SortBenchmark\/.  Gray J. Sort benchmark home page. http:\/\/research.microsoft.com\/barc\/SortBenchmark\/."},{"key":"e_1_2_2_13_1","volume-title":"Proceedings of the 2004 USENIX File and Storage Technologies FAST Conference.","author":"Huston L.","unstructured":"Huston , L. , Sukthankar , R. , Wickremesinghe , R. , Satyanarayanan , M. , Ganger , G. R. , Riedel , E. , and Ailamaki , A . 2004. Diamond: A storage architecture for early discard in interactive search . In Proceedings of the 2004 USENIX File and Storage Technologies FAST Conference. Huston, L., Sukthankar, R., Wickremesinghe, R., Satyanarayanan, M., Ganger, G. R., Riedel, E., and Ailamaki, A. 2004. Diamond: A storage architecture for early discard in interactive search. In Proceedings of the 2004 USENIX File and Storage Technologies FAST Conference."},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/322217.322232"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/62044.62050"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2007.346181"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/2.928624"}],"container-title":["Communications of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1327452.1327492","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1327452.1327492","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:57:51Z","timestamp":1750258671000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1327452.1327492"}},"subtitle":["simplified data processing on large clusters"],"short-title":[],"issued":{"date-parts":[[2008,1]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,1]]}},"alternative-id":["10.1145\/1327452.1327492"],"URL":"https:\/\/doi.org\/10.1145\/1327452.1327492","relation":{},"ISSN":["0001-0782","1557-7317"],"issn-type":[{"value":"0001-0782","type":"print"},{"value":"1557-7317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,1]]},"assertion":[{"value":"2008-01-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}