Off-line algorithms for minimizing total flow time in broadcast scheduling

Authors:
Wun-Tat Chan;Francis Y. L. Chin;Yong Zhang;Hong Zhu;Hong Shen;Prudence W. H. Wong
Affiliations:
Department of Computer Science, University of Hong Kong, Hong Kong;Department of Computer Science, University of Hong Kong, Hong Kong;Department of Computer Science, University of Hong Kong, Hong Kong;Department of Computer Science and Engineering, Fudan University, China;Graduate School of Information Science, Japan Advanced Institute of Science and Technology, Japan;Department of Computer Science, University of Liverpool, UK
Venue:
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Year:
2005

Citing 7
Cited 0

A linear-time algorithm for concave one-dimensional dynamic programming

Information Processing Letters
Minimizing maximum response time in scheduling broadcasts

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Dependent Rounding in Bipartite Graphs

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
A maiden analysis of Longest Wait First

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Algorithms for Minimizing Response Time in Broadcast Scheduling

Algorithmica
Approximating the average response time in broadcast scheduling

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the off-line broadcast scheduling problem to minimize total (or average) flow time. Assume the server has k pages and the requests arrive at n distinct times, we give the first algorithm to find the optimal schedule for the server with a single channel, in O(k3(n+k)k−−1) time. For m-channel case, i.e., the server can broadcast m different pages at a time where m k, we find the optimal schedule in O(nk−−m) time when k and m are constants. In the single channel case, we also give a simple linear-time approximation algorithm to minimize average flow time, which achieves an additive (k–1)/2-approximation.