Scheduling broadcasts with deadlines

Authors:
Jae-Hoon Kim;Kyung-Yong Chwa
Affiliations:
Department of Computer Engineering, Pusan University of Foreign Studies, Pusan 608-738, Republic of Korea;Department of Electrical Engineering Computer Science, Korea Advanced Institute of Science and Technology, Taejon 305-701, Republic of Korea
Venue:
Theoretical Computer Science - Special papers from: COCOON 2003
Year:
2004

Citing 9
Cited 22

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

Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Scheduling on-demand broadcasts: new metrics and algorithms

MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Scheduling data broadcast to “impatient” users

Proceedings of the 1st ACM international workshop on Data engineering for wireless and mobile access
Online interval scheduling

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
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
Developments from a June 1996 seminar on Online algorithms: the state of the art

Developments from a June 1996 seminar on Online algorithms: the state of the art
Algorithms for Minimizing Response Time in Broadcast Scheduling

Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization

Scheduling real-time requests in on-demand data broadcast environments

Real-Time Systems
Broadcast scheduling: algorithms and complexity

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Optimizing on-demand data broadcast scheduling in pervasive environments

EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Competitive analysis of most-request-first for scheduling broadcasts with start-up delay

Theoretical Computer Science
A near optimal scheduler for on-demand data broadcasts

Theoretical Computer Science
Improved on-line broadcast scheduling with deadlines

Journal of Scheduling
A note on on-line broadcast scheduling with deadlines

Information Processing Letters
Online scheduling to minimize the maximum delay factor

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Improved Randomized Online Scheduling of Unit Length Intervals and Jobs

Approximation and Online Algorithms
Stochastic Depletion Problems: Effective Myopic Policies for a Class of Dynamic Optimization Problems

Mathematics of Operations Research
Scheduling algorithms for broadcasting media with multiple distortion measures

IEEE Transactions on Wireless Communications
An online scalable algorithm for average flow time in broadcast scheduling

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Better scalable algorithms for broadcast scheduling

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
New models and algorithms for throughput maximization in broadcast scheduling

WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Broadcast scheduling: Algorithms and complexity

ACM Transactions on Algorithms (TALG)
Improved online scheduling in maximizing throughput of equal length jobs

CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Laxity helps in broadcast scheduling

ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Improved on-line broadcast scheduling with deadlines

COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
A tight analysis of most-requested-first for on-demand data broadcast

COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
A near optimal scheduler for on-demand data broadcasts

CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
An online scalable algorithm for average flow time in broadcast scheduling

ACM Transactions on Algorithms (TALG)
Online interval scheduling: randomized and multiprocessor cases

COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the problem of scheduling broadcasts in data delivering systems via broadcast, where a number of requests from several clients can be simultaneously satisfied by one broadcast of a server. Most of prior work has focused on minimizing the total flow time of requests. It assumes that once a request arrives, it will be held until satisfied. In this paper, we are concerned with the situation that clients may leave the system if their requests are still unsatisfied after waiting for some time, that is, each request has a deadline. The problem of maximizing the throughput, for example, the total number of satisfied requests, is developed, and there are given online algorithms achieving constant competitive ratios.