Chan's algorithm Parallel Implementation ( Variance Calculations)

From Algorithm Wiki

Revision as of 11:15, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(log n)$ == Space Complexity == $O({1})$ per processor words (Each processor maintains O(1) information related to count, mean, M2) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == EREW(??) PRAM == Year == 1979 == Reference == http://i.stanford.edu/pub/cstr/reports/cs/tr/79/773/CS-TR-79-773.pdf")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O(log n)$

Space Complexity

$O({1})$ per processor words

(Each processor maintains O(1) information related to count, mean, M2)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

EREW(??) PRAM

Year

1979

Reference

http://i.stanford.edu/pub/cstr/reports/cs/tr/79/773/CS-TR-79-773.pdf

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Chan%27s_algorithm_Parallel_Implementation_(_Variance_Calculations)&oldid=45384"