单选题:When measure the performance of parallel algorithm, we often use
When measure the performance of parallel algorithm, we often use work load ($$W(n)$$) and worst-case running time ($$T(n)$$). How many evaluation metrics are asymptotically equivalent to $$W(n)$$ and $$T(n)$$? @[C](2)
* $$P(n) = W(n)/T(n)$$ processors and $$T(n)$$ time (on a PRAM)
* $$W(n)/p$$ time using any number of $$p \geq W(n)/T(n)$$ processors (on a PRAM)
* $$W(n)/p + T(n)$$ time using any number of $$p$$ processors (on a PRAM)
A. 0
B. 1
C. 2
D. 3
A.0
B.1
C.2
D.3
答案:C
* $$P(n) = W(n)/T(n)$$ processors and $$T(n)$$ time (on a PRAM)
* $$W(n)/p$$ time using any number of $$p \geq W(n)/T(n)$$ processors (on a PRAM)
* $$W(n)/p + T(n)$$ time using any number of $$p$$ processors (on a PRAM)
A. 0
B. 1
C. 2
D. 3
A.0
B.1
C.2
D.3
答案:C