The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Twister: a runtime for iterative MapReduce
Abstract
MapReduce programming model has simplified the implementation of many data parallel applications. The simplicity of the programming model and the quality of services provided by many implementations of MapReduce attract a lot of enthusiasm among distributed computing communities. From the years of experience in applying MapReduce to various scientific applications we identified a set of extensions to the programming model and improvements to its architecture that will expand the applicability of MapReduce to more classes of applications. In this paper, we present the programming model and the architecture of Twister an enhanced MapReduce runtime that supports iterative MapReduce computations efficiently. We also show performance comparisons of Twister with other similar runtimes such as Hadoop and DryadLINQ for large scale data parallel applications.
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
(1967) · Cited by 23,719
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
The anatomy of a large-scale hypertextual Web search engine
Brin, S., & Page, L. (1998) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(98)00110-x · Cited by 16,004
Multidimensional Scaling by Optimizing Goodness of Fit to a Nonmetric Hypothesis
Kruskal, J. B. (1964) · Psychometrika · doi:10.1007/bf02289565 · Cited by 7,317
Ghemawat, S., Gobioff, H., & Leung, S.-T. (2003) · ACM SIGOPS Operating Systems Review · doi:10.1145/1165389.945450 · Cited by 4,984
Dryad: distributed data-parallel programs from sequential building blocks
Isard, M., Budiu, M., Yu, Y., Birrell, A., & Fetterly, D. (2007) · Proceedings of the 2nd ACM SIGOPS/EuroSys European Conference on Computer Systems 2007 · doi:10.1145/1272996.1273005 · Cited by 2,432
Modern Multidimensional Scaling: Theory and Applications
Borg, I., & Groenen, P. (2003) · Journal of Educational Measurement · doi:10.1111/j.1745-3984.2003.tb01108.x · Cited by 2,197
An improved algorithm for matching biological sequences
Gotoh, O. (1982) · Journal of Molecular Biology · doi:10.1016/0022-2836(82)90398-9 · Cited by 1,724
Map-Reduce for Machine Learning on Multicore
Chu, C.-T., Kim, S. K., Lin, Y.-A., Yu, Y., Bradski, G., Ng, A. Y., & Olukotun, K. (2007) · Advances in Neural Information Processing Systems 19 · doi:10.7551/mitpress/7503.003.0040 · Cited by 1,229
Evaluating MapReduce for Multi-core and Multiprocessor Systems
Ranger, C., Raghuraman, R., Penmetsa, A., Bradski, G., & Kozyrakis, C. (2007) · 2007 IEEE 13th International Symposium on High Performance Computer Architecture · doi:10.1109/hpca.2007.346181 · Cited by 966
Takane, Y., Young, F. W., & de Leeuw, J. (1977) · Psychometrika · doi:10.1007/bf02293745 · Cited by 947
Repbase Update: a database and an electronic journal of repetitive elements
Jurka, J. (2000) · Trends in Genetics · doi:10.1016/s0168-9525(00)02093-x · Cited by 883
Yu, Y., Isard, M., Fetterly, D., Budiu, M., Erlingsson, Ú., Gunda, P. K., & Currey, J. (2008) · doi:10.5555/1855741.1855742 · Cited by 689
MapReduce for Data Intensive Scientific Analyses
Ekanayake, J., Pallickara, S., & Fox, G. (2008) · IEEE International Conference on eScience · doi:10.1109/escience.2008.59 · Cited by 425
Self-citationA deterministic annealing approach to clustering
Rose, K., Gurewitz, E., & Fox, G. (1990) · Pattern Recognition Letters · doi:10.1016/0167-8655(90)90010-y · Cited by 382
Self-citationSwift: Fast, Reliable, Loosely Coupled Parallel Computation
Zhao, Y., Hategan, M., Clifford, B., Foster, I., von Laszewski, G., Nefedova, V., Raicu, I., Stef-Praun, T., & Wilde, M. (2007) · 2007 IEEE Congress on Services (Services 2007) · doi:10.1109/services.2007.63 · Cited by 352
Applications of Convex Analysis to Multidimensional Scaling
de Leeuw, J. (2000) · eScholarship (California Digital Library) · Cited by 326
(2003) · Cited by 312
Pallickara, S., & Fox, G. (2003) · Cited by 216
Self-citationHigh Performance Parallel Computing with Clouds and Cloud Technologies
Ekanayake, J., & Fox, G. (2010) · Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering · doi:10.1007/978-3-642-12636-9_2 · Cited by 183
Self-citationAll-Pairs: An Abstraction for Data-Intensive Computing on Campus Grids
Moretti, C. M., Bui, H., Hollingsworth, K. P., Rich, B., Flynn, P. J., & Thain, D. (2009) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2009.49 · Cited by 73
Distributed PageRank computation based on iterative aggregation-disaggregation methods
Zhu, Y., Ye, S., & Li, X. (2005) · Proceedings of the 14th ACM international conference on Information and knowledge management · doi:10.1145/1099554.1099705 · Cited by 65 · cited 1×
“There already exist many published work optimizing PageRank algorithm, like some of them accelerate computation by exploring the block structure of hyperlinks[31, 32].”
Method
Cited by
Chen, M., Mao, S., & Liu, Y. (2014) · Mobile Networks and Applications · doi:10.1007/s11036-013-0489-0 · Cited by 2,913
The rise of big data on cloud computing: Review and open research issues
Hashem, I. A. T., Yaqoob, I., Anuar, N. B., Mokhtar, S., Gani, A., & Ullah Khan, S. (2015) · Information Systems · doi:10.1016/j.is.2014.07.006 · Cited by 2,656
(2011) · doi:10.5555/1972457.1972488 · Cited by 1,619
PowerGraph: distributed graph-parallel computation on natural graphs
Gonzalez, J. E., Low, Y., Gu, H., Bickson, D., & Guestrin, C. (2012) · doi:10.5555/2387880.2387883 · Cited by 1,451
Toward Scalable Systems for Big Data Analytics: A Technology Tutorial
Hu, H., Wen, Y., Chua, T.-S., & Li, X. (2014) · IEEE Access · doi:10.1109/access.2014.2332453 · Cited by 1,099
Metadata
- Authors
- Ekanayake, J., Li, H., Zhang, B., Gunarathne, T., Bae, S.-H., Qiu, J., & Fox, G.
- Venue
- Proceedings of the 19th ACM International Symposium on High Performance Distributed Computing
- Publisher
- ACM
- Published
- 2010-06-21
- Pages
- 810-818
- OpenAlex
- W1976860187
- Cited by
- 777
- References
- 22
- FWCI
- 63.86
- 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.