Register

easy and tricky co question

• retagged by
408 views
0 votes
0 votes

• retagged by
User Avatar

1 Answer

0 votes
0 votes
It is 16 way set associative. As it is given 26 bit physicaL address n 16 K frames then 12 bits are neede for data among 26 14 bits are left nw 12 bit tag so 2 bit r for sets , 2 bits means 4 sets are there total 64 pages creating 4 sets each set is of 16 pages so 16 way set associative...
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1.9k
views
1 answers
4 votes
sushmita asked Sep 29, 2016
1,870 views
made easy test
A computer system with 2 level paging scheme in which regular memory access takes 300 nanoseconds and servicing a pagefault takes 500ns. An average instruction takes 200 ns ... 660 ns but made easy solution has 580 ns.Can any one check??
User Avatar
1.2k
views
2 answers
6 votes
sushmita asked Jan 5, 2017
1,229 views
TLB and paging
Consider the following piece of code which multiplies two matrices:int a[1024][1024], b[1024][1024], c[1024][1024]; multiply() { unsigned i, j, k; for ... size is 4096 and the TLB has 8 entries with a replacement policy consisting of LRU.
User Avatar
761
views
1 answers
0 votes
Gaurav Padole asked Dec 29, 2022
761 views
Madeeasy workbook, chapter: Memory management
Consider a k-level paging system along with a TLB. A TLB takes 10ns, and a memory takes 100ns on average. The hit ratio of TLB is equal to 0.8. If it is known that the average memory access time is 70ns, then the value of k is?
User Avatar
928
views
3 answers
2 votes
LRU asked Jan 11, 2022
928 views
Applied Test Series
A computer system has a page size of 1024 bytes and maintains the page table for each process in main memory. The overhead required for doing a ... TLB hit-rate will ensure an average virtual address translation time of exactly 200ns?
User Avatar
Link Copied!