Reduction operator

In computer science, the reduction operator[1] is a type of operator that is commonly used in parallel programming to reduce the elements of an array into a single result. Reduction operators are associative and often (but not necessarily) commutative.[2][3][4] The reduction of sets of elements is an integral part of programming models such as Map Reduce, where a reduction operator is applied (mapped) to all elements before they are reduced. Other parallel algorithms use reduction operators as primary operations to solve more complex problems. Many reduction operators can be used for broadcasting to distribute data to all processors.

  1. ^ "Reduction Clause". www.dartmouth.edu. Dartmouth College. 23 March 2009. Retrieved 26 September 2016.
  2. ^ Solihin, Yan (2016). Fundamentals of Parallel Multicore Architecture. CRC Press. p. 75. ISBN 978-1-4822-1118-4.
  3. ^ Chandra, Rohit (2001). Parallel Programming in OpenMP. Morgan Kaufmann. pp. 59–77. ISBN 1558606718.
  4. ^ Cole, Murray (2004). "Bringing skeletons out of the closet: a pragmatic manifesto for skeletal parallel programming" (PDF). Parallel Computing. 30 (3): 393. doi:10.1016/j.parco.2003.12.002. hdl:20.500.11820/8eb79d42-de83-4cfb-9faa-30d9ac3b3839.

© MMXXIII Rich X Search. We shall prevail. All rights reserved. Rich X Search