Recent questions tagged cache-memory - GATE CSE Doubts

0 votes

0 answers

Where to read Cache Memory concept ?
Hi, my concepts regarding cache memory is weak. Please let me know that where (book or online source) to read Cache memory concepts ? If you have any knowledge about it please share ? Please try to share only standard sources.

asked Feb 17 in CO & Architecture by beta (5 points) | 10 views

+1 vote

0 answers

why pagetables are not present in cache memory?

asked Jan 22 in Operating System by pradeep jagarlamudi (9 points) | 11 views

0 votes

1 answer

Ace Subject Wise Test CO

asked Jan 3 in CO & Architecture by Raj Bopche (13 points) | 24 views

+1 vote

0 answers

Self Doubt - Amdahl's Law in Cache Organisation
Is Amdahl's Law applicable in a system having Cache and Main Memory in Hierarchical Organization or is it limited to Simultaneous Organization only. The Effective Memory Access Time of system having Simultaneous Organization matches the time predicted by Amdahl's Law but not so in the case of Hierarchical Organization. Am I doing something wrong?

asked Nov 6, 2020 in CO & Architecture by shantanu4raje (25 points) | 23 views

0 votes

1 answer

Made Easy Test Series
What would be the answer? I am getting 100.

asked Oct 16, 2020 in CO & Architecture by Sinchit (17 points) | 57 views

0 votes

1 answer

Made Easy, COA Subject wise test 2 | Cache Memory
A cache has a hit time of 10ns and hit rate of 60%. An optimization was made to increase the hit rate to 70%, but the hit time also got increased to 15ns. The optimization resulted in 10% reduction in average memory access time. Assume that the miss penalty is unaffected by the optimization. The miss penalty of the cache (in ns) is___?

asked Sep 9, 2020 in CO & Architecture by Animesh Sinha (25 points) | 35 views

+3 votes

2 answers

COA made easy test series question on Cache memory mapping

asked Sep 2, 2020 in CO & Architecture by ijnuhb (741 points) | 223 views

0 votes

1 answer

Virtual Memory | OS
Is there any good resources for Virtual Memory because i’m not able to do the question based on calculating effective memory access time in case of page fault,tlb miss and cache miss ?

asked Sep 2, 2020 in Operating System by kaleen bhaiya (9 points) | 46 views

0 votes

2 answers

#OS Memory management question from Made Easy Handbook

asked Aug 29, 2020 in Operating System by dhruvikk6 (5 points) | 34 views

0 votes

0 answers

Computers organization
As an important part of CPU, ALU supports the functionality of Performing many different functions, Can you elaborate on this statement by showing an example of one addition and one AND operation in 4 bit registers over the given hardware. Give the set of selection that will be required to perform this action.

asked Aug 27, 2020 in CO & Architecture by Ojesh Bhagat (5 points) | 34 views

0 votes

0 answers

#capacity miss #caching #misses #computer organization

asked Aug 2, 2020 in CO & Architecture by prakhar123 (7 points) | 10 views

0 votes

0 answers

computer organization(architecture) question
A computer system has 64KB main memory and 1KB data cache memory. Data transfer between cache and main memory is done using 16 * 8 blocks. The set associative method, which includes 2 blocks in each set (set), is used. LRU (Least ... in the first accesses. During the running of the program, you can show and transfer data between main memory and cache.

asked Jun 12, 2020 in CO & Architecture by helixum (5 points) | 27 views

0 votes

0 answers

made easy wb
how to solve questions like this, I got this TAG SETS WORDS 18 7 7

asked Jun 5, 2020 in CO & Architecture by ummokkate (33 points) | 23 views

0 votes

1 answer

Computer Organization And Embedded Systems Sixth Edition by Carl Hamacher Chapter 1, Problem no. 1.5, Page no. 25.

asked May 16, 2020 in CO & Architecture by Gaurav Padole (5 points) | 34 views

0 votes

1 answer

Self Doubt from COA
What would happen if we keep increasing the levels of cache, like 2 level cache is more efficient than 1 level cache so why can’t we have 20 level cache? How will it impact performance . Kindly cite the source for your answer

asked May 12, 2020 in CO & Architecture by anurag sharma (83 points) | 34 views

0 votes

0 answers

Cache Question Gate
A cache consists of a total of 128 blocks. The main memory contains 2K blocks, each consisting of 32 words. ( I )How many bits are there in each of the TAG, BLOCK and WORD field in case of direct mapping? ( ii )How many bits are there in each of the TAG, SET, and WORD field in case of 4-way set-associative mapping?

asked Apr 23, 2020 in CO & Architecture by Beastm0del (5 points) | 12 views

0 votes

1 answer

GATE2017-1-51 Video Solution
Consider a $2-$way set associative cache with $256$ blocks and uses $LRU$ replacement. Initially the cache is empty. Conflict misses are those misses which occur due to the contention of multiple blocks for the same cache set. Compulsory misses occur due ... $10$ times. The number of conflict misses experienced by the cache is _________ .

asked Apr 18, 2020 in CO & Architecture by admin (573 points) | 39 views

0 votes

0 answers

GATE2010-48 Video Solution
A computer system has an $L1$ cache, an $L2$ cache, and a main memory unit connected as shown below. The block size in $L1$ cache is $4$ words. The block size in $L2$ cache is $16$ ... ? $2 \hspace{0.1cm} nanoseconds$ $20 \hspace{0.1cm} nanoseconds$ $22 \hspace{0.1cm}nanoseconds$ $88 \hspace{0.1cm} nanoseconds$

asked Apr 18, 2020 in CO & Architecture by admin (573 points) | 14 views

0 votes

0 answers

GATE2004-IT-12, ISRO2016-77 Video Solution
Consider a system with $2$ level cache. Access times of Level $1$ cache, Level $2$ cache and main memory are $1$ $ns$, $10$ $ns$, and $500$ $ns$ respectively. The hit rates of Level $1$ and Level $2$ caches are $0.8$ and $0.9$, respectively. What is the average access time of the system ignoring the search time within the cache? $13.0$ $12.8$ $12.6$ $12.4$

asked Apr 18, 2020 in CO & Architecture by admin (573 points) | 12 views

0 votes

0 answers

GATE2017-2-45 Video Solution
The read access times and the hit ratios for different caches in a memory hierarchy are as given below: $\begin{array}{|l|c|c|} \hline \text {Cache} & \text{Read access time (in nanoseconds)}& \text{Hit ratio} \\\hline \text{$ ... fetch and $40$% are for memory operand fetch. The average read access time in nanoseconds (up to $2$ decimal places) is _________

asked Apr 18, 2020 in CO & Architecture by admin (573 points) | 8 views

0 votes

0 answers

GATE2017-2-29 Video Solution
In a two-level cache system, the access times of $L_1$ and $L_2$ caches are $1$ and $8$ clock cycles, respectively. The miss penalty from the $L_2$ cache to main memory is $18$ clock cycles. The miss rate of $L_1$ cache is twice that of $L_2$. The average memory ... respectively are $0.111$ and $0.056$ $0.056$ and $0.111$ $0.0892$ and $0.1784$ $0.1784$ and $0.0892$

asked Apr 18, 2020 in CO & Architecture by admin (573 points) | 9 views

0 votes

0 answers

GATE2007-80 Video Solution
Consider a machine with a byte addressable main memory of $2^{16}$ bytes. Assume that a direct mapped data cache consisting of $32$ lines of $64$ $bytes$ each is used in the system. A $50$ x $50$ two-dimensional array of bytes is stored in the main ... the data cache do not change in between the two accesses. How many data misses will occur in total? $48$ $50$ $56$ $59$

asked Apr 18, 2020 in CO & Architecture by admin (573 points) | 7 views

0 votes

0 answers

GATE2006-74 Video Solution
Consider two cache organizations. First one is $32 \hspace{0.2cm} KB$ $2-way$ set associative with $32 \hspace{0.2cm} byte$ block size, the second is of same size but direct mapped. The size of an address is $32 \hspace{0.2cm} bits$ in both cases . A $2-to-1$ multiplexer has ... value of $h_1$ is: $2.4 \text{ ns} $ $2.3 \text{ ns}$ $1.8 \text{ ns}$ $1.7 \text{ ns}$

asked Apr 18, 2020 in CO & Architecture by admin (573 points) | 10 views

0 votes

0 answers

GATE2010-49 Video Solution
A computer system has an $L1$ cache, an $L2$ cache, and a main memory unit connected as shown below. The block size in $L1$ cache is $4$ words. The block size in $L2$ cache is $16$ ... $888 \hspace{0.1cm} \text{nanoseconds}$ $902 \hspace{0.1cm} \text{nanoseconds}$ $968 \hspace{0.1cm} \text{nanoseconds}$

asked Apr 18, 2020 in CO & Architecture by admin (573 points) | 6 views

0 votes

0 answers

GATE2014-2-9 Video Solution
A $4$-way set-associative cache memory unit with a capacity of $16$ KB is built using a block size of $8$ words. The word length is $32$ bits. The size of the physical address space is $4$ GB. The number of bits for the TAG field is ____

asked Apr 18, 2020 in CO & Architecture by admin (573 points) | 9 views

0 votes

0 answers

GATE2014-3-44 Video Solution
The memory access time is $1$ $nanosecond$ for a read operation with a hit in cache, $5$ $nanoseconds$ for a read operation with a miss in cache, $2$ $nanoseconds$ for a write operation with a hit in cache and $10$ $nanoseconds$ for a ... . The cache hit-ratio is $0.9$. The average memory access time (in nanoseconds) in executing the sequence of instructions is ______.

asked Apr 18, 2020 in CO & Architecture by admin (573 points) | 8 views

0 votes

0 answers

GATE2017-1-54 Video Solution
A cache memory unit with capacity of $N$ words and block size of $B$ words is to be designed. If it is designed as a direct mapped cache, the length of the TAG field is 10 bits. If the cache unit is now designed as a 16-way set-associative cache, the length of the TAG field is ____________ bits.

asked Apr 18, 2020 in CO & Architecture by admin (573 points) | 10 views

0 votes

0 answers

GATE2017-1-25 Video Solution
Consider a two-level cache hierarchy with $L1$ and $L2$ caches. An application incurs $1.4$ memory accesses per instruction on average. For this application, the miss rate of $L1$ cache is $0.1$; the $L2$ cache experiences, on average, $7$ misses per $1000$ instructions. The miss rate of $L2$ expressed correct to two decimal places is ________.

asked Apr 18, 2020 in CO & Architecture by admin (573 points) | 12 views

0 votes

0 answers

GATE2014-1-44 Video Solution
An access sequence of cache block addresses is of length $N$ and contains n unique block addresses. The number of unique block addresses between two consecutive accesses to the same block address is bounded above by $k$. What is the miss ratio if the access sequence is passed ... $\left(\dfrac{1}{N}\right)$ $\left(\dfrac{1}{A}\right)$ $\left(\dfrac{k}{n}\right)$

asked Apr 18, 2020 in CO & Architecture by admin (573 points) | 6 views

0 votes

0 answers

GATE2008-35 Video Solution
For inclusion to hold between two cache levels $L_1$ and $L_2$ in a multi-level cache hierarchy, which of the following are necessary? $L_1$ must be write-through cache $L_2$ must be a write-through cache The associativity of $L_2$ must be greater than that of $L_1$ The ... be at least as large as the $L_1$ cache IV only I and IV only I, II and IV only I, II, III and IV

asked Apr 18, 2020 in CO & Architecture by admin (573 points) | 8 views

0 votes

0 answers

GATE2008-71 Video Solution
Consider a machine with a $2$-way set associative data cache of size $64$ $Kbytes$ and block size $16$ $bytes$. The cache is managed using $32$ $bi$t virtual addresses and the page size is $4$ $Kbytes$. A program to be run on this machine begins as follows: ... $32$ $Kbits$ $34$ $Kbits$ $64$ $Kbits$ $68$ $Kbits$

asked Apr 18, 2020 in CO & Architecture by admin (573 points) | 8 views

0 votes

0 answers

GATE2014-2-43 Video Solution
In designing a computer's cache system, the cache block (or cache line) size is an important parameter. Which one of the following statements is correct in this context? A smaller block size implies better spatial locality A smaller block size ... size implies a larger cache tag and hence lower cache hit time A smaller block size incurs a lower cache miss penalty

asked Apr 18, 2020 in CO & Architecture by admin (573 points) | 7 views

0 votes

0 answers

GATE2016-2-32 Video Solution
The width of the physical address on a machine is $40$ bits. The width of the tag field in a $512$ KB $8$-way set associative cache is ________ bits.

asked Apr 18, 2020 in CO & Architecture by admin (573 points) | 10 views

0 votes

0 answers

GATE2006-41 Video Solution
A CPU has a cache with block size 64 bytes. The main memory has $k$ banks, each bank being $c$ bytes wide. Consecutive $c$ − byte chunks are mapped on consecutive banks with wrap-around. All the $k$ banks can be accessed in parallel, but two ... , the latency of retrieving a cache block starting at address zero from main memory is: 92 ns 104 ns 172 ns 184 ns

asked Apr 18, 2020 in CO & Architecture by admin (573 points) | 11 views

0 votes

0 answers

GATE2016-2-50 Video Solution
A file system uses an in-memory cache to cache disk blocks. The miss rate of the cache is shown in the figure. The latency to read a block from the cache is $1$ ms and to read a block from the disk is $10$ ms. Assume that the cost of ... are in multiples of $10$ MB. The smallest cache size required to ensure an average read latency of less than $6$ ms is _________ MB.

asked Apr 18, 2020 in CO & Architecture by admin (573 points) | 13 views

0 votes

0 answers

GATE2019-1 Video Solution
A certain processor uses a fully associative cache of size $16$ kB, The cache block size is $16$ bytes. Assume that the main memory is byte addressable and uses a $32$-bit address. How many bits are required for the Tag and the Index fields respectively in the addresses generated ... $0$ bits $28$ bits and $4$ bits $24$ bits and $4$ bits $28$ bits and $0$ bits

asked Apr 18, 2020 in CO & Architecture by admin (573 points) | 6 views

0 votes

0 answers

GATE2012-54 Video Solution
A computer has a $256\text{-KByte}$, 4-way set associative, write back data cache with block size of $32\text{-Bytes}$. The processor sends $32\text{-bit}$ ... bit and $1$ replacement bit. The number of bits in the tag field of an address is $11$ $14$ $16$ $27$

asked Apr 18, 2020 in CO & Architecture by admin (573 points) | 8 views

0 votes

0 answers

GATE2001-1.7, ISRO2008-18 Video Solution
More than one word are put in one cache block to: exploit the temporal locality of reference in a program exploit the spatial locality of reference in a program reduce the miss penalty none of the above

asked Apr 18, 2020 in CO & Architecture by admin (573 points) | 9 views

0 votes

0 answers

GATE2006-80 Video Solution
A CPU has a $32 KB$ direct mapped cache with $128$ byte-block size. Suppose A is two dimensional array of size $512 \times512$ with elements that occupy $8$-bytes each. Consider the following two C code segments, $P1$ and $P2$. P1: for (i=0; i<512; i++) { for (j=0; ... by $P1$ be $M_{1}$and that for $P2$ be $M_{2}$. The value of $M_{1}$ is: $0$ $2048$ $16384$ $262144$

asked Apr 18, 2020 in CO & Architecture by admin (573 points) | 6 views

0 votes

0 answers

GATE1992-5-a Video Solution
The access times of the main memory and the Cache memory, in a computer system, are $500$ $n sec$ and $50$ $nsec$, respectively. It is estimated that $80$% of the main memory request are for read the rest for write. The hit ... through policy (where both main and cache memories are updated simultaneously) is used. Determine the average time of the main memory (in ns)

asked Apr 18, 2020 in CO & Architecture by admin (573 points) | 18 views

Page:

1
2
3
next »

9,095 questions

3,154 answers

14,583 comments

95,939 users