Minimizing maximum response time in scheduling broadcasts

Yair Bartal, S. Muthukrishnan

    Research output: Contribution to conferencePaper

    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 languageEnglish (US)
    Pages558-559
    Number of pages2
    StatePublished - 2000
    Event11th Annual ACM-SIAM Symposium on Discrete Algorithms - San Francisco, CA, USA
    Duration: Jan 9 2000Jan 11 2000

    Other

    Other11th Annual ACM-SIAM Symposium on Discrete Algorithms
    CitySan Francisco, CA, USA
    Period1/9/001/11/00

    ASJC Scopus subject areas

    • Software
    • Mathematics(all)

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

  • Cite this

    Bartal, Y., & Muthukrishnan, S. (2000). Minimizing maximum response time in scheduling broadcasts. 558-559. Paper presented at 11th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, USA, .