The Gateway to Computer Science Excellence

0 votes

Write a program that will demonstrate the difference between using a local page replacement policy and a global one for the simple case of two processes. You will need a routine that can generate a page reference string based on a statistical model. This model has $N$ states numbered from $0$ to $N − 1$ representing each of the possible page references and a probability $p_{i}$ associated with each state $i$ representing the chance that the next reference is to the same page. Otherwise, the next page reference will be one of the other pages with equal probability.

- Demonstrate that the page reference string-generation routine behaves properly for some small $N.$
- Compute the page fault rate for a small example in which there is one process and a fixed number of page frames. Explain why the behavior is correct.
- Repeat part $(b)$ with two processes with independent page reference sequences and twice as many page frames as in part $(b).$
- Repeat part $(c)$ but using a global policy instead of a local one. Also, contrast the per-process page fault rate with that of the local policy approach.

- All categories
- General Aptitude 1.9k
- Engineering Mathematics 7.5k
- Digital Logic 2.9k
- Programming and DS 4.9k
- Algorithms 4.4k
- Theory of Computation 6.2k
- Compiler Design 2.1k
- Databases 4.1k
- CO and Architecture 3.4k
- Computer Networks 4.2k
- Non GATE 1.4k
- Others 1.4k
- Admissions 595
- Exam Queries 573
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 18

50,737 questions

57,291 answers

198,209 comments

104,888 users