| May 6, 2008 7:08 PM PDT | |
A law stating that (under certain assumptions) the maximum speedup that can be obtained by running an algorithm on a system of P processors is
where ? is the serial fraction of the program, and T(n) is the total execution time running on n processors. See speedup and serial fraction.
For more complete information about compiler optimizations, see our Optimization Notice.
Comments (0) 
Trackbacks (0)
Leave a comment 
To obtain technical support, please go to Software Support.