Question

Five batch jobs, A through E, arrive in alphabetical order at a computer at almost the same time (i.e. they all arrive before the next scheduling event occurs). They have estimated running times of 500, 300, 600, 700, and 200 ms, respectively. Using diagrams, show how the process scheduling algorithms below would schedule these jobs, and calculate the mean process turnaround time (assuming no process switching overhead):

1. FCFS
2. SPN
3. RR with a quantum of 100ms
4. RR with a quantum of 150ms

Answer 1

A) FCFS :- A Process Assiralline Blast Time/ comptron Time 1111 C1-AT 5000 500 B 800-800 1400 700 2100 21000 2100 2300 230-02.00 o c E ГА c D gente chest B 800 1400. Doo 3300 rinasand Time - Completion Time -Addivy time mean tun sand Tine - Soo 4800 114004210072200 5 2100 S. 6) SPN :- Process ATBT CTTAT=CT AT А 320 1000 1000 -0 =1000 1420 B 300/500 Goo | 1600 700 12300 200 300 1600 on 1600 2300-0-2300 2000 E gento chat E B A с D 500 100 160o 2300 1 000 +500 +1600+23.004.200 ड ANG TAT SGOO = 1120

BT 4002000 Seb 200 le c) RR with TQ=100 - Process AT CT TAT=CT-AT A 1800 1800-0 = 1800 B 1200 1200-0 = 1200 = 2100 2100 2100- 1000 D too famoso 2300 2300 -0 =2300 со се 1000 loco-o = 1000 E 900200 too garot chat lc blacbalco TATB lc DELAB CID ELAB 6-100 200 200 400 500 600 700 800 900 1000 100 1200 Bod 1400 isoo hoo 100 1800 1900 2000 1800 +1200 72100 +2300 HOOO con 2000 200 2200 2200 5 8400 = 1680 5 Ang TAT - CT D) RR with TQ = 150 Process AT BT ITAT - CT - AT А Soo 2000 1900 1050 452150 2050 1900 -0 =1900 (050-0 =1050 050-0-2050 2300-0-2300 bbo 300 50 400 2300 1400 E o 1400 -0 =1400 gatt chat: - DlAlcTD (A B C DLEIAB) a DEIA clo 150 300 450 600 750 900 1050 1200 1350 1400 1550 Hoo 1850 900 290 2300 Ang TAT > 1900 Hoso+2050+2300 +1400 => 8700 5 1740

Any queries please comment

Please thumbsup for my effort

Thank you and all the best