Scheduling broadcasts with deadlines

Authors:
Jae-Hoon Kim;Kyung-Yong Chwa
Affiliations:
Department of Computer Engineering, Pusan University of Foreign Studies, Pusan, Korea;Department of Electrical Engineering & Computer Science, Korea Advanced Institute of Science and Technology, Taejon, Korea
Venue:
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Year:
2003

Citing 9
Cited 9

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
Algorithms for Minimizing Response Time in Broadcast Scheduling

Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
On-line Scheduling

Developments from a June 1996 seminar on Online algorithms: the state of the art

Wireless real-time on-demand data broadcast scheduling with dual deadlines

Journal of Parallel and Distributed Computing
A tight lower bound for job scheduling with cancellation

Information Processing Letters
On-demand bounded broadcast scheduling with tight deadlines

CATS '06 Proceedings of the 12th Computing: The Australasian Theroy Symposium - Volume 51
An Optimal Strategy for Online Non-uniform Length Order Scheduling

AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
On Job Scheduling with Preemption Penalties

AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
A tight lower bound for job scheduling with cancellation

Information Processing Letters
Online deadline scheduling with preemption penalties

Computers and Industrial Engineering
Design and analysis of online batching systems

LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
On-demand bounded broadcast scheduling with tight deadlines

CATS '06 Proceedings of the Twelfth Computing: The Australasian Theory Symposium - Volume 51

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 simultaneosly 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 conserned 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.