Description
Q1Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms a) What
is the turnaround time and response time of each process for each of the
scheduling algorithms in part a?
b) Calculate
the average waiting time for the first three algorithms Q2Some
issues need to be considered in designing multi-threaded system. One of these
issues involves Thread Cancellation. Discuss the two types of target-thread cancellation,
support your answer with examples. Q3Imagine that you will design a simple scheduler for multi-processing system. For simplicity, this computing environments consisting of four single-core processers, each of these processors has a local scheduler for managing the execution of arriving jobs. The global scheduler is responsible for scheduling the jobs assigned for all the running processors. Using creativity and design thinking, propose a design for scheduling algorithm that fairly distribute the jobs and minimize the waiting time between these four processors. Justify the applicability of your algorithm with example. Hint: Combine two CPU scheduling algorithms that covered in the lecture
Unformatted Attachment Preview
College of Computing and Informatics
Assignment 1
Deadline: Sunday 06/03/2024 @ 23:59
[Total Mark for this Assignment is 8]
Student Details:
Name: ###
ID: ###
CRN: ###
Instructions:
• You must submit two separate copies (one Word file and one PDF file) using the Assignment Template on
Blackboard via the allocated folder. These files must not be in compressed format.
• It is your responsibility to check and make sure that you have uploaded both the correct files.
• Zero mark will be given if you try to bypass the SafeAssign (e.g. misspell words, remove spaces between
words, hide characters, use different character sets, convert text into image or languages other than English
or any kind of manipulation).
• Email submission will not be accepted.
• You are advised to make your work clear and well-presented. This includes filling your information on the cover
page.
• You must use this template, failing which will result in zero mark.
• You MUST show all your work, and text must not be converted into an image, unless specified otherwise by
the question.
• Late submission will result in ZERO mark.
• The work should be your own, copying from students or other resources will result in ZERO mark.
• Use Times New Roman font for all your answers.
Question One
Pg. 01
Learning
Outcome(s):
Question One
Describe the OS
Consider the following set of processes, with the length of the CPU burst time
3 Marks
mechanism for
process
management,
threads, memory,
storage
management, I/O,
Process
P1
P2
P3
P4
P5
Arrival time
0
5
10
70
70
Burst time
30
20
10
40
30
file and
concurrency
management
a) Draw four Gantt charts that illustrate the execution of these processes using the
following scheduling algorithms
•
First- Come, First-Served (FCFS) Scheduling
•
Shortest-Job-First (SJF) Scheduling
•
RR (quantum = 10)
•
Multiple level with 3 Queues:
o Q1 : RR with quantum 10
o Q2: RR with quantum 20
o Q3: FCFS
b) What is the turnaround time and response time of each process for each of the
scheduling algorithms in part a?
c) Calculate the average waiting time for the first three algorithms
Question Two
Pg. 02
Learning
Outcome(s):
Describe the OS
mechanism for
process
management,
threads, memory,
storage
management, I/O,
file and
concurrency
management.
Question Two
1 Marks
Some issues need to be considered in designing multi-threaded system. One of these
issues involves Thread Cancellation. Discuss the two types of target-thread cancellation,
support your answer with examples.
Question Three
Pg. 03
Learning
Outcome(s):
Question Three
4 Marks
Imagine that you will design a simple scheduler for multi-processing system. For
Predict the
simplicity, this computing environments consisting of four single-core processers, each
expected impact
of these processors has a local scheduler for managing the execution of arriving jobs.
of the interaction
The global scheduler is responsible for scheduling the jobs assigned for all the running
between design
processors.
decisions and
Using creativity and design thinking, propose a design for scheduling algorithm that
operating system
fairly distribute the jobs and minimize the waiting time between these four processors.
features on the
Justify the applicability of your algorithm with example.
performance and
robustness of the
programs
Hint: Combine two CPU scheduling algorithms that covered in the lecture
Purchase answer to see full
attachment
