742 views
1 votes
1 votes

You are given the following data about a virtual memory system:

  1. The $TLB$ can hold $1024$ entries and can be accessed in $1$ clock cycle $(1\: nsec).$ 
  2. A page table entry can be found in $100$ clock cycles or $100\: nsec.$ 
  3. The average page replacement time is $6\: msec.$

If page references are handled by the $TLB\:\: 99\%$ of the time, and only $0.01\%$ lead to a page fault, what is the effective address-translation time?

2 Answers

1 votes
1 votes

The question is asking about only effective address-translation time i.e time required to calculate physical address of the page in main memory.

$\therefore$ Effective address-translation time = $0.99(1) + 0.01(0.99(1+100) + 0.01(1+100+6000000))=602ns$

0 votes
0 votes
$0.99(1+100)$+   $0.01(1+100+ 0.01(100+6000000))$ $ns$

$=702$ $ns$
edited by

Related questions

450
views
0 answers
0 votes
admin asked Oct 26, 2019
450 views
Write a program that demonstrates the effect of $TLB$ misses on the effective memory access time by measuring the per-access time it takes to stride ... computer with a different architecture and explain any major differences in the output.
663
views
1 answers
1 votes
admin asked Oct 26, 2019
663 views
Consider the following C program: int X[N]; int step = M; /* M is some predefined constant */ for (int i = 0; i < N; i += step) X[i] = X[i ... loop?Would your answer in part $(a)$ be different if the loop were repeated many times? Explain.
1.2k
views
2 answers
0 votes
admin asked Oct 26, 2019
1,188 views
The amount of disk space that must be available for page storage is related to the maximum number of processes$,\: n,$ the number of bytes in the ... an expression for the worst-case disk-space requirements. How realistic is this amount?
394
views
1 answers
0 votes
admin asked Oct 26, 2019
394 views
What kind of hardware support is needed for a paged virtual memory to work?