Scribd
Upload
28 views

First Come First Serve

The document contains a table with process names, serving times, and remaining times. It then calculates the average waiting times for each of four scheduling algorithms: First Come First Serve results in an average waiting time of 31us, Shortest Job First results in 12.75us, Shortest Remaining Time results in 30.5us, and Round Robin with a quantum of 10us results in 46.25us.

Uploaded by

OPie UPie
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
28 views

First Come First Serve

The document contains a table with process names, serving times, and remaining times. It then calculates the average waiting times for each of four scheduling algorithms: First Come First Serve results in an average waiting time of 31us, Shortest Job First results in 12.75us, Shortest Remaining Time results in 30.5us, and Round Robin with a quantum of 10us results in 46.25us.

Uploaded by

OPie UPie
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

PROCESS A B C D

REQUIRE SERVING TIME (us) 30 15 4 12

REMAINING TIME 0 2 4 5

Refer to the table above, find the average waiting time for methods below 1) 2) 3) 4) FIRST COME FIRST SERVE SHORTEST JOB FIRST SHORTEST REMAINING TIME ROUND ROBIN (QUANTUM TIME 10us)

FIRST COME FIRST SERVE A 0 30 B 45 C 49 D 61

Average = 0u+30u+45u+49u 4 = 31us

SHORTEST JOB FIRST C 0 4 Average = 31u+16u+4u 4 = 12.75us D 16 B 31 A 61

SHORTEST REMAINING TIME A 0 2 B 4 C 5 C 8 D 20 B 33 A 61

Average = 61u+33u+20u+8u 4 = 30.5us

ROUND ROBIN QUANTUM TIME = 10us A 0 10 B 20 C 24 D 34 A 44 B 49 D 51 A 61

Average = 61u+ 49u + 24u + 51u 4 = 46.25us

You might also like