Minimizing maximum response time in scheduling broadcasts

Yair Bartal*, S. Muthukrishnan

*Corresponding author for this work

Research output: Contribution to conferencePaperpeer-review

57 Scopus citations

Abstract

We study novel scheduling problems that arise when a data server broadcasts data items requested by users. Two or more users may have pending requests for the same data item at any given time - such `common' requests may be satisfied by broadcasting that data once. Hence, in contrast to the classical scheduling scenario, the scheduling problems arising in the broadcast case have the property that the work done for one job may satisfy some of the others. We formulate the broadcast data delivery model and the scheduling problems that arise. We present polynomial time, near-optimal, offline algorithms as well as tight bounds on the competitive ratio of the online algorithms for the basic problem of minimizing the maximum response time of a request.

Original languageAmerican English
Pages558-559
Number of pages2
StatePublished - 2000
Event11th Annual ACM-SIAM Symposium on Discrete Algorithms - San Francisco, CA, USA
Duration: 9 Jan 200011 Jan 2000

Conference

Conference11th Annual ACM-SIAM Symposium on Discrete Algorithms
CitySan Francisco, CA, USA
Period9/01/0011/01/00

Fingerprint

Dive into the research topics of 'Minimizing maximum response time in scheduling broadcasts'. Together they form a unique fingerprint.

Cite this