0
$\begingroup$

I would like to know if someone can give me an example of how a prefix sum which contains 8 elements can be computed with just three processors.

Prefix sum

$\endgroup$
  • $\begingroup$ I have a hard time understanding your question, since a lot of context is missing. Can you explain what is a prefix sum, for example? Also it seems that $n$ is constant, so I'm not sure what you mean by $O(n)$. $\endgroup$ – Yuval Filmus May 27 '20 at 12:06
  • $\begingroup$ I mean what would be the timing of this algorithm with just three processors. I've inserted a link for a description of what prefix sums are. $\endgroup$ – ChickenMan May 27 '20 at 12:11
  • 1
    $\begingroup$ You can compute the prefix sums using a single processor. The two other processors can stay idle. $\endgroup$ – Yuval Filmus May 27 '20 at 19:23

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.