Analysis of parallel algorithms: Difference between revisions

Content deleted Content added
Line 10:
Several useful results follow from the definitions of work, span and cost:
 
* ''Work law''. The cost is always at least the work: {{math|''pT<sub>p</sub>'' ≥ ''T''<sub>1</sub>}}. This follows from the fact that {{mvar|p}} processors can perform at most {{mvar|p}} operations in parallel.<ref name="clrs"/><ref name="casanova"/>
* ''Span law''. A finite number {{mvar|p}} of processors cannot outperform an infinite number, so that {{math|''T<sub>p</sub>'' ≥ ''T''<sub>∞</sub>}}.<ref name="clrs"/>