(BITS 1213) SULIT
SOALAN 5 (20 MARKAH)
a. Terangkan DUA (2) jenis operasi yang mungkin dilakukan pada direktori.
(4 markah)
b. Cadangkan DUA (2) kaedah organisasi fail yang sesua1 untuk rekod dengan
kepanjangan boleh ubah dan nyatakan justifikasi anda.
(4 markah)
c. Untuk VO dilaksanakan, rekod mesti disusun sebagai blok. Pertimbangkan senario
di mana terdapat senarai rekod dengan ukuran saiz berikut:
p,,l AYS1..q Jadual 3: Saiz Rekod
~ -----~----~
Rekod Saiz (bait)
Rl 524
R2 620
R3
R4
R5 280
.. ,___R_6_ _ _ _ -;, ~
70_o_.;:,
__. ..,r}:J
..
UNIVER .. R7 180
SI MELAKA
R8 120
Andaikan terdapat DUA (2) trek dan ukuran setiap trek adalah 2048 bait (2 KB).
Dengan sokongan gambar rajah, susun rekod ini sebagai blok menggunakan
Variable-Length Spanned Blocking dan Variable-Length Unspanned Blocking.
(12 markah)
-SOALAN TAMAT-
-7- SULIT
(BITS 1213) CONFIDENTIAL
INSTRUCTION: Answer ALL questions.
QUESTION 1 (20 MARKS)
Consider a system with a memory page size of 512 bytes and a process is allocated four
(4) frames in main memory. Process A has 8 pages. At some point during its execution, a
few pages have been refe1Ted with the following sequence:
7, 2, 1,and4
The page table is shown below:
Table 1: Process A page table
Page Number Present Bit Frame Number
l 2
0 .. ..11.JJ
0 A KA
7 l 0
a. Calculate the length (bit) of the logical and physical addresses.
(6 marks)
b. Given the following new ordered page references to the logical addresses:
1100 and 1800
1. Demonstrate how Least Recently Used (LRU) page replacement policy can
be used to replace page fault for the above page references.
(5 marks)
-8- CONFIDENTIAL
(BITS 1213) CONFIDENTIAL
11. Demonstrate the steps of the main memory address translation (logical
addresses to physical addresses). If there is a page fault, compute the physical
addresses (in decimal number) after the page replacement.
(14 marks)
UNIVERSITI TEKNIKAL MALAYSIA MELAKA
-9- CONFIDENTIAL
(BITS 1213) CONFIDENTIAL
QUESTION 2 (20 MARKS)
Figure 1 illustrates a dual quad cores processor with hyper-threading capability, numing
on Microsoft Windows IO operating system. It can be seen that the load distribution among
logical processors (i.e. threads) is not balanced, where many of the threads are relatively
not busy as CPU 0 and CPU 1.
CPU lntel(R) Core(TM) i7-1065G7 CPU@ 1.30GHz
9(, Ut1hzot1on
- ,.ifi--
ove, 60 seconds
, I
7
100%
' I /
I f
l
Utilization
28%
Speed
2.17 GHz
1.50Gtiz
1
Processes Threads H.ind •
293 3567 130628 Enabled
.. ..
320 KB
Up tune
L2 cache· ~ 2.0MB
6:21 :57:20 °" l3 cache 8.0MB
Figure 1: Load of Logical Processors in Microsoft Windows 10
a. From yom observation, what are the possible causes of the load imbalance among
the threads?
(4 marks)
b. Discuss the effect of load imbalance among the threads from the perspective of end-
user experience?
(6 marks)
c. There is a various version of load sharing approach to schedule the task and balance
the workload among the threads of multicore processors. Identify and discuss the
version of the load sharing approach in the Microsoft Windows 10 operating system.
(10 marks)
- I 0- CONFIDENTIAL
(BITS 1213) CONFIDENTIAL
QUESTION 3 (20 MARKS)
Refer to Figure 2, where the specification for a Maxtor hard disk drive is shown.
Perfonnance Specifications
MODELS 2R015H1 I 2R010H1
Seek Times (typical read, ms)
Tredt-t.o-Track 1.0
Average (normal seek) 15.0
F IAI Stroke (normal seek) 24.5
Average Lalency 5.51
Rolallon Speed (RPM, ±0.01") 5400
Controner O.erhead <0.3
Dela Transfer Speed
(MByles/sec max)
To/From Inter face
100
(UltraDMA - MS)
To/From Interface
.... fP/0 4/MultJ-11,ord OMA MS)
16.7
To/From Media :-i, 49.75 (
Sustained - OD \~ I i IL_ 34.0
- I
Sustained - ID I I 21.5
' \I
Ome Ready Tim&{lyp1c,i/ sec) I I 5 JI
'
Figure 2: Maxtor Hard Disk Drive Specification
t
a. In discussing disk-scheduling performance, there are two criteria that we should
consider, that is fair service distribution and disk throughput. A good disk scheduling
algorithm must find a balance between these two criteria. Suggest TWO (2) disk-
scheduling algorithms that may satisfy both criteria and discuss your justification in
detail.
(10 marks)
b. Based on the specification in Figure 2, calculate the total seek time if you were to
apply the suggested algorithms on the hard disk. Assume that the read/write head is
currently positioned at location 100 and the track requests in the disk queue is as
follows:
153, 59, 65 , 147, 168, 80, 89, 63
(10 marks)
- 1I - CONFIDENTIAL
(BITS 1213) CONFIDENTIAL
QUESTION 4 (20 MARKS)
a. User-oriented and system-oriented criteria are used to evaluate scheduling policies.
Describe ONE (1) user-oriented criteria and ONE (1) system-oriented criteria.
(4 marks)
b. Consider the information on the following set of processes:
Table 2: Proses Scheduling
Process Arrival Time Service Time
i\ 0 3
6
C 4
7
You are required to compare TWO (2) uniprocessor scheduling policies. Note that
these policies must favor short processes, and might results in starvation among long
processes.
1. Name the TWO (2) uniprocessor scheduling policies and compute the average
of nonnalized turnaround time for each policy.
(14 marks)
11. Based on the results in (i), state which scheduling policy shows better
performance. Justify your answer.
(2 marks)
-12- CONFIDENTIAL
(BITS 1213) CONFIDENTIAL
QUESTION 5 (20 MARKS)
a. Explain TWO (2) types of operation that may be performed on a directory.
(4 marks)
b. Suggest TWO (2) file organization methods that are suitable for variable-length
records and justify your reason.
(4 marks)
c. For I/0 to be performed, records must be organized as blocks. Consider a scenario
where there is a li st of records with the following size:
Table 3: Record Size
Records Size (byte)
~ Rl 524
c:::: -=
I I
R2 620
R3 345
ii<::= -
R4 615
. RS 280
R6 700
l
UNIVER MELAKA
R7 180
R8 120
Assume that there are TWO (2) tracks and the size of each track is 2048 bytes (2
KB). With the support of diagrams, organi ze these records as blocks using Variable-
Length Spanned Blocking and Variable-Length Unspanned Blocking.
(12 marks)
-END OF QUESTIONS-
-13- CONFIDENTIAL
UNIVERSITI TEKNIKAL MALAYSIA MELAKA
