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?
-
-
my assumptions are the placement of the worst cost stage matters as well, but not in the limit n->infinity where only the worst cost stage would matter
-
no wait it wouldn't matter, I think your equation is roughly correct
- 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.