Chan's algorithm Parallel Implementation ( Variance Calculations): Difference between revisions
Jump to navigation
Jump to search
(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") |
No edit summary |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O(log n)$ | $O(\log n)$ | ||
== Space Complexity == | == Space Complexity == | ||
Latest revision as of 09:42, 10 April 2023
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