Scribd Logo
Upload

Welcome to Scribd!

  • 16 (A)

    Uploaded by

    mudduswamy
    1 views4 pages
    Round robin scheduling assigns each process a time quantum to execute before switching to another process. It is an example of preemptive scheduling where the CPU can forcibly end a process's execution before it completes to switch to another process. The document provides an example round robin scheduling algorithm with a time quantum of 2 milliseconds and shows the execution order and waiting times of sample processes.

    Original Description:

    Original Title

    16(a)

    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
    Round robin scheduling assigns each process a time quantum to execute before switching to another process. It is an example of preemptive scheduling where the CPU can forcibly end a process's execution before it completes to switch to another process. The document provides an example round robin scheduling algorithm with a time quantum of 2 milliseconds and shows the execution order and waiting times of sample processes.

    Copyright:

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

    16 (A)

    Uploaded by

    mudduswamy
    Round robin scheduling assigns each process a time quantum to execute before switching to another process. It is an example of preemptive scheduling where the CPU can forcibly end a process's execution before it completes to switch to another process. The document provides an example round robin scheduling algorithm with a time quantum of 2 milliseconds and shows the execution order and waiting times of sample processes.

    Copyright:

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

    Ready Round Robin Scheduling ALT

    16

    In Rond Rosm scheduling Ang a quantam time given to each & every process in the Splem so
    that qu executes that moven for that particular time quantem only once the quantam time extired
    then clo execution that nocen & that mocen will be alted to end of the realy quine hitke wise ju
    executes all the mocenes in the System.

    R.R is the example of pre-emptive Scheduling Alg. Preemptive Scheduling. Ang execution of a
    procen cpu can adese the recen forcefully w/o Quantam fime th Completion of its bast time
    execution

    Mocen

    B7

    4→2-0

    •CT

    ITAJAT

    WIT(GAT-B1
    4

    In

    5-73-1-018

    12

    PL

    2-0

    5
    6-4-2

    21

    10

    Hele quantum time is 2msex

    Grant chart

    3-1

    12 13 12

    PiPzPSP, P4 P5 8286 PSP2/POPS


    0

    2468 9 11 13 15 17 18 19 21

    Avuase 07:44=? 7.

    You might also like