Laxity helps in broadcast scheduling

Authors:
Stanley P. Y. Fung;Francis Y. L. Chin;Chung Keung Poon
Affiliations:
Department of Computer Science, The University of Hong Kong, Hong Kong;Department of Computer Science, The University of Hong Kong, Hong Kong;Department of Computer Science, City University of Hong Kong, Hong Kong
Venue:
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Year:
2005

Citing 6
Cited 7

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

Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Online scheduling with hard deadlines

Journal of Algorithms
Speed is as powerful as clairvoyance

Journal of the ACM (JACM)
Patience is a virtue: the effect of slack on competitiveness for admission control

Journal of Scheduling - Special issue: On-line algorithm part I
Scheduling broadcasts with deadlines

Theoretical Computer Science - Special papers from: COCOON 2003
On-line scheduling on a single machine: maximizing the number of early jobs

Operations Research Letters

A near optimal scheduler for on-demand data broadcasts

Theoretical Computer Science
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
A note on on-line broadcast scheduling with deadlines

Information Processing Letters
On Job Scheduling with Preemption Penalties

AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
Online deadline scheduling with preemption penalties

Computers and Industrial Engineering
Improved on-line broadcast scheduling with deadlines

COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
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 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 (difference between release time and deadline) and its processing time. All requests have a minimum guaranteed laxity. We give different algorithms and lower bounds on the competitive ratio for different ranges of values of laxity, which not only represents a tradeoff between the laxity and the competitive ratio of the system, but also bridges between interval scheduling and job scheduling techniques and results. We also give an improved algorithm for general instances in the case when requests can have different processing times.