Scribd Logo
Upload

Welcome to Scribd!

  • CS101 - Introduction To Computing: Part # 1: Draw The Ready Queue Solution

    Uploaded by

    dc210200041 SHAHEER KHAN
    9 views3 pages
    The document discusses a solution to a CS101 scheduling problem. It shows the ready queue with processes C, A, D, B from left to right. It then shows the processes executing over 4 time slices of 2ms each, with B, D, A, C executing according to their time requirements and switching between processes when their time slice ends. The total executing time of all processes is calculated to be 22ms.

    Original Description:

    virtual university Assignment

    Original Title

    Assignment 2

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document discusses a solution to a CS101 scheduling problem. It shows the ready queue with processes C, A, D, B from left to right. It then shows the processes executing over 4 time slices of 2ms each, with B, D, A, C executing according to their time requirements and switching between processes when their time slice ends. The total executing time of all processes is calculated to be 22ms.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    9 views3 pages

    CS101 - Introduction To Computing: Part # 1: Draw The Ready Queue Solution

    Uploaded by

    dc210200041 SHAHEER KHAN
    The document discusses a solution to a CS101 scheduling problem. It shows the ready queue with processes C, A, D, B from left to right. It then shows the processes executing over 4 time slices of 2ms each, with B, D, A, C executing according to their time requirements and switching between processes when their time slice ends. The total executing time of all processes is calculated to be 22ms.

    Copyright:

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

    CS101 - 

    Introduction to Computing

    Part # 1: Draw the ready queue

    Solution

    C A D B

    Schedular

    Dispatcher

    CPU
    CS101 - Introduction to Computing

    Part # 2

    Solution

    First

    B (6ms) D (8ms) A (4ms) C (4ms)

    Process Switch Process Switch Process Switch

    Time Slice 2ms Time Slice 2ms Time Slice 2ms Time Slice 2ms

    Second
    B (4ms) D (6ms) A (2ms) C (2ms)

    Process Switch Process Switch Process Switch


    CS101 - Introduction to Computing

    Time Slice 2ms Time Slice 2ms Time Slice 2ms Time Slice 2ms

    Third

    B (2ms) D (4ms)
    Process Switch

    Time Slice 2ms Time Slice 2ms

    Fourth

    D (2ms)

    Time Slice 2ms

    Total Executing Time = 22ms

    You might also like