Improved on-line broadcast scheduling with deadlines

Authors:
Stanley P. Fung;Feifeng Zheng;Wun-Tat Chan;Francis Y. Chin;Chung Keung Poon;Prudence W. Wong
Affiliations:
Department of Computer Science, University of Leicester, Leicester, UK;School of Management, Xi'an JiaoTong University, Xi'an, China;Department of Computer Science, The University of Hong Kong, Hong Kong, Hong Kong;Department of Computer Science, The University of Hong Kong, Hong Kong, Hong Kong;Department of Computer Science, City University of Hong Kong, Hong Kong, Hong Kong;Department of Computer Science, University of Liverpool, Liverpool, UK
Venue:
Journal of Scheduling
Year:
2008

Citing 9
Cited 3

On-line scheduling of jobs with fixed start and end times

Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Online computation and competitive analysis

Online computation and competitive analysis
Scheduling data broadcast to “impatient” users

Proceedings of the 1st ACM international workshop on Data engineering for wireless and mobile access
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
Broadcast scheduling: when fairness is fine

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

Algorithmica
Scheduling broadcasts with deadlines

Theoretical Computer Science - Special papers from: COCOON 2003
A tight lower bound for job scheduling with cancellation

Information Processing Letters

A note on on-line broadcast scheduling with deadlines

Information Processing Letters
Better scalable algorithms for broadcast scheduling

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Online scheduling with preemption or non-completion penalties

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study an on-line broadcast scheduling problem in which requests have deadlines, and the objective is to maximize the weighted throughput, i.e., the weighted total length of the satisfied requests. For the case where all requested pages have the same length, we present an online deterministic algorithm named BAR and prove that it is 4.56-competitive. This improves the previous algorithm of (Kim, J.-H., Chwa, K.-Y. in Theor. Comput. Sci. 325(3):479---488, 2004) which is shown to be 5-competitive by (Chan, W.-T., et al. in Lecture Notes in Computer Science, vol. 3106, pp. 210---218, 2004). In the case that pages may have different lengths, we give a ( $\Delta+ 2\sqrt{\Delta}+2$ )-competitive algorithm where Δ is the ratio of maximum to minimum page lengths. This improves the (4Δ+3)-competitive algorithm of (Chan, W.-T., et al. in Lecture Notes in Computer Science, vol. 3106, pp. 210---218, 2004). We also prove an almost matching lower bound of 驴(Δ/log驴Δ). Furthermore, for small values of Δ we give better lower bounds.