Copyright Notice: Copyright by CMPUT 379, U. of Alberta, course instructor (E. Elmallah). All rights reserved. Do not post any part on a publicly-available Web site.
Question 7 (v2) [15 points]
Consider the following processes arrival time, and CPU processing requirements.
Process Arrival Time Processing Time 103 214 343 483
Copyright By PowCoder代写 加微信 powcoder
For each of the following scheduling algorithms, fill in the table with the process number that is running on the CPU during the identified time slot. In the table, time slot i (i = 0, 1, 2, ¡¤ ¡¤ ¡¤ ) starts at time t = i and ends at time t = i + 1. So, time slot 0 starts at t = 0, and time slot 12 ends at t = 13.
Assume a 1 unit time slice for time slice based algorithms. For RR, assume that an arriving process runs at the beginning of its arrival time. In case of a tie between two, or more, processes, select the most recent arrived process.
Time 0 1 2 3 4 5 6 7 8 9 10 11 12 slot
averageresponsetime
University of Alberta examination University of Alberta examination
University of Alberta examination
University of Alberta examination University of Alberta examination
程序代写 CS代考 加微信: powcoder QQ: 1823890830 Email: powcoder@163.com