Question: It does seem like if N is super big, we would have to split the scan into a few more scans in the second step, therefore leading to some more 'result combining' and thus longer span (in the middle block). However the extra number of 'result combining' we do is just logarithmic of N, so would that be an example of a very 'scalable system'?
This comment was marked helpful 0 times.
kayvonf
@Yuyang. Correct. The span is log N, so as N gets bigger span of the computation is going to increase.
Question: It does seem like if
N
is super big, we would have to split the scan into a few more scans in the second step, therefore leading to some more 'result combining' and thus longer span (in the middle block). However the extra number of 'result combining' we do is just logarithmic of N, so would that be an example of a very 'scalable system'?This comment was marked helpful 0 times.
@Yuyang. Correct. The span is log N, so as N gets bigger span of the computation is going to increase.
This comment was marked helpful 1 times.