On the average sojourn time under M/M/1/SRPT

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    2 Citations (Scopus)

    Abstract

    We study an M/M/1 queueing system under the shortest remaining processing time (SRPT) policy. We show that the average sojourn time varies as T((µ(1-¿) ln(e/(1-¿)))-1), where ¿ is the system load. Thus, SRPT o2ers a T(ln(e/(1-¿))) factor improvement over policies that ignore knowledge of job sizes while scheduling.
    Original languageEnglish
    Title of host publicationProceedings of the Fifth Workshop on Mathematical Performance Modeling and Analysis (MAMA 2003, San Diego CA, USA, June, 2003)
    Place of PublicationNew York
    PublisherAssociation for Computing Machinery, Inc
    Pages34-35
    Publication statusPublished - 2003

    Publication series

    NameACM SIGMETRICS Performance Evaluation Review
    Volume31(2)
    ISSN (Print)0163-5999

    Fingerprint Dive into the research topics of 'On the average sojourn time under M/M/1/SRPT'. Together they form a unique fingerprint.

    Cite this