1. Briefly differentiate between the 8 Memory Allocation Scheme we discussed in class (A comparison Table can be drawn). (4 Marks) 2. What is a Cache Memory? Pen down different levels of Cache and...


1.
Briefly
differentiate between the 8 Memory Allocation Scheme we discussed in class (A
comparison






Table can be drawn).
(4 Marks)






2.
What
is a Cache Memory? Pen down different levels of Cache and provide advantages of
using it.






(3
Marks)











3.


Calculate cache hit ratio and average memory access
time using the formula presented below assuming that the total number of
requests is 3,056 and 540 of those requests are found in the cache. The Average
Cache Access Time is 50 sec and Average Main Memory Access Time is 70 sec.






(3
Marks)


































Referencing











Report needs to be properly
cited and referenced following IEEE referencing style. (2 Marks)














































Part B: Case Study: Efficient Memory Management
for MIT Database and OS Scheduling Algorithms












1.


A new memory management system needs to be incorporated
to make the existing system more efficient. The below memory diagram consists
of memory associated with the email addresses and names of students taking BN
104 course (referred as M1, M3, M6, M9 and M10 in Table 1).











Being an OS manager, your task is to evaluate memory
compaction and write down the base and limit registers assigned by the OS after
compaction. Also show the results in a new table.






(15 Marks)















1K























































































M1




























M6


















M3








M9








M10










5K







9K







13K







15K







18K







19K







20K







22K















Figure 1. Memory diagram of Computer System with five pages
in the memory (M1, M3, M6, M9, M10)





























2.


Based on the Arrival Time and CPU Cycle you as an OS
Specialist needs to calculate the Average Turnaround Time and draw Gantt Chart
(timeline). The Scheduling algorithms
are listed as follows:










































































































Process












Arrival Time












CPU cycle












A











0








20









B











2








3









C











4








6









D











5








2









E











8








8


























a.


First-come,
first-served (FCFS)







b.


Shortest
job next (SJN)







c.


Priority
scheduling







d.


Shortest
remaining time (SRT)







e.


Round robin







f.


Multiple-level
queues







g.


Earliest
deadline first (EDF)

















Referencing











Report needs to be properly
cited and referenced following IEEE referencing style. (3 Marks)

































Sep 20, 2022
SOLUTION.PDF

Get Answer To This Question

Related Questions & Answers

More Questions »

Submit New Assignment

Copy and Paste Your Assignment Here