4,157 views
1 votes
1 votes
      A computer whose processes have 1024 pages in their address spaces keeps
      its page tables in memory. The overhead required for reading a word from
      the page table is 500 nsec.  To reduce this  overhead, the computer has an
      associative  memory  which holds 32 (virtual  page,  physical  page frame)
      pairs and can do look up in 100 nsec.  What hit rate is needed  to reduce
      the mean overhead to 200 nsec?

2 Answers

1 votes
1 votes

Here the overhead is reading a word from the page table and we need to reduce the overhead.

So , when access is sequential memory access then 

(new mean ovehead time) = TLB hit rate (TLB access time) + TLB miss rate (TLB access time +Page table access time )

200 = h(100)+(1-h)(100+500)

h=0.8

 when access is parallel memory access then 

 (new mean ovehead time) = TLB hit rate (TLB access time) + TLB miss rate (Page table access time )

200 = h(100)+(1-h)(500)

h=0.75

0 votes
0 votes
h=75%

Look how request processed, request to access more is generated by processor. So processor generates Virtual address and it is given to TLB to give Physical address where actually data is in physical memory and parallely given to memory to search page table. Since tlb is fast enough to reply faster than memory so you get to know whether page hit  in tlb, if miss memory can reply.

access time= h(tlb access time)+(1-h)(memory access time) // as search is parallel
edited by

Related questions

0 votes
0 votes
0 answers
1
SSR17 asked Feb 8
208 views
we have 8 pages (each side 32B) to store in physical memory of 2^32 bits how many bits are required to identify each page , according to me 3 bits are required but that i...
0 votes
0 votes
2 answers
4
Unique_999 asked Aug 17, 2023
320 views
Can Any explain the relationship between The “ Word Size “ and “ Logical Address Space “