1- Given the followving arrival times and CP U cycle times. Job / Process CPU Cycles...

 

Transcribed Image Text:

1- Given the followving arrival times and CP U cycle times. Job / Process CPU Cycles Required / Service Time Priority 3 (Silver) 2 (Gold) 1 (Diamond) 2 (Gold) 2 (Gold) Arrival Time A 3 B 8 4 3 14 E 12 Draw a timeline (Gantt-Chart) for each of the following scheduling algorithms a) b) What is the Waiting Time and Turnaround Time of each process for each of the scheduling algorithms? (Details of the calculation is essential). i) ii) iii) Highest Response Ratio Next (HRRN) iv) v) First-Come-First-Served (FCFS) Round Robin (RR) (use time quantum of 3) Shortest Remaining Time (SRT) Shortest Process Next (SPN) 2- Using either internet resources or books, understand the concept of Memory Management and Virtual Memory. Define those terms (Memory Management and Virtual Memory) in your own words. You must provide references and cite the sources that you consulted for this task. (Harvard referencing is the required method.) 3- Consider the directed resource graph shown below and answer the following questions: Is this system deadlocked? a. b. Which, if any, processes are blocked? C. What is the resulting graph after reduction? R1 R2 R3 R4 P1 P2 P3 1- Given the followving arrival times and CP U cycle times. Job / Process CPU Cycles Required / Service Time Priority 3 (Silver) 2 (Gold) 1 (Diamond) 2 (Gold) 2 (Gold) Arrival Time A 3 B 8 4 3 14 E 12 Draw a timeline (Gantt-Chart) for each of the following scheduling algorithms a) b) What is the Waiting Time and Turnaround Time of each process for each of the scheduling algorithms? (Details of the calculation is essential). i) ii) iii) Highest Response Ratio Next (HRRN) iv) v) First-Come-First-Served (FCFS) Round Robin (RR) (use time quantum of 3) Shortest Remaining Time (SRT) Shortest Process Next (SPN) 2- Using either internet resources or books, understand the concept of Memory Management and Virtual Memory. Define those terms (Memory Management and Virtual Memory) in your own words. You must provide references and cite the sources that you consulted for this task. (Harvard referencing is the required method.) 3- Consider the directed resource graph shown below and answer the following questions: Is this system deadlocked? a. b. Which, if any, processes are blocked? C. What is the resulting graph after reduction? R1 R2 R3 R4 P1 P2 P3

Answer rating: 100% (QA)

i Highest Response Ratio Next When the response ratio is equal we ... View the full answer