Microsoft Word - BN104_Assignment1_Mel_Syd_T3_2021 V2 Memory Management 1 BN104 Memory Management 1 BN104 Memory Management 1 BN104 Assessment Details and Submission Guidelines Year and Term T2, 2022...

Microsoft Word - BN104_Assignment1_Mel_Syd_T3_2021 V2
    Memory Management     1
BN104
    Memory Management     1
BN104
    Memory Management     1
BN104


    Assessment Details and Submission Guidelines
    Year and Term
    T2, 2022
    Unit Code
    BN104
    Unit Title
    Operating Systems
    Assessment
Title
     Memory and Process Management
    Purpose of the assessment (with ULO
Mapping)
    The purpose of this assignment is to report on some important characteristics of Operating Systems and explain their functions. Students must answer questions about OS operation, and report on selected OS aspects and algorithms such as virtual memory, process scheduling and mobile operating systems. After successful completion of this assignment, students should be able to:

a. Report on the basics, and provide examples, of operating systems structure and functionality, including memory allocation virtual memory, demand paging and process and device management.
. Describe the integration of hardware, operating systems and application software.
c. Explain in detail the functioning of some devices such as peripherals

    Weight
    Part A and Part B: 20%
    Total Marks
    30
    Word limit
    N/A
    Due Date
    11:55PM, Sunday, 29th September, 2022 (Week 11)
    
    Submission Guidelines
    Assignment structure and submission guidelines:
· All work must be submitted on Moodle by the due date along with a title Page.
· The assignment must be in MS Word format, 1.5 spacing, 11-pt Cali
i (Body) font and 2.54 cm margins on all four sides of your page with appropriate section headings.
· Reference sources must be cited in the text of the report, and listed appropriately at the end in a reference list using IEEE referencing style.
    Extension
    
    If an extension of time to submit work is required, a Special Consideration Application must be submitted directly to the School's Administration Officer, in Melbourne on Level 6 or in Sydney on Level
7. You must submit this application three working days prior to the due date of the assignment. Further information is available at: http:
www.mit.edu.au/about-mit/institute-publications/policies- procedures-and-guidelines/specialconsiderationdeferment

    Academic Misconduct
    • Academic Misconduct is a serious offence. Depending on the seriousness of the case, penalties can vary from a written warning or zero marks to
    
    exclusion from the course or rescinding the degree. Students should make
themselves familiar with the full policy and procedure     available at:     http:
www.mit.edu.au/about- mit/institute-
publications/policies-procedures-and- guidelines/Plagiarism-AcademicMisconduct-Policy-Procedure. For further information, please refer to the Academic Integrity Section in your Unit Description.


Assignment Description:
The assignment has following two parts:
    Part A – Lecture contents related questions for Memory Allocation               (12 Marks)
    Part B - Case Study based question for Efficient Memory Management               (18 Marks)

Part A: Answer the Following Questions

1. Briefly differentiate between the 8 Memory Allocation Scheme we discussed in class (A comparison
Table can be drawn). XXXXXXXXXX4 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. XXXXXXXXXX2 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 (refe
ed 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 A
ival 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
    A
ival Time
    CPU cycle
    A
    0
    20
    B
    2
    3
    C
    4
    6
    D
    5
    2
    E
    8
    8


a. First-come, first-served (FCFS)
. 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. XXXXXXXXXX3 Marks)










XXXXXXXXXXMarking criteria: Marks are allocated as follows:

    Section to be included in the report
    Description of the section
    Marks
    Question No 1
    - 8 Memory Allocation Scheme
    4
    Question No 2
    - Cache Memory, its levels and advantages in system performance
    3
    Question No 3
     - Calculating Hit ration and average memory access time
    3
    Reference style
     Follow IEEE reference style and in-text citation

    2
    

Case Study
Evaluation
    Efficient Memory Management for MIT Database
     XXXXXXXXXX
    
    OS scheduling algorithm
    7
    Reference style
    Follow IEEE reference style and in-text citation

    3



XXXXXXXXXXMarking Ru
ic for Assignment 2: Total Marks: 30

    Grade Mark
    HD >=80%
    D
70%-79%
    CR 60%-69%
    P
50%-59%
    Fail
50%
    
    Excellent
    Very Good
    Good
    Satisfactory
    Unsatisfactory
    
Efficient Memory
Management –
Case Study
    
Concise and specific to the project.
    Scope relevant and soundly analyzed.
    Generally relevant and analyzed.
    Some relevance and
iefly presented.
     This is not relevant to the assignment topic.
    
OS Scheduling algorithms – Case
Study
    
Concise and specific to the project.
    Scope relevant and soundly analyzed.
    Generally relevant and analyzed.
    Some relevance and
iefly presented.
     This is not relevant to the assignment topic.
    

Reference style
    
Clear styles with excellent source of references.
    
Clear referencing style
    
Generally good
Referencing style
    
Sometimes clear referencing style
    
Lacks consistency with many e
ors
    

Question No 1
    
Concise and specific
    
Mostly consistent
    
Generally relevant
    
Some relevance is there
    
not relevant with many e
ors
    

Question No 2
    Concise and specific
    
Mostly consistent
    
Generally relevant
    
Some relevance is there
    
not relevant with many e
ors
    

Question No 3
    
Concise and specific
    
Mostly consistent
    
Generally relevant
    
Some relevance is there
    
not relevant with many e
ors
    

Reference style
    
Clear styles with excellent source of references.
    
Clear referencing style
    
Generally good
Referencing style
    
Sometimes clear referencing style
    
Lacks consistency with many e
ors


XXXXXXXXXXPrepared by: Mr Zakria Qadir XXXXXXXXXXModerated by: Dr Imran XXXXXXXXXXAug, 2022
XXXXXXXXXXPrepared by: Mr Zakria Qadir