Content deleted Content added
m apparent M/R origin IEEE IPPS 1993 Tag: Reverted |
Michaelmalak (talk | contribs) Undid revision 1223249519 by JohnPritchard (talk) cite does not appear to be about map/reduce even though it contains both those words in the title |
||
Line 1:
{{Short description|Parallel programming model}}
'''MapReduce''' is a [[programming model]] and an associated implementation for processing and generating [[big data]] sets with a [[Parallel computing|parallel]], [[distributed computing|distributed]] algorithm on a [[Cluster (computing)|cluster]].
A MapReduce program is composed of a [[map (parallel pattern)|''map'']] [[procedure (computing)|procedure]], which performs filtering and sorting (such as sorting students by first name into queues, one queue for each name), and a ''[[Reduce (parallel pattern)|reduce]]'' method, which performs a summary operation (such as counting the number of students in each queue, yielding name frequencies). The "MapReduce System" (also called "infrastructure" or "framework") orchestrates the processing by [[Marshalling (computer science)|marshalling]] the distributed servers, running the various tasks in parallel, managing all communications and data transfers between the various parts of the system, and providing for [[Redundancy (engineering)|redundancy]] and [[Fault-tolerant computer system|fault tolerance]].
|