skip to main content
10.1007/978-3-642-25591-5_39guideproceedingsArticle/Chapter ViewAbstractPublication PagesConference Proceedingsacm-pubtype
Article

Sorting, searching, and simulation in the mapreduce framework

Published: 05 December 2011 Publication History

Abstract

We study the MapReduce framework from an algorithmic standpoint, providing a generalization of the previous algorithmic models for MapReduce. We present optimal solutions for the fundamental problems of all-prefix-sums, sorting and multi-searching. Additionally, we design optimal simulations of the the well-established PRAM and BSP models in MapReduce, immediately resulting in optimal solutions to the problems of computing fixed-dimensional linear programming and 2-D and 3-D convex hulls.

References

[1]
Alon, N., Megiddo, N.: Parallel linear programming in fixed dimension almost surely in constant time. J. ACM 41(2), 422-434 (1994).
[2]
Dean, J., Ghemawat, S.: MapReduce: simplified data processing on large clusters. Commun. ACM 51(1), 107-113 (2008).
[3]
Dean, J., Ghemawat, S.: MapReduce: a flexible data processing tool. Commun. ACM 53(1), 72-77 (2010).
[4]
DeWitt, D.J., Stonebraker, M.: MapReduce: A major step backwards. Database Column (2008), http://databasecolumn.vertica.com/database-innovation/ mapreduce-a-major-step-backwards/.
[5]
Eisenstat, S.C.: O (log* n ) algorithms on a Sum-CRCW PRAM. Computing 79(1), 93-97 (2007).
[6]
Feldman, J., Muthukrishnan, S., Sidiropoulos, A., Stein, C., Svitkina, Z.: On distributing symmetric streaming computations. In: Teng, S.H. (ed.) SODA, pp. 710-719. SIAM (2008).
[7]
Goodrich, M.T.: Randomized fully-scalable BSP techniques for multi-searching and convex hull construction. In: SODA, pp. 767-776 (1997).
[8]
Goodrich, M.T.: Communication-efficient parallel sorting. SIAM Journal on Computing 29(2), 416-432 (1999).
[9]
Goodrich, M.T., Sitchinava, N., Zhang, Q.: Sorting, searching, and simulation in the mapreduce framework (2011), http://arxiv.org/abs/1101.1902.
[10]
JáJá, J.: An Introduction to Parallel Algorithms. Addison-Wesley, Reading (1992).
[11]
Kannan, S., Naor, M., Rudich, S.: Implicit representation of graphs. In: 20th Annual ACM Symposium on Theory of Computing (STOC), pp. 334-343 (1988).
[12]
Karloff, H., Suri, S., Vassilvitskii, S.: A model of computation for MapReduce. In: Proc. ACM-SIAM Sympos. Discrete Algorithms (SODA), pp. 938-948 (2010).
[13]
Valiant, L.G.: A bridging model for parallel computation. Comm. ACM 33, 103-111 (1990).

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings
ISAAC'11: Proceedings of the 22nd international conference on Algorithms and Computation
December 2011
775 pages
ISBN:9783642255908
  • Editors:
  • Takao Asano,
  • Shin-ichi Nakano,
  • Yoshio Okamoto,
  • Osamu Watanabe

Sponsors

  • Support Center for Advanced Telecommunications Technology Research
  • Kayamori Foundation of Informational Science Advancement
  • Inoue Foundation for Science
  • The Telecommunications Advancement Foundation
  • Tokyo Institute of Technology

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 05 December 2011

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 06 Feb 2025

Other Metrics

Citations

Cited By

View all

View Options

View options

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media