1,394 views
0 votes
0 votes
Consider the parameter$\triangle$ used to define the working-set window in the working-set model. When $\triangle$ is set to a small value, what is the effect on the page-fault frequency and the number of active (non suspended) processes currently executing in the system ? What is the effect when $\triangle$ is set to a very high value ?

1 Answer

0 votes
0 votes
A smaller value of △ means that less number of frames out of ‘the total number of frames in the system’ will be allotted to a particular process. That being said, we can also conclude that more number of frames will be available for other processes.

Therefore, we can say that number of active processes will increase but since they have less number of allotted frames, therefore it will lead to more page faults.

Now, on the contrary, a larger value of △ will lead to a larger number of frames being allotted to a particular process. That means less number of frames will be available for other processes. Hence the number of active processes will decrease but also page faults for the active process will decrease.

Also when the value of △ is large, but the frame requirement of any process is less than that, then this will lead to unnecessary blocking of the process even when sufficient number of frames are available, hence it will make it difficult for a process to become active.

Related questions

1.1k
views
1 answers
1 votes
akash.dinkar12 asked Mar 22, 2019
1,149 views
Is it possible for a process to have two working sets, one representing data and another representing code ? Explain.
5.6k
views
1 answers
0 votes
akash.dinkar12 asked Mar 22, 2019
5,620 views
What is the cause of thrashing ? How does the system detect thrashing ? Once it detects thrashing, what can the system do to eliminate this problem ?
555
views
0 answers
0 votes
akash.dinkar12 asked Mar 22, 2019
555 views
Consider a demand-paging system with a paging disk that has an average access and transfer time of $20$ milliseconds. Addresses are translated through a page ... of the total) cause page faults. What is the effective memory access time?
945
views
0 answers
1 votes
akash.dinkar12 asked Mar 22, 2019
945 views
A page-replacement algorithm should minimize the number of page faults. We can achieve this minimization by distributing heavily used pages evenly over all of memory, ... strategy for the reference string in part $b$ with four page frames?