Scribd Logo
Upload

Welcome to Scribd!

  • Process Schedulling - SRTN

    Uploaded by

    Elizabeth
    4 views1 page
    The document describes the Shortest Remaining Time Next (SRTN) scheduling algorithm. It provides an example with 5 processes - A, B, C, D, and E - being scheduled on a CPU. Using SRTN, process E completes first at time 6, followed by C at time 11, A at time 6, B at time 18, and D at time 28. The average response time is 11.2 and the average wait time is 5.8.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document describes the Shortest Remaining Time Next (SRTN) scheduling algorithm. It provides an example with 5 processes - A, B, C, D, and E - being scheduled on a CPU. Using SRTN, process E completes first at time 6, followed by C at time 11, A at time 6, B at time 18, and D at time 28. The average response time is 11.2 and the average wait time is 5.8.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    4 views1 page

    Process Schedulling - SRTN

    Uploaded by

    Elizabeth
    The document describes the Shortest Remaining Time Next (SRTN) scheduling algorithm. It provides an example with 5 processes - A, B, C, D, and E - being scheduled on a CPU. Using SRTN, process E completes first at time 6, followed by C at time 11, A at time 6, B at time 18, and D at time 28. The average response time is 11.2 and the average wait time is 5.8.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    SRTN (Shortest Remaning Time Next)

    Arrive Time Proccess Duration Order after T=5


    1 A 5 E-C-B-D
    4 B 7
    3 C 3
    2 D 10
    5 E 2

    T 1 2 3 4 5 6 7 8 9 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3 3 4
    0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0
    A
    B
    C
    D
    E

    Running Ready

    Arrive Start Finish


    Process Duration Response Time Wait Time
    Time Time Time
    A 1 5 1 6 6-1=5 5–5=0

    B 4 7 11 18 18 – 4 = 14 14 – 7 = 7

    C 3 3 8 11 11 – 3 = 8 8–3=5

    D 2 10 18 28 28 – 2 = 26 26 – 10 = 16

    E 5 2 6 8 8–5=3 3–2=1
    5 + 14 + 8 + 26 + 3 0 + 7 + 5 + 16 + 1
    = 11.2 = 5.8
    5 5

    You might also like