c*****t
发帖数: 1879 | 1 Given a set of integers, you can distribute it to a network of computers
(2^n) and compute the sum in a pyrmid fashsion.
What is the name of this approach? Not map/reduce, but occurred much
earlier. Thanks. |
t****t
发帖数: 6806 | 2 divide and conquer?
【在 c*****t 的大作中提到】
: Given a set of integers, you can distribute it to a network of computers
: (2^n) and compute the sum in a pyrmid fashsion.
: What is the name of this approach? Not map/reduce, but occurred much
: earlier. Thanks.
|
h****8
发帖数: 599 | |
c*r
发帖数: 278 | 4 Scatter/Gather?
【在 c*****t 的大作中提到】
: Given a set of integers, you can distribute it to a network of computers
: (2^n) and compute the sum in a pyrmid fashsion.
: What is the name of this approach? Not map/reduce, but occurred much
: earlier. Thanks.
|
B*******g
发帖数: 1593 | 5 像是merge sort啊
【在 c*****t 的大作中提到】
: Given a set of integers, you can distribute it to a network of computers
: (2^n) and compute the sum in a pyrmid fashsion.
: What is the name of this approach? Not map/reduce, but occurred much
: earlier. Thanks.
|
c*****t
发帖数: 1879 | 6 感觉不是啊。
【在 t****t 的大作中提到】
: divide and conquer?
|
g*****g
发帖数: 34805 | 7 Dynamic programming? Use a pyramic to computer local optimum towards
overall optimum is commonly seen in DP.
【在 c*****t 的大作中提到】
: Given a set of integers, you can distribute it to a network of computers
: (2^n) and compute the sum in a pyrmid fashsion.
: What is the name of this approach? Not map/reduce, but occurred much
: earlier. Thanks.
|
c*****t
发帖数: 1879 | 8 Nope. Given 8 numbers, if we can distribute them to 4 machines,
we can compute the sum this way
1 (final round)
/ \
1 2 (second round)
/ \ / \
1 3 2 4 (first round)
That is, each machine compute sum of 2 values, then machine 3 send
value to machine 1, machine 4 send value to machine 2. In the last
round, machine 2 send value to machine 1 and compute the final result.
【在 g*****g 的大作中提到】
: Dynamic programming? Use a pyramic to computer local optimum towards
: overall optimum is commonly seen in DP.
|
p***o
发帖数: 1252 | 9 Parallel reduction? Google does return some relevant results with this
keyword.
【在 c*****t 的大作中提到】
: Nope. Given 8 numbers, if we can distribute them to 4 machines,
: we can compute the sum this way
: 1 (final round)
: / \
: 1 2 (second round)
: / \ / \
: 1 3 2 4 (first round)
: That is, each machine compute sum of 2 values, then machine 3 send
: value to machine 1, machine 4 send value to machine 2. In the last
: round, machine 2 send value to machine 1 and compute the final result.
|
