ICT201 - Tutorial 3 - Uniprocessor scheduling

.docx

School

King's Own Institute *

*We aren’t endorsed by this school

Course

201

Subject

Computer Science

Date

Dec 6, 2023

Type

docx

Pages

2

Uploaded by BrigadierSeaLion2265 on coursehero.com

T2 2023: ICT201 Computer Organisation and Architecture Tutorial 04 Topic: Week 4 Uniprocessor scheduling Submission: Five minutes before the end of the tutorial: all files must be uploaded on Moodle. Exercise 1: Estimated completion time: 35 minutes 9.1. If purely priority-based scheduling is used in a system, what are the problems that the system will face? 9.2. Identify the advantages and disadvantages of preemptive scheduling. 9.3. Briefly define FCFS scheduling. 9.4. Briefly define round-robin scheduling. 9.5. Briefly define shortest-process-next scheduling. 9.6. Briefly define shortest-remaining-time scheduling. 9.7. Briefly define highest-response-ratio-next scheduling. 9.8. Briefly define feedback scheduling. Exercise 2: Estimated completion time: 20 minutes Formative Assessment (quiz). Please open the Formative assessment link at the top of the ICT201 Moodle shell. (or please open this link ICT201_0223: Formative Assessment (0%) (koi.edu.au) Exercise 3: Estimated completion time: 60 minutes Questions extracted from: Stallings, W. 2017. Operating Systems: internals and design principles . 9th ed. Pearson Education Limited. ICT201 Tutorial 04 Compiled by: Ali Noori 19 th July 2023
9.1. Consider the following workload: Process Burst Time Priority Arrival Time A 50 ms 4 0 ms B 30 ms 1 20 ms C 80 ms 3 30 ms D 40 ms 2 70 ms a. Show the schedule using shortest remaining time, nonpreemptive priority (a smaller priority number implies higher priority) and round robin with quantum 30 ms. Use time scale diagram as shown below for the FCFS example to show the schedule for each requested scheduling policy. Example for FCFS (1 unit = 10 ms): A A A A A B B B C C C C C C C C D D D D 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 b. What is the average waiting time of the above scheduling policies? Questions extracted from: Stallings, W. 2017. Operating Systems: internals and design principles . 9th ed. Pearson Education Limited. ICT201 Tutorial 04 Compiled by: Ali Noori 19 th July 2023
Your preview ends here
Eager to read complete document? Join bartleby learn and gain access to the full version
  • Access to all documents
  • Unlimited textbook solutions
  • 24/7 expert homework help