Approximation algorithms for average stretch scheduling

Michael A. Bender, Shanmugavelayutham Muthukrishnan, Rajmohan Rajaraman

    Research output: Contribution to journalArticle

    Abstract

    We study the basic problem of preemptive scheduling of a stream of jobs on a single processor. Consider an on-line stream of jobs, and let the ith job arrive at time r(i) and have processing time p(i). If C(i) is the completion time of job i, then the flow time of i is C(i) - r(i) and the stretch of i is the ratio of its flow time to its processing time; that is, C(i) - r(i)/p(i). Flow time measures the time that a job is in the system regardless of the service it requests; the stretch measure relies on the intuition that a job that requires a long service time must be prepared to wait longer than jobs that require small service times. We present the improved algorithmic results for the average stretch metric in preemptive uniprocessor scheduling. Our first result is an off-line polynomial-time approximation scheme (PTAS) for average stretch scheduling. This improves upon the 2-approximation achieved by the on-line algorithm SRPT that always schedules a job with the shortest remaining processing time. In a recent work, Chekuri and Khanna (Proc. 34th Ann. Symp. Theory Comput., 297-305, 2002) have presented approximation algorithms for weighted flow time, which is a more general metric than average stretch; their result also yields a PTAS for average stretch. Our second set of results considers the impact of incomplete knowledge of job sizes on the performance of on-line scheduling algorithms. We show that a constant-factor competitive ratio for average stretch is achievable even if the processing times (or remaining processing times) of jobs are known only to within a constant factor of accuracy.

    Original languageEnglish (US)
    Pages (from-to)195-222
    Number of pages28
    JournalJournal of Scheduling
    Volume7
    Issue number3
    DOIs
    StatePublished - May 1 2004

    Fingerprint

    Approximation algorithms
    Scheduling
    Processing
    Polynomials
    Scheduling algorithms
    Stretch

    Keywords

    • Approximation algorithms
    • Average stretch
    • Scheduling algorithms

    ASJC Scopus subject areas

    • Software
    • Engineering(all)
    • Management Science and Operations Research
    • Artificial Intelligence

    Cite this

    Approximation algorithms for average stretch scheduling. / Bender, Michael A.; Muthukrishnan, Shanmugavelayutham; Rajaraman, Rajmohan.

    In: Journal of Scheduling, Vol. 7, No. 3, 01.05.2004, p. 195-222.

    Research output: Contribution to journalArticle

    Bender, MA, Muthukrishnan, S & Rajaraman, R 2004, 'Approximation algorithms for average stretch scheduling', Journal of Scheduling, vol. 7, no. 3, pp. 195-222. https://doi.org/10.1023/B:JOSH.0000019681.52701.8b
    Bender, Michael A. ; Muthukrishnan, Shanmugavelayutham ; Rajaraman, Rajmohan. / Approximation algorithms for average stretch scheduling. In: Journal of Scheduling. 2004 ; Vol. 7, No. 3. pp. 195-222.
    @article{f8b7cd3f7a6948ba994120992cafec03,
    title = "Approximation algorithms for average stretch scheduling",
    abstract = "We study the basic problem of preemptive scheduling of a stream of jobs on a single processor. Consider an on-line stream of jobs, and let the ith job arrive at time r(i) and have processing time p(i). If C(i) is the completion time of job i, then the flow time of i is C(i) - r(i) and the stretch of i is the ratio of its flow time to its processing time; that is, C(i) - r(i)/p(i). Flow time measures the time that a job is in the system regardless of the service it requests; the stretch measure relies on the intuition that a job that requires a long service time must be prepared to wait longer than jobs that require small service times. We present the improved algorithmic results for the average stretch metric in preemptive uniprocessor scheduling. Our first result is an off-line polynomial-time approximation scheme (PTAS) for average stretch scheduling. This improves upon the 2-approximation achieved by the on-line algorithm SRPT that always schedules a job with the shortest remaining processing time. In a recent work, Chekuri and Khanna (Proc. 34th Ann. Symp. Theory Comput., 297-305, 2002) have presented approximation algorithms for weighted flow time, which is a more general metric than average stretch; their result also yields a PTAS for average stretch. Our second set of results considers the impact of incomplete knowledge of job sizes on the performance of on-line scheduling algorithms. We show that a constant-factor competitive ratio for average stretch is achievable even if the processing times (or remaining processing times) of jobs are known only to within a constant factor of accuracy.",
    keywords = "Approximation algorithms, Average stretch, Scheduling algorithms",
    author = "Bender, {Michael A.} and Shanmugavelayutham Muthukrishnan and Rajmohan Rajaraman",
    year = "2004",
    month = "5",
    day = "1",
    doi = "10.1023/B:JOSH.0000019681.52701.8b",
    language = "English (US)",
    volume = "7",
    pages = "195--222",
    journal = "Journal of Scheduling",
    issn = "1094-6136",
    publisher = "Springer New York",
    number = "3",

    }

    TY - JOUR

    T1 - Approximation algorithms for average stretch scheduling

    AU - Bender, Michael A.

    AU - Muthukrishnan, Shanmugavelayutham

    AU - Rajaraman, Rajmohan

    PY - 2004/5/1

    Y1 - 2004/5/1

    N2 - We study the basic problem of preemptive scheduling of a stream of jobs on a single processor. Consider an on-line stream of jobs, and let the ith job arrive at time r(i) and have processing time p(i). If C(i) is the completion time of job i, then the flow time of i is C(i) - r(i) and the stretch of i is the ratio of its flow time to its processing time; that is, C(i) - r(i)/p(i). Flow time measures the time that a job is in the system regardless of the service it requests; the stretch measure relies on the intuition that a job that requires a long service time must be prepared to wait longer than jobs that require small service times. We present the improved algorithmic results for the average stretch metric in preemptive uniprocessor scheduling. Our first result is an off-line polynomial-time approximation scheme (PTAS) for average stretch scheduling. This improves upon the 2-approximation achieved by the on-line algorithm SRPT that always schedules a job with the shortest remaining processing time. In a recent work, Chekuri and Khanna (Proc. 34th Ann. Symp. Theory Comput., 297-305, 2002) have presented approximation algorithms for weighted flow time, which is a more general metric than average stretch; their result also yields a PTAS for average stretch. Our second set of results considers the impact of incomplete knowledge of job sizes on the performance of on-line scheduling algorithms. We show that a constant-factor competitive ratio for average stretch is achievable even if the processing times (or remaining processing times) of jobs are known only to within a constant factor of accuracy.

    AB - We study the basic problem of preemptive scheduling of a stream of jobs on a single processor. Consider an on-line stream of jobs, and let the ith job arrive at time r(i) and have processing time p(i). If C(i) is the completion time of job i, then the flow time of i is C(i) - r(i) and the stretch of i is the ratio of its flow time to its processing time; that is, C(i) - r(i)/p(i). Flow time measures the time that a job is in the system regardless of the service it requests; the stretch measure relies on the intuition that a job that requires a long service time must be prepared to wait longer than jobs that require small service times. We present the improved algorithmic results for the average stretch metric in preemptive uniprocessor scheduling. Our first result is an off-line polynomial-time approximation scheme (PTAS) for average stretch scheduling. This improves upon the 2-approximation achieved by the on-line algorithm SRPT that always schedules a job with the shortest remaining processing time. In a recent work, Chekuri and Khanna (Proc. 34th Ann. Symp. Theory Comput., 297-305, 2002) have presented approximation algorithms for weighted flow time, which is a more general metric than average stretch; their result also yields a PTAS for average stretch. Our second set of results considers the impact of incomplete knowledge of job sizes on the performance of on-line scheduling algorithms. We show that a constant-factor competitive ratio for average stretch is achievable even if the processing times (or remaining processing times) of jobs are known only to within a constant factor of accuracy.

    KW - Approximation algorithms

    KW - Average stretch

    KW - Scheduling algorithms

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

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

    U2 - 10.1023/B:JOSH.0000019681.52701.8b

    DO - 10.1023/B:JOSH.0000019681.52701.8b

    M3 - Article

    VL - 7

    SP - 195

    EP - 222

    JO - Journal of Scheduling

    JF - Journal of Scheduling

    SN - 1094-6136

    IS - 3

    ER -