Register

Memory Hierarchy

862 views
0 votes
0 votes
Consider a very small 2-way set-associative cache with a total of 2 sets and a block size of 16 bytes. The cache uses an LRU replacement policy. Assume that the cache is initially empty. The CPU access the following memory locations, in that order: c88H, 774H, 79cH, c00H, 784H, c80H, 718H, 738H, 770H, 774H. All addresses are byte addresses. No random order is considered,

The total number of pafe replacement in the overall operation will be

a. 0

b. 1

c. 2

d. 3

The answer is given option (c). Please explain.
User Avatar

1 Answer

0 votes
0 votes
Getting 8 page replacements can you check the associativity.
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

278
views
0 answers
0 votes
`JEET asked Dec 18, 2018
278 views
#CO #2-Level Memory Hierarchy
What should be the answer and explanation for this question?https://gateoverflow.in/?qa=blob&qa_blobid=12048400696649494741
User Avatar
212
views
0 answers
0 votes
Abbas Ahmad asked Sep 15, 2018
212 views
Doubt in memory hierarchy
What are the external connections in memory circuit ?
User Avatar
1.8k
views
2 answers
2 votes
Indranil Pradhan asked Aug 22, 2018
1,764 views
Memory Hierarchy Design
Consider the following fragment of code for(i=0; i<=100; i++){A[i]= B[i]+C;}Assume A and B are arrays of 64-bit integers and c and i are 64 ... are 4 byte in size. How many instructions are required dynamically?a. 1618b. 400c. 512d. 1024
User Avatar
940
views
0 answers
0 votes
Nihar Ranjan Panda asked Aug 18, 2018
940 views
Memory Hierarchy
if simply the access time of level-1 meomry and level-2 memory is given and hit ratio is given then for average time access what should be the approach? should i go for hierarchical or simultaneous access?
User Avatar
Link Copied!