Calculating block size - computer architecture, Computer Engineering

Calculating Block Size:

BA unit of associatively -one tag for BA words

BT unit of transfer-BT words to/from primary memory as a unit

            One valid bit for each BT   words.

No need to be similar, but BT  ≤ BA

  •   Bigger blocks give lower miss rate
  •   Big block increase miss penalty 

1248_Calculating Block Size.png

Posted Date: 10/13/2012 5:26:34 AM | Location : United States







Related Discussions:- Calculating block size - computer architecture, Assignment Help, Ask Question on Calculating block size - computer architecture, Get Answer, Expert's Help, Calculating block size - computer architecture Discussions

Write discussion on Calculating block size - computer architecture
Your posts are moderated
Related Questions
Write a main function that opens an ifstream on the input file, "person.dat".  If the stream cannot be  opened, output an error message and exit.       The file format is as foll

What is a Service in SAP terminology? A service refers to something offered by an s/w component.

how can we design a multiplier by using ASM chart and then design the data controller ?!!

The Syntex used to call a screen as dialog box (pop up)is CALL SCREEN STARTING AT ENDING AT

Any data storage device. This having of  your CD-ROM drive, hard disk drive and floppy disk drive.

With the help of R-2R binary network, explain the working of a 3-bit D/A converter and derive an expression for the output voltage. Ans: We see a 3-bit R-2R ladder D/A netwo

What is virtual memory? Method that automatically move program and datablocks into the physical main memory when they are needed for execution are known as virtual memory.

What is Repository Info. Systems? It is a tool with which you can create data stored in the ABAP/4 Dictionary available

Q. Illustrate what is a Centrifugal Force? Answer:- Centrifugal force is the force that is equivalent in magnitude but opposite in direction to the centripetal force which

Chaining: In this method, instead of hashing function value as location we use it as an index into an array of pointers. Every pointer access a chain that holds the element having