ICT201 - Tutorial 3 - Uniprocessor scheduling
.docx
keyboard_arrow_up
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
Related Questions
Discuss the concept of process scheduling in an operating system. How do scheduling algorithms like round-robin and priority scheduling work?
arrow_forward
Analyze the differences and similarities between scheduling processes and scheduling threads.
arrow_forward
How much CPU time and effort does preemptive scheduling vs. non-preemptive scheduling take?
arrow_forward
What is meant by preemptive scheduling?
arrow_forward
Between Preemptive and Non-Preemptive scheduling, which requires more time and action from the CPU? Why?
arrow_forward
The comparison between preemptive and non-preemptive scheduling techniques in terms of CPU time and effort is a topic of interest?
arrow_forward
Briefly describe what process starvation in priority scheduling entails and how to avoid it.
arrow_forward
Discuss the concept of process scheduling algorithms in an operating system, such as Round Robin and Priority Scheduling, and their applications.
arrow_forward
What is the difference between preemptive and non-preemptive scheduling systems? Write examples for each type of system.
arrow_forward
Explain the concept of process scheduling in operating systems and discuss different scheduling algorithms, including First-Come-First-Served (FCFS), Shortest Job Next (SJN), and Round Robin.
arrow_forward
Approaches to multithreading are analyzed and contrasted across a variety of operating systems, including Linux, Windows, Mac OS X, and Android, amongst others. Is it possible that the CPU Scheduling Algorithm may be expressed in the same way?
arrow_forward
Where do long-term and short-term process scheduling diverge? Academic study of computers
arrow_forward
What is preemptive scheduling? Compare this to Cooperative scheduling.
arrow_forward
Examine the differences and similarities between the scheduling strategies used by threads and processes. Talk about the differences and similarities between scheduling processes and scheduling threads.
arrow_forward
Could you give me any additional examples of why you think scheduling processors is crucial? To what end are there so many scheduling algorithms?
arrow_forward
Preemptive vs. non-preemptive scheduling: Which technique requires the most CPU time and effort?
arrow_forward
What is Preemptive Scheduling?
arrow_forward
What exactly does "preemptive scheduling" imply?
arrow_forward
What exactly is non-preemptive scheduling?
arrow_forward
What exactly is the distinction between preemptive and non-preemptive scheduling?
Create examples for each sort of system.
arrow_forward
Discuss the various process scheduling algorithms used in operating systems, such as Round Robin, Shortest Job First, and Priority Scheduling. Compare their strengths and weaknesses.
arrow_forward
Describe the concept of process scheduling in multi-tasking operating systems. What scheduling algorithms are commonly used, and when might one be preferred over the others?
arrow_forward
Describe the concept of "preemptive scheduling."
arrow_forward
Preemptive scheduling entails what exactly?
arrow_forward
Most scheduling algorithms maintain a run queue,which lists processes eligible to run on a processor. On multicore systems, there are two general options: (1) each processing core has its own run queue, or (2) a single run queue is shared by all processing cores. What are the advantages and disadvantages of each of these approaches?
arrow_forward
SEE MORE QUESTIONS
Recommended textbooks for you
Systems Architecture
Computer Science
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Cengage Learning
Related Questions
- Discuss the concept of process scheduling in an operating system. How do scheduling algorithms like round-robin and priority scheduling work?arrow_forwardAnalyze the differences and similarities between scheduling processes and scheduling threads.arrow_forwardHow much CPU time and effort does preemptive scheduling vs. non-preemptive scheduling take?arrow_forward
- What is meant by preemptive scheduling?arrow_forwardBetween Preemptive and Non-Preemptive scheduling, which requires more time and action from the CPU? Why?arrow_forwardThe comparison between preemptive and non-preemptive scheduling techniques in terms of CPU time and effort is a topic of interest?arrow_forward
- Briefly describe what process starvation in priority scheduling entails and how to avoid it.arrow_forwardDiscuss the concept of process scheduling algorithms in an operating system, such as Round Robin and Priority Scheduling, and their applications.arrow_forwardWhat is the difference between preemptive and non-preemptive scheduling systems? Write examples for each type of system.arrow_forward
- Explain the concept of process scheduling in operating systems and discuss different scheduling algorithms, including First-Come-First-Served (FCFS), Shortest Job Next (SJN), and Round Robin.arrow_forwardApproaches to multithreading are analyzed and contrasted across a variety of operating systems, including Linux, Windows, Mac OS X, and Android, amongst others. Is it possible that the CPU Scheduling Algorithm may be expressed in the same way?arrow_forwardWhere do long-term and short-term process scheduling diverge? Academic study of computersarrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Systems ArchitectureComputer ScienceISBN:9781305080195Author:Stephen D. BurdPublisher:Cengage Learning
Systems Architecture
Computer Science
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Cengage Learning