Is there any standard equation for the cost to process n items through a pipeline of fixed cost stages? Maybe from queuing theory? Like t_total(n) = t_single + t_worst*(n - 1) where t_single is the sum of the stage costs and t_worst is cost of the most expensive stage?
But I'm pretty sure the equation I proposed already accounts for that. Can you show an example where it fails?
-
-
t = [1, 3, 1, 3], n=2. The formula gives 7 + 3 = 10. However, this will take 12 steps. Diagram in a pastebinhttps://pastebin.com/N0JfzxP6
-
You cheated by counting two different ways :) Here is the same diagram you drew, but for a single input. Using your counting, the "t single" is clearly 9, not 7. So in your example, the formula gives 9 + 3 = 12, which is exactly what your diagram showed.https://pastebin.com/2RicjZqX
- Show replies
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.