Write-allocate and no-write-allocate policy in a cache, Computer Engineering

Assignment Help:

(a) How does a data cache take advantage of spatial locality? Give an suitable example.

(b) What are the basic differences between a write-allocate and no-write-allocate policy in a cache?

(c) With the help of a fully labeled diagram, distinguish between direct and related mapping in cache memory?

(d) One example of a semiconductor memory is the DRAM

(i) Describe why a 16 Mbit DRAM chip is better being organised as compared a (2048 x 2048) x 4-bit array instead of 1M of 16 bit words.

(ii) Show a typical block diagram of the array, showing the row and column buffer blocks, refresh circuitry amongst others.

(iii) Approximately how many transistors and capacitors are required to construct a 4 MB DRAM?

(e) Describe two reasons why SRAM could be better than DRAM.

(f) Briefly explain how a multiple platter hard disk works.


Related Discussions:- Write-allocate and no-write-allocate policy in a cache

Compare ss7 architecture with seven-layer osi architecture, Compare the arc...

Compare the architecture of SS7 with seven-layer OSI architecture The relationship among these levels and the layers of the OSI model is demonstrated in figure. The user part i

Subtract two number by using 1's complement, Subtract the given number usin...

Subtract the given number using 1's complement 11011 - 11001 Ans. 11011 - 11001 = X - Y                             X =    11011  1's complement of Y =    00110

Derivatives and applications of derivatives, What can you say about the exi...

What can you say about the existence of a stationary point in the interval [ 1; 3] for the function f (x) = x 2 2x 3.

What is an identification method, An identification method notifies Robot h...

An identification method notifies Robot how to recognize the values to compare during record and playback.

Difference between depth first and breadth first traversing, Explain the di...

Explain the difference between depth first and breadth first traversing techniques of a graph.   Depth-first search is dissimilar from Breadth-first search in the following way

Carry look-ahead adder and booth''s algorithm, Describe carry look-ahead ad...

Describe carry look-ahead adder? Ans: The input carry required by a stage is directly computed from carry signals obtained from all of the preceding stages i-1,i-2,.....0, rat

Show the simple arithmetic application, Q. Show the Simple Arithmetic Appli...

Q. Show the Simple Arithmetic Application? The question is why can't we simply employ XCHG instruction with 2 memory variables as operand? To answer the question let's look int

Simple maze game, The following is a requirements specification for a simpl...

The following is a requirements specification for a simple game based on a player moving through a maze of connected rooms from an entrance door to an exit door. The required sy

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd