Unformatted text preview: MapReduce In the past, functional programming, and higher-order functions in particular, have been considered esoteric and unimportant by most programmers. But the advent of highly parallel computation is changing that, because functional programming has the very useful property that the different pieces of a program dont interfere with each other, so it doesnt matter in what order they are invoked. Later this semester, when we have more sophisticated functional mechanisms to work with, well be examining one famous example of functional programming at work: the MapReduce programming paradigm developed by Google that uses higher-order functions to allow a programmer to process large amount of data in parallel on many computers. Much of the computing done at Google consists of relatively simple algorithms applied to massive amounts of data, such as the entire World Wide Web. Its routine for them to use clusters consisting of many thousands of processors, all running the same program, with a distributed filesystem that gives each processor local...
View Full Document
This note was uploaded on 02/17/2010 for the course COMPUTER S 26275 taught by Professor Harvey,b during the Spring '10 term at Berkeley.
- Spring '10
- Functional Programming