Fri, 04 Jul 2008 23:37:12 BST CiteULike: AbnerCYH's distributed http://www.citeulike.org/user/AbnerCYH/tag/distributed CiteULike.org en-gb Copyright © 2004-2008 citeulike.org http://www.citeulike.org/user/AbnerCYH/article/2269937 <i>(December 2004)</i><br /><br />MapReduce is a programming model and an associated implementation for processing and generating large data sets. Users specify a map function that processes a key/value pair to generate a set of intermediate key/value pairs, and a reduce function that merges all intermediate values associated with the same intermediate key. Many real world tasks are expressible in this model, as shown in the paper. Programs written in this functional style are automatically parallelized and executed on a large cluster of commodity machines. The run-time system takes care of the details of partitioning the input data, scheduling the program's execution across a set of machines, handling machine failures, and managing the required inter-machine communication. This allows programmers without any experience with parallel and distributed systems to easily utilize the resources of a large distributed system. Our implementation of MapReduce runs on a large cluster of commodity machines and is highly scalable: a typical MapReduce computation processes many terabytes of data on thousands of machines. Programmers find the system easy to use: hundreds of MapReduce programs have been implemented and upwards of one thousand MapReduce jobs are executed on Google's clusters every day. MapReduce: Simplified Data Processing on Large Clusters Jeffrey Dean Sanjay Ghemawat (December 2004) 2008-01-21T20:16:16-00:00 2004 algorithms data_structure distributed sys_performance http://www.citeulike.org/user/AbnerCYH/article/1771611 <i>Mob. Netw. Appl., Vol. 9, No. 2. (April 2004), pp. 141-149.</i> Distributed construction of connected dominating set in wireless ad hoc networks Peng-Jun Wan Khaled Alzoubi Ophir Frieder doi:10.1023/B:MONE.0000013625.87793.13 Mob. Netw. Appl., Vol. 9, No. 2. (April 2004), pp. 141-149. 2007-10-15T23:20:49-00:00 2004 Mob. Netw. Appl. 9 2 141 149 ACM Press algorithms distributed graph