three cpu bound jobs a through c and one i o bound job d arriveat a computer center 5124345

Three CPU bound jobs A through C and one I/O bound job D arriveat a computer center at the times shown in the table below. Alltimes in the table are in ms. Ignore context switches. The systemfollows the following rules: a. In the priority column higher numbers indicate higherpriorities b. The I/0 bound job runs for 3ms of CPU time then prints avalue, this pair of actions repeat until the job finishes. c. The print hardware takes 2ms to print one value. d. The quanta for an I/O bound jobs is cumulative.Therefore: i. When an I/O bound job leaves the CPU the remaining time inits quanta is recorded ii. When an I/O bound job reenters the CPU after completing awrite the length of the quanta given to it is the remaining time inthe quanta recorded before the job left the CPU to enter the printqueue e. When a job leaves the print queue it is placed in the readyqueue i.If the job is starting a new quanta it is placed at the end ofthe ready queue ii.If it is continuing an unfinished quanta it is placed at thefront of the ready queue f. When a preempted job leaves the CPU it is placed at the frontof the ready queue g. If two actions take place at the “same” time the order theyare completed is i. place a newly arrived process in the queue ii. check the queues to see which process is loaded into the CPUnext iii. place a process leaving the CPU into the ready queue or theprint queue iv. place a process leaving the print queue into the readyqueue h. Each process is allowed a quantum of 6 ms of CPU. At the endof the quantum the process will be placed at the end of theappropriate ready queue i. For CPU bound jobs this quantum will be used in one visit tothe CPU. ii. For I/O bound jobs this quantum may be distributed overseveral visits to the CPU. Process Arrival time (ms) Running Time (ms) Priority A    12    28    4 B    19 34 7 C 2    36    4 D 7    9 7 Determine the turnaround time for each process and the averageturnaround time for all processes for each of the followingscheduling algorithms. Explain how you arrived at your answers. Inparticular, your explanation should include a COMPLETE list ofsteps showing the order in which the processes execute. Theduration of each step, and the elapsed time at the end of each stepshould be shown. The description may be presented as a bulletedlist of steps OR a table, with one column per process and an entryfor each step. b) [13 points] round-robin scheduling (with preemptivepriorities). When a job arrives in the high priority queue, therunning job is checked to see if it has a lower priority. If therunning job has a lower priority it will be immediately replacedwith the higher priority job . . .

"Get 15% discount on your first 3 orders with us"
Use the following coupon
FIRST15

Order Now