Scribd Logo
Upload

Welcome to Scribd!

  • Os CH 3

    Uploaded by

    kabir0705.be23
    11 views6 pages
    CPU scheduling algorithms must balance CPU utilization with response time for processes. Round robin scheduling divides time into time slices of equal length to allow regular process switches. Shortest job first scheduling selects the process with the shortest estimated run time to completion. Multilevel queue scheduling divides the ready queue into separate queues based on process characteristics to provide better response times.

    Original Description:

    nice description

    Original Title

    OS CH 3

    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
    CPU scheduling algorithms must balance CPU utilization with response time for processes. Round robin scheduling divides time into time slices of equal length to allow regular process switches. Shortest job first scheduling selects the process with the shortest estimated run time to completion. Multilevel queue scheduling divides the ready queue into separate queues based on process characteristics to provide better response times.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    11 views6 pages

    Os CH 3

    Uploaded by

    kabir0705.be23
    CPU scheduling algorithms must balance CPU utilization with response time for processes. Round robin scheduling divides time into time slices of equal length to allow regular process switches. Shortest job first scheduling selects the process with the shortest estimated run time to completion. Multilevel queue scheduling divides the ready queue into separate queues based on process characteristics to provide better response times.

    Copyright:

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

    alAssMAte

    Date
    Page

    CPU Gnst t I/O Burt eution Tune

    Oispatche
    CPr Seaedulieng Dlgonthan muut take cane
    CPU utilizatinn
    3'
    Thuuggut
    Rissnas Tine

    Preemptisce
    SchedulingK NgnPreenptin
    allocatedl nce CPU allocated
    ete
    CPU back Heleaus CAU taelk.
    Date
    Page
    classmate
    Date
    Page

    CPU Scheduling Blgesithgud Proces Bit ume


    P
    (FCES) Schdulng
    Fuist fre Firat sene
    tome 30
    Ps
    Pi
    lnca mannel
    ereceted
    3
    .(EIFO Prncpe) 3
    TA7 =3+630 39 , 13 ns
    Process husst Teme
    Auwad
    P

    P Disadraatage
    30
    Chat

    Long
    time
    Tus Anulnd Timu (TA1) : Tine nterual fm
    3 3
    the phecess
    Tusa Anaud Timu Pi 24
    B30

    TAT = CT-AT[
    Jatng Tm (uT): Tne splnt by pecet mpletin Tiume CD: Lme lsheN precss
    Kompletes ite exeCutin
    he
    Aady
    Bbast Time (BT):Tme quee fea geting he CpU

    t LxeAArtin
    Heqd. by petes fo stite
    |WT= TA1 - BT |TAT: 8T+wt
    Date. classMate
    Page. Date
    Page

    Pretmptue SJE
    erected Fst Shontest Resauing Tine Einst (SRTE
    Shostest Jet wiu be
    bst tine Zhe pocess th tte smellt ut a
    Prowss heltth louwst sctil lonpletisn is Aelectrd te
    eolcte.
    Adnantag
    Process Bst me
    DlMarnuaa thscgspt Tat
    aadaaje aeiting amd
    8
    2)MAAAAAMm

    bisaduaastags 5
    Staaton
    2

    5 17
    Preess Buut ine
    8
    3 16 1 -1

    Py 5-3 =2.

    4
    TA7
    TAT: 3+4+16 t 24 =52 =13 m Pe 5 -1 TTAT , tT- Af
    4
    24

    (9 t 4t 24 + 7 5 2 3m
    Date
    Page clAssmAte
    Date
    Page

    low yalue
    Problem
    polouy Stawatn/Indelinte Blockiny
    Apheces to m but
    es tiCPU Casa be ctnicdeed blocked
    ProtessBat Teine Priert
    Aprieuit schdulang algethncanleae
    3
    P

    Solctin
    1 5
    P

    19
    1 6 16 18
    Lang timu
    W: P 6

    16
    18

    1
    Ps 18

    60 z12 ma
    5 5
    Date
    Page elAssMate
    Date
    Page

    Sehedulng Adwatages
    Eound Robn
    aout
    Designtd fo ech

    quatm e. timeslee da define esnt dapeud


    tisne be mmpleneutacd iin the iyetem:
    o the Gtervatin

    isadnantogls i
    FES + Preenmpton Louw 0sslizing
    CPU Quctput
    Proces bustt Teme to daf cntxta
    P

    tt pufomlnce
    aupifiat ianpad
    anmat hae pioits eatablshed
    14 18 22 6 30

    WT: P lo - y 26

    TAT :P 30

    10
    Avg T4T 2 3044+4o
    classMate
    Date
    Page

    uitileee Quee Sehedulng algerthn


    divides the neacdy quee hti seesal
    sepasat
    leels
    queues wis dfeuut pontt
    Each queue has ita oum schedulag algeia,

    Quee based ow hel chaacteiatics


    such as thete thu pie d
    uqusemerd and CPÙ buttt tine
    Pruoceoses cant mnoue betuee qued.
    Aduauitagea
    schedte dlleet typs

    wich eadi Vto bette aesponsw tima fo


    ne mpontt peceses
    piesia
    hant jabsQad erecude them quickly
    Shet

    You might also like