Computer Science
George Mason University Demand Paging System & Operating Systems Worksheet

George Mason University

Question Description

I’m studying for my Computer Science class and need an explanation.

Questions are in word document attached below. please be make sure there is no plagiarism

Unformatted Attachment Preview

2. A computer has four page frames, the time of loading, time of last access, and the R and M bits for each page are as shown below (the times are in clock ticks), which page will be replaced by 1) NRU, 2) FIFO, 3) LRU, 4) second chance algorithms (20 points)? Page Loaded Last ref R M 0 96 240 1 0 1 230 250 0 1 2 140 280 0 0 3 110 300 1 1 3. Study the dining philosopher problem. We have five philosophers locked up in a small room, with endless supply of spaghetti in their plates. Twenty-eight days later, when we unlock the door, how many philosophers might still be alive and why? Explain your answer (20 points). 4. Refer to Figure 3-10 which I included on the right, draw a similar diagram to illustrate the internal operation of the MMU with four 4KB pages. Show how a 14-bit physical address can be formed out of 16 bits of virtual address space. You may make up the contents of the page table (20 points). 5. Considering a demand-paging system with a hard drive that has an average access and transfer time of 10 milliseconds. Addresses are translated through a page table in main memory, with an access time of 100 nanoseconds per memory access. By 80% of memory access are completed within one main memory access. Of those remaining, through well-designed paging replacement algorithms, 10% (or 2% of the total) causes page faults. What is the effective memory access time (5 points)? 6. The textbook gives a solution to the Readers and Writers problem, which has a minor problem: the writer may be starved to death. Write a pseudo-code to correct this issue with minimum implication to overall system efficiency. Your improved algorithm must allow multiple readers accessing the system simultaneously (20 points). ...
Purchase answer to see full attachment
Student has agreed that all tutoring, explanations, and answers provided by the tutor will be used to help in the learning process and in accordance with Studypool's honor code & terms of service.

Final Answer

Hello buddy, please
find the attached document which is the final version of your work. I have
followed every instruction you gave and I am satisfied that the paper is of
quality work. Kindly go through it and inform me in case of anything. I am looking
forward to continue working with you. You can also go ahead and share my
studypool link with your buddies to allow them invite me for their projects
also. Thank you and have a blessed day ahead.

COMPUTER SCIENCE

1

Computer Science
Student’s Name:
Institutional Affiliation

COMPUTER SCIENCE

2

Computer Science
2. A computer has four page frames, the time of loading, time of last access, and the R and M bits for
each page are as shown below (the times are in clock ticks), which page will be replaced by 1) NRU, 2)
FIFO, 3) LRU, 4) second chance algorithms (20 points)?
Page

Loaded

Last ref

R

M

0

96

240

1

0

1

230

250

0

1

2

140

280

0

0

3

110

300

1

1

NRU stands for Not Recently Used. It will be used in replacing the page which is not referenced
and modified recently. The NRU works as per the value of R and M bits. Therefore, the NRU will
replace the page number 2 because the values that it should replace, R and M, are both 0.
FIFO stands for First in-First out page replacement algorithm. It is used in replacing the page for
with least arrival time. Therefore, the FIFO frame will replace the page number 3 as accordingly
through first in first out it takes 110 times to get loaded, thus it consists of earliest time of loading.
The LRU stands for the least recently used page replacement algorithm. The frame replaces the
page which is not referenced recently. Therefore, it will replace the page number 1 since it is the
one that whose referenced time is the least of all other page numbers.
The second chance algorithm replaces the page for which R bit is zero and with the least arrival
time. Pages 1 and 2 have R and O bits. However, the arrival time of page 1 is less than 2.
Therefore, the second chance algorithm will replace the page number 2 since the earliest page is
on page number 0.

3. Study the dining philosopher problem. We have five philosophers locked up in a small room, with
endless supply of spaghetti in their plates. Twenty-eight days later, when we unlock the door, how
many philosophers might still be alive and why? Explain y...

fuhrmann (8546)
Purdue University

Anonymous
The tutor managed to follow the requirements for my assignment and helped me understand the concepts on it.

Anonymous
The tutor was knowledgeable, will be using the service again.

Anonymous
Awesome quality of the tutor. They were helpful and accommodating given my needs.

Studypool
4.7
Trustpilot
4.5
Sitejabber
4.4