Sciweavers

4 search results - page 1 / 1
» Improved On-Line Broadcast Scheduling with Deadlines
Sort
View
COCOON
2006
Springer
13 years 8 months ago
Improved On-Line Broadcast Scheduling with Deadlines
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 ...
Feifeng Zheng, Stanley P. Y. Fung, Wun-Tat Chan, F...
COCOON
2004
Springer
13 years 10 months ago
New Results on On-Demand Broadcasting with Deadline via Job Scheduling with Cancellation
This paper studies the on-demand broadcasting problem with deadlines. We give the first general upper bound and improve existing lower bounds on the com
Wun-Tat Chan, Tak Wah Lam, Hing-Fung Ting, Prudenc...
EDBT
2008
ACM
85views Database» more  EDBT 2008»
14 years 4 months ago
Optimizing on-demand data broadcast scheduling in pervasive environments
Data dissemination in pervasive environments is often accomplished by on-demand broadcasting. The time critical nature of the data requests plays an important role in scheduling t...
Rinku Dewri, Indrakshi Ray, Indrajit Ray, Darrell ...
ICTCS
2005
Springer
13 years 10 months ago
Laxity Helps in Broadcast Scheduling
We study the effect of laxity, or slack time, on the online scheduling of broadcasts with deadlines. The laxity of a request is defined to be the ratio between its span (differe...
Stanley P. Y. Fung, Francis Y. L. Chin, Chung Keun...