Revision as of 08:58, 28 August 2017 edit KolbertBot (talk \| contribs) Bots 1,166,042 edits m Bot: HTTP→HTTPS ← Previous edit		Revision as of 13:55, 7 October 2018 edit undo Haseleyi (talk \| contribs) 14 edits Brent's original paper found a <= for the right side of the Tp inequality. Looks like Blelloch's may have miscited this. Tag: Visual edit Next edit →
Line 31: An alternative statement of the law bounds {{mvar\|T<sub>p</sub>}} above and below by :<math>\frac{T_1}{p} \leq T_p <\leq \frac{T_1}{p} + T_\infty</math>. showing that the span (depth) {{math\|''T''<sub>∞</sub>}} and the work {{math\|''T''<sub>1</sub>}} together provide reasonable bounds on the computation time.<ref>{{Cite ~~name~~journal\|last=~~"cacm"~~Brent\|first=Richard P.\|date=1974-04-01\|title=The Parallel Evaluation of General Arithmetic Expressions\|url=http://dl.acm.org/citation.cfm?id=321812.321815\|journal=Journal of the ACM (JACM)\|volume=21\|issue=2\|pages=201–206\|doi=10.1145/321812.321815\|issn=0004-5411}}</ref> ==References==

Analysis of parallel algorithms: Difference between revisions