Application:Optimal Pipeline
A piece of data of size D goes through a pipeline of n stages.
Each stage has associated
- oi -- overhead of i-th stage
- bi -- bandwidth of i-th stage (bits/sec)
How should data be broken up into k pieces, not necessarily of equal size, so as to minimize time through the pipeline?