The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Evaluating MapReduce for Multi-core and Multiprocessor Systems
Abstract
This paper evaluates the suitability of the MapReduce model for multi-core and multi-processor systems. MapReduce was created by Google for application development on data-centers with thousands of servers. It allows programmers to write functional-style code that is automatically parallelized and scheduled in a distributed system. We describe Phoenix, an implementation of MapReduce for shared-memory systems that includes a programming API and an efficient runtime system. The Phoenix runtime automatically manages thread creation, dynamic task scheduling, data partitioning, and fault tolerance across processor nodes. We study Phoenix with multi-core and symmetric multiprocessor systems and evaluate its performance potential and error recovery features. We also compare MapReduce code to code written in lower-level APIs such as P-threads. Overall, we establish that, given a careful implementation, MapReduce is a promising model for scalable performance on shared-memory systems with simple parallel code
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
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
Ghemawat, S., Gobioff, H., & Leung, S.-T. A. (2003) · doi:10.1145/945449.945450 · Cited by 1,347
Ladner, R. E., & Fischer, M. J. (1980) · Journal of the ACM · doi:10.1145/322217.322232 · Cited by 1,281
X10: an object-oriented approach to non-uniform cluster computing
Charles, P., Grothoff, C., Saraswat, V., Donawa, C., Kielstra, A., Ebcioglu, K., von Praun, C., & Sarkar, V. (2005) · Proceedings of the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications · doi:10.1145/1094811.1094852 · Cited by 1,268
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
Language support for lightweight transactions
Harris, T., & Fraser, K. A. (2014) · ACM SIGPLAN Notices · doi:10.1145/2641638.2641654 · Cited by 630
Robust system design with built-in soft-error resilience
Mitra, S., Seifert, N., Zhang, M., Shi, Q., & Kim, K. S. (2005) · Computer · doi:10.1109/mc.2005.70 · Cited by 562
Scans as primitive parallel operations
Blelloch, G. E. (1989) · IEEE Transactions on Computers · doi:10.1109/12.42122 · Cited by 538
A stream compiler for communication-exposed architectures
Gordon, M. I., Thies, W., Karczmarek, M., Lin, J., Meli, A. S., Lamb, A. A., Leger, C., Wong, J., Hoffmann, H., Maze, D., et al. (2002) · Proceedings of the 10th international conference on Architectural support for programming languages and operating systems · doi:10.1145/605397.605428 · Cited by 337
The Fortress Language Specification
Allen, E. E., Chase, D. R., Hallett, J., Luchangco, V., Maessen, J.-W., Ryu, S., Steele, G. L., Dias, J., Eastlund, C., Flood, C. H., et al. (2007) · Cited by 195
The Common Case Transactional Behavior of Multithreaded Programs
Chung, J., Chafi, H., Minh, C. C., McDonald, A., Carlstrom, B. D., Kozyrakis, C., & Olukotun, K. (2006) · IEEE International Symposium on High-Performance Computer Architecture (HPCA) · doi:10.1109/hpca.2006.1598135 · Cited by 101
Self-citation
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
Data-intensive applications, challenges, techniques and technologies: A survey on Big Data
Philip Chen, C. L., & Zhang, C.-Y. (2014) · Information Sciences · doi:10.1016/j.ins.2014.01.015 · Cited by 3,047
Wu, X., Zhu, X., Wu, G.-Q., & Ding, W. (2014) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2013.109 · Cited by 2,410
Kambatla, K., Kollias, G., Kumar, V., & Grama, A. (2014) · Journal of Parallel and Distributed Computing · doi:10.1016/j.jpdc.2014.01.003 · Cited by 819
Twister: a runtime for iterative MapReduce
Ekanayake, J., Li, H., Zhang, B., Gunarathne, T., Bae, S.-H., Qiu, J., & Fox, G. (2010) · Proceedings of the 19th ACM International Symposium on High Performance Distributed Computing · doi:10.1145/1851476.1851593 · Cited by 777
Metadata
- Authors
- Ranger, C., Raghuraman, R., Penmetsa, A., Bradski, G., & Kozyrakis, C.
- Venue
- 2007 IEEE 13th International Symposium on High Performance Computer Architecture
- Publisher
- IEEE
- Published
- 2007
- Pages
- 13-24
- ISSN
- 1530-0897 (ISSN-L)
- OpenAlex
- W2104644701
- Cited by
- 966
- References
- 12
- FWCI
- 39.07
- 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.