Basics of caches - computer architecture, Computer Engineering

Basics of Caches:

"The caches are situated on basis of blocks, the shortest amount of data which may be copied between 2 adjacent levels at a time.

"If requested data by the processor is present in some the upper level block

 Then it is known as a hit.

"If data is not found in the upper level then this request is called a miss and the data is retrieved from the lower level in the hierarchy.

"The portion of memory accesses found in the upper level is known as a hit ratio.

"The storage, which takes profit of locality of accesses, is known as cache


2029_Basics of Caches.png


Posted Date: 10/13/2012 5:15:06 AM | Location : United States

Related Discussions:- Basics of caches - computer architecture, Assignment Help, Ask Question on Basics of caches - computer architecture, Get Answer, Expert's Help, Basics of caches - computer architecture Discussions

Write discussion on Basics of caches - computer architecture
Your posts are moderated
Related Questions
RAM parity checking is the storing of a redundant parity bit showing the parity odd or even of a small amount of computer data typically one byte stored in random access memory, an

List the steps needed to perform page replacement. The steps required to perform page replacement are: 1. Find out which page is to be removed from the memory. 2. Perfor

What are the types of pipeline hazards? The various pipeline hazards are:  1. Data hazard  2. Structural Hazard  3. Control Hazard.

Explain the Paging Unit Paging mechanism functions with 4K - byte memory pages or with a new extension available to Pentium with 4M byte-memory pages. In Pentium, with new 4M-b

Phase - Thermodynamics: A phase is quantity of matter that is homogeneous throughout in chemical composition and physical structure. If the matter is all gas, all liquid or

Can we use WRITE statements in screen fields? If not how is data transferred from field data to screen fields? We cannot write field data to the screen using the WRITE stateme

At a particular moment in time the output of a COMBINATIONAL logic circuit depends uponthe inputs to the circuit at the same instant.(Unlike sequential logic circuits where the out

A sorting method which uses the binary tree concept such that label of any node is larger than all  the labels in the sub trees, is called A Sorting method which uses the binar

how can we bimpliment half substractor using nand gate

Q. What is an arithmetic processor? A distinctive CPU necessitates most of the control and data processing hardware for implementing non-arithmetic functions. As the hardware c