Recent questions tagged cache-memory - GATE CSE Doubts

0 votes

0 answers

Madeeasy computerorganization test series
Can someone please give solution to this problem Thank you

asked Nov 30 in CO & Architecture by Pratyush Priyam Kuan (392 points) | 7 views

0 votes

1 answer

nptel Assignment :CO and Architecture
Consider a two-level memory hierarchy with separate instruction and data caches in level 1, and main memory in level 2. The clock cycle time in 1 ns. The miss penalty is 20 clock cycles for both read and write. 2% of the instructions ... clock cycle. The average access time of the memory hierarchy will be . nanoseconds. Can anyone plz provide the solution.

asked Nov 21 in CO & Architecture by vishal burnwal (57 points) | 20 views

0 votes

0 answers

Average Access Time of Read on Cache Hit and Cache Miss

asked Nov 14 in CO & Architecture by goxul (150 points) | 22 views

0 votes

0 answers

virtually indexed physically tagged cache
Can someone please explain the concept behind virtually indexed and physically tagged cache ?

asked Nov 10 in Operating System by Pratyush Priyam Kuan (392 points) | 10 views

0 votes

0 answers

Gatebook : CO
What conclusions can be drawn regarding traffic generated to the main memory for write through and write back if we vary miss rate? Higher miss rate write through is superior (generates less traffic) Higher miss rate write back is superior (generates less traffic) Lower miss rate write ... A). 1, 4 are true (B). 2, 3 are true (C). No conclusions can be drawn (D). Similar performance

asked Oct 19 in CO & Architecture by Sambhrant Maurya (289 points) | 12 views

0 votes

0 answers

Gatebook : Memory Organization
Consider a cache system organization employing a line size of 64 Bytes and main memory that requires 40 ns to transfer a 2 Byte word. What is the minimum average number of times a cache line must be made dirty for write-back policy to be more efficient than write-through policy, for any line which is written at-least once?

asked Oct 17 in CO & Architecture by Sambhrant Maurya (289 points) | 9 views

0 votes

0 answers

Gatebook: Memory Organization
The designers of a computer must select a cache system. They have two options. Design #1 uses a direct-mapped cache containing 2 words per cache line. It would have an instruction miss rate of 3% and a data miss rate of 8% Design #2 uses a 2-way set associative cache containing 8 words per cache ... . D1 = 0.70, D2 = 0.40 C. D1 = 0.70, D2 = 0.48 D. D1 = 1.10, D2 = 0.40

asked Oct 17 in CO & Architecture by Sambhrant Maurya (289 points) | 20 views

0 votes

1 answer

Ace subject wise test series CO gate 2019-20
what will be the answer of the below question ?

asked Oct 9 in CO & Architecture by Pratyush Priyam Kuan (392 points) | 30 views

0 votes

0 answers

Gate overflow doubt made easy cache stalls
Suppose that in 500 memory references there are 50 misses in the first level cache and 20 misses in the second level cache.Assume miss penalty from the L2 cache to memory is 100 cycles.The hit time of L2 cache is 20 cycle.The ... cache is 10 cycles. If there are 2.5 memory references per instruction.How many average stall cycles per instructions are there?

asked Aug 21 in CO & Architecture by Ram Swaroop (110 points) | 17 views

0 votes

1 answer

self doubt-cache memory
Suppose a system has L1,L2,L3 Cache and M as the main memory .now suppose a word W is being searched. the CPU first searches L1 cache whose access time/latency is 10ns .Does not find it. then the CPU again searches L2 cache whose access time is ... word is brought from the main memory to the CPU .is the block containing the word moved simultaneously to the L1,L2,L3 cache?

asked Aug 8 in CO & Architecture by Doraemon (89 points) | 12 views

0 votes

0 answers

Self Doubt - Cache Memory Mapping
Any Good resource to understand Hardware Implementation of various Cache Memory Mapping techniques (Direct, Fully Associative and K-way Set Associative). I mean how many Comparators, Multiplexers, etc. are required? How do they work?

asked Aug 5 in CO & Architecture by ayushsomani (13 points) | 7 views

0 votes

0 answers

OPERATING SYSTEM TLB AND EMAT
Can someone please explain how TLB formula is changed when other concepts like page fault and cache concepts are introduced. There is a lot of confusion and not getting clear explanations. It would be very helpful for every beginners like me. TLB #### EMAT = Ht( t ... also. ( p= page fault rate , PS= pagefault service time, c= cache access time, Hc= hit rate of cache )

asked Aug 5 in Operating System by shankargadri (8 points) | 7 views

To see more, click for the full list of questions or popular tags.

2,313 questions

1,294 answers

6,587 comments

89,719 users