Assessment type: Report (2,000 words) — individual assignment
Purpose: This assessment will allow students to demonstrate that they can identify and understand
synchronisation and deadlocks. This assessment contributes to learning outcomes b and c.
Value:
Due Date: Week 9
Submission: Upload the completed report via Moodle.
Assessment topic: Analysis of an Operating System scenario, Computer Organisation and Architecture
Report
Task Details: The report will require analysis of an operating system scenario and a report on the systems
and logical issues involved, as well as options for resolving the problem and subsequent implications.
Assignment Details:
2-
Explain how you would design and implement a mechanism to allow the operating system to detect
which, if any, processes are starving.
Consider a banking system with 15 accounts. Funds may be transferred between two of those
accounts by following these steps:
lock A(i);
update A(i);
lock A(j);
update A(j);
ICT 201 COMPUTER ORGANISATION AND ARCHITECTURE T319 28/10/2019 13:22
*AUSTRALIAN INSTITUTE OF BUSINESS AND MANAGEMENT PTY LTD O
ABN: 72 132 629 979
PAGE 8 OF 13
CRICOS 03171A
ICT201
bv KOI lånarcl 13
unlock A(i);
unlock A(j);
3-
a. Can this system become deadlocked? If yes, show how. If no, explain why not.
b. Could the numbering request policy (presented in the chapter discussion about detection) be
implemented to prevent deadlock if the number of accounts is dynamic? Explain why or why not.
Using either internet resources or books, understand the concept of waiting time and turnaround
time. Define those terms (waiting time and turnaround time) in your own words. Then calculate
waiting time and turnaround time for every job for all four scheduling algorithms mentioned in QI
(Details of the calculations is essential).
You must provide references and cite the sources that you consulted for this task. (Harvard referencing is
the required method.)
4- Given the following arrival times and CPU cycle times.
Job
c
Arrival Time
3
5
9
12
CPU cycles required
4
7
3
15
Draw a timeline for each of the following scheduling algorithms and also show the details of the ready
queue formation during the timeline.
5-
i) FCFS
ii) Round Robin (use time quantum of 4)
iii) SRT
iv) HRRN
Consider the directed resource graph shown below and answer the following questions:
a. Is this system deadlocked?
b. Which, if any, processes are blocked?
c. What is the resulting graph after reduction?
R2