Google's MapReduce programming model - Revisited

Science of Computer Programming

Volumn 68, Issue 3, 2007, Pages 208-237

  Lämmel, Ralf ^a  

^a MICROSOFT   (United States)

Author keywords

Data processing; Distributed programming; Executable specification; Haskell; List homomorphism; Map; MapReduce; Parallel programming; Reduce; Sawzall; Software design; Typed functional programming

Indexed keywords

COMPUTATIONAL METHODS; DATA PROCESSING; FUNCTIONAL PROGRAMMING; MATHEMATICAL MODELS; PARALLEL PROGRAMMING; SOFTWARE DESIGN;

DISTRIBUTED PROGRAMMING; EXECUTABLE SPECIFICATION; LIST HOMOMORPHISM; TYPED FUNCTIONAL PROGRAMMING;

COMPUTER PROGRAMMING LANGUAGES;

EID: 34548493644     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.scico.2007.07.001     Document Type: Article

References (33)

1. Augusteijn L. Sorting morphisms. In: Swierstra S., Henriques P., and Oliveira J. (Eds). 3rd International Summer School on Advanced Functional Programming. LNCS vol. 1608 (September 1998), Springer-Verlag 1-27
2. Backus J.W. Can programming be liberated from the von Neumann style? A functional style and its algebra of programs. Communications of the ACM 21 8 (1978) 613-641
3. Bird R., and de Moor O. Algebra of Programming (1996), Prentice-Hall, Inc.
4. Bird R.S. An introduction to the theory of lists. Proceedings of the NATO Advanced Study Institute on Logic of Programming and Calculi of Discrete Design (1987), Springer-Verlag 5-42
5. Blelloch G.E. Programming parallel algorithms. Communications of the ACM 39 3 (1996) 85-97
6. Borodin A., and Hopcroft J.E. Routing, merging and sorting on parallel models of computation. STOC'82: Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing (1982), ACM Press 338-344
7. In: Bougé L., Fraigniaud P., Mignotte A., and Robert Y. (Eds). Proceedings of the 2nd International Euro-Par Conference on Parallel Processing, 2 volumes, EURO-PAR'96. LNCS vol. 1123-1124 (1996), Springer-Verlag
8. W.-N. Chin, J. Darlington, Y. Guo, Parallelizing conditional recurrences, in: Bougé et al. [7], Volume 1/2, pp. 579-586
9. Cole M. Parallel Programming with List Homomorphisms. Parallel Processing Letters 5 (1995) 191-203
10. J. Dean, S. Ghemawat, MapReduce: Simplified Data Processing on Large Clusters, in: OSDI'04, 6th Symposium on Operating Systems Design and Implementation, Sponsored by USENIX, in cooperation with ACM SIGOPS, 2004, pp. 137-150
11. DeWitt D.J., Ghandeharizadeh S., Schneider D.A., Bricker A., Hsiao H.-I., and Rasmussen R. The Gamma Database Machine Project. IEEE Transactions on Knowledge and Data Engineering 2 1 (1990) 44-62
12. Gamma E., Helm R., Johnson R., and Vlissides J. Design Patterns (1995), Addison Wesley
13. Ghemawat S., Gobioff H., and Leung S.-T. The Google file system. 19th ACM Symposium on Operating Systems Principles, Proceedings (2003), ACM Press 29-43
14. Gibbons J. A pointless derivation of radix sort. Journal of Functional Programming 9 3 (1999) 339-346
15. Gibbons J. Calculating Functional Programs. In: Backhouse R.C., Crole R.L., and Gibbons J. (Eds). Algebraic and Coalgebraic Methods in the Mathematics of Program Construction, International Summer School and Workshop, 10-14 April, Oxford, UK, 2000, Revised Lectures. LNCS vol. 2297 (2002), Springer-Verlag 149-202
16. Gibbons J., and Jones G. The under-appreciated unfold. ICFP '98: Proceedings of the third ACM SIGPLAN International Conference on Functional Programming (1998), ACM Press 273-279
17. S. Gorlatch, Systematic efficient parallelization of scan and other list homomorphisms, in: Bougé et al. [7], Volume 2/2, pp. 401-408
18. Hirschberg D. Fast parallel sorting algorithms. Communications of the ACM 21 8 (1978) 657-661
19. Hughes J. Why functional programming matters. The Computer Journal 32 2 (1989) 98-107
20. Hutton G. A tutorial on the universality and expressiveness of fold. Journal of Functional Programming 9 4 (1999) 355-372
21. G. Malcolm, Algebraic data types and program transformation, Ph.D. Thesis, Groningen University, 1990
22. E. Meijer, Calculating compilers, Ph.D. Thesis, Nijmegen University, 1992
23. Meijer E., Fokkinga M., and Paterson R. Functional programming with bananas, lenses, envelopes and barbed wire. In: Hughes J. (Ed). Proceedings of 5th ACM Conference on Functional Programming Languages and Computer Architecture, FPCA'91. LNCS vol. 523 (1991), Springer-Verlag 124-144
24. In: Peyton Jones S. (Ed). Haskell 98 Language and Libraries - The Revised Report (2003), Cambridge University Press, Cambridge, England
25. S. Peyton Jones, M. Shields, Lexically scoped type variables, March 2004. Available at http://research.microsoft.com/Users/simonpj/papers/scoped-tyvars/
26. R. Pike, S. Dorward, R. Griesemer, S. Quinlan, Interpreting the data: Parallel analysis with Sawzall, in: Dynamic Grids and Worldwide Computing, Scientific Programming 14 (2006) (special issue)
27. Skillicorn D.B. Architecture-independent parallel computation. IEEE Computer 23 12 (1990) 38-50
28. Skillicorn D.B. Foundations of Parallel Programming. Cambridge Series in Parallel Computation, No. 6 (1994), Cambridge University Press
29. Skillicorn D.B., and Talia D. Models and languages for parallel computation. ACM Computing Surveys 30 2 (1998) 123-169
30. Steele Jr. G.L. Common Lisp: The Language. 2nd edition (1990), Digital Press
31. Stuckey P.J., and Sulzmann M. A theory of overloading. ACM TOPLAS 27 6 (2005) 1216-1269
32. Taniar D., and Rahayu J.W. Parallel database sorting. Information Sciences and Applications: An International Journal 146 1-4 (2002) 171-219
33. Thompson S. The Craft of Functional Programming (1996), Addison Wesley 2nd edition in 1999