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?
Yeah I'm not sure why it would matter where the worst case stage(s) would be...
-
-
ya I was just thinking that you would want the worst cast stage to start as soon as possible so less time is wasted but then realized that just cancels out with it idling once its done instead
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
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.