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?
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
-
-
Oof, caught red-handed! I think t_single is 8 though, since the dot is already out at time 9 ;)
-
It doesn't matter how you count, you just have to count the same. So if you want t_single to be 8, your example has to be 11. Either way, my formula works correctly for your example as far as I can tell, so it is not a case where the formula fails?
- 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.