A dynamic programming approach of finding an optimal broadcast schedule in minimizing total flow time
We study the problem of (off-line) broadcast scheduling in minimizing total flow time and propose a dynamic programming approach to compute an optimal broadcast schedule. Suppose the broadcast server has k pages and the last page request arrives at time n. The optimal schedule can be computed in O(k3(n+k)k−1) time for the case that the server has a single broadcast channel. For m channels case, i.e., the server can broadcast m different pages at a time where m < k, the optimal schedule can be computed in O(nk−m) time when k and m are constants. Note that this broadcast scheduling problem is NP-hard when k is a variable and will take O(nk−m+1) time when k is fixed and m ≥ 1 with the straightforward implementation of the dynamic programming approach.
KeywordsBroadcast scheduling flow time minimization dynamic programming
Unable to display preview. Download preview PDF.
- Bansal N, Charikar M, Khanna S, Naor J (2005) Approximating the average response time in broadcast scheduling. In Proc. 16th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 215–221Google Scholar
- Bansal N, Coppersmith D, Sviridenko M (2006) Improved approximation algorithms for broadcast scheduling. In Proc. 17th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 344–353Google Scholar
- Bartal Y, Muthukrishnan S (2000) Minimizing maximum response time in scheduling broadcasts. In Proc. 11th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 558–559Google Scholar
- Gandhi R, Khuller S, Parthasarathy S, Srinivasan A (2002) Dependent rounding in bipartite graphs. In Proc. 43th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 323–332Google Scholar