edited by
554 views
0 votes
0 votes
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 table in main memory, with an access time of $1$ microsecond per memory access. Thus, each memory reference through the page table takes two accesses. To improve this time, we have added an associative memory that reduces access time to one memory reference if the page-table entry is in the associative memory.

Assume that 80 percent of the accesses are in the associative memory and that, of those remaining, $10$ percent (or $2$ percent of the total) cause page faults. What is the effective memory access time?
edited by

Please log in or register to answer this question.

Related questions

1.4k
views
1 answers
0 votes
akash.dinkar12 asked Mar 22, 2019
1,394 views
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 ... ? What is the effect when $\triangle$ is set to a very high value ?
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 ?
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?