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
Task: Sets and bags In mathematics, the notion of multiset (or bag) is a generalisation of the notion of set. A bag is a special kind of container in which the items may be

Multiplicity Multiplicity in an association specifies tells us about number of objects participate in a relationship. It decides the number of related objects. Multiplicity is

What is partition? Partitions divide a system into several independent or weakly coupled subsystems, each giving one kind of service. Partitions use peer-peer subsystems.

Advantages of random scan display Early computer displays: basically an oscilloscope. Control X, Y with vertical/horizontal plate voltage. Often used intensity as

What is Redundant Array of Independent Disks? Researchers are constantly trying to improve secondary storage media by raising their, performance, capacity as well as reliabilit

Hill Climbing - Artificial Intelligence: As we've seen, in some problems, finding the search path from primary to goal state is the point of the exercise. In other problems, t

What is a Priority Interrupt? A priority interrupt is an interrupt that establishes a priority over the various sources to determine which condition is to be serviced first whe

scan line seed fill algorithm program using opengl

What is data hazard? Any condition that causes the pipeline to stall is known as a hazard. A data hazard is any condition in which either the source or destination operands of

Parallel Virtual Machine (PVM): PVM (Parallel Virtual Machine) is portable message passing programming system which is designed to link different heterogeneous host machines to