Minimizing maximum response time in scheduling broadcasts

Yair Bartal, Shanmugavelayutham 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 - Jan 1 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

    Fingerprint

    Broadcast
    Response Time
    Scheduling
    Scheduling Problem
    Data Broadcasting
    Competitive Ratio
    Online Algorithms
    Broadcasting
    Optimal Algorithm
    Polynomial time
    Servers
    Server
    Polynomials
    Scenarios
    Model

    ASJC Scopus subject areas

    • Chemical Health and Safety
    • Software
    • Safety, Risk, Reliability and Quality
    • Discrete Mathematics and Combinatorics

    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, .

    Minimizing maximum response time in scheduling broadcasts. / Bartal, Yair; Muthukrishnan, Shanmugavelayutham.

    2000. 558-559 Paper presented at 11th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, USA, .

    Research output: Contribution to conferencePaper

    Bartal, Y & Muthukrishnan, S 2000, 'Minimizing maximum response time in scheduling broadcasts' Paper presented at 11th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, USA, 1/9/00 - 1/11/00, pp. 558-559.
    Bartal Y, Muthukrishnan S. Minimizing maximum response time in scheduling broadcasts. 2000. Paper presented at 11th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, USA, .
    Bartal, Yair ; Muthukrishnan, Shanmugavelayutham. / Minimizing maximum response time in scheduling broadcasts. Paper presented at 11th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, USA, .2 p.
    @conference{2c4eca26f00c4756a1ec056e53f72c28,
    title = "Minimizing maximum response time in scheduling broadcasts",
    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.",
    author = "Yair Bartal and Shanmugavelayutham Muthukrishnan",
    year = "2000",
    month = "1",
    day = "1",
    language = "English (US)",
    pages = "558--559",
    note = "11th Annual ACM-SIAM Symposium on Discrete Algorithms ; Conference date: 09-01-2000 Through 11-01-2000",

    }

    TY - CONF

    T1 - Minimizing maximum response time in scheduling broadcasts

    AU - Bartal, Yair

    AU - Muthukrishnan, Shanmugavelayutham

    PY - 2000/1/1

    Y1 - 2000/1/1

    N2 - 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.

    AB - 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.

    UR - http://www.scopus.com/inward/record.url?scp=0033903568&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=0033903568&partnerID=8YFLogxK

    M3 - Paper

    SP - 558

    EP - 559

    ER -