next up previous
Next: Optimal mapping and scheduling Up: Optimizing the number of Previous: Optimizing the number of

Proof

The ``steady-state'' condition tex2html_wrap_inline1120 in Equation (1) can be rewritten as
displaymath1122
Consider tex2html_wrap_inline1124 (see Equation (1)). The minimum of tex2html_wrap_inline942 is obtained for tex2html_wrap_inline1128. The expression of tex2html_wrap_inline942 shows that is a non-increasing function of P when tex2html_wrap_inline1134, and then a non-decreasing function of P when tex2html_wrap_inline1138. Also, note that tex2html_wrap_inline1018 does not depend on P (except than through the condition tex2html_wrap_inline1144). Then the result follows according to a simple case analysis.

For large domains, we will have tex2html_wrap_inline1146, and it is no surprise that the optimal number of processors is the one required to ensure steady-state execution.



Jack Dongarra
Sat Feb 8 08:17:58 EST 1997