In this paper,we present an approximate formula for calculating th speedup of a concurrent non-DO loop.The execution pattern of a concurrent non-Do loop is analyzed.As a result,the optimal concurrent step for a non-DO...In this paper,we present an approximate formula for calculating th speedup of a concurrent non-DO loop.The execution pattern of a concurrent non-Do loop is analyzed.As a result,the optimal concurrent step for a non-DO loop is presened and proved.With the analysis of the speedup of a concurrent non-DO loop,a simple and useful approximate formula is deduced,which is just the mathematical limit of speedup when the number of iterations is approaching infinity.展开更多
文摘In this paper,we present an approximate formula for calculating th speedup of a concurrent non-DO loop.The execution pattern of a concurrent non-Do loop is analyzed.As a result,the optimal concurrent step for a non-DO loop is presened and proved.With the analysis of the speedup of a concurrent non-DO loop,a simple and useful approximate formula is deduced,which is just the mathematical limit of speedup when the number of iterations is approaching infinity.
