Principle of locality, Computer Engineering

Assignment Help:

Principle of locality:

  • Temporal  base locality (locality in time):- If an item is referenced then it will tend to be referenced again soon.
  • Spatial locality (locality in space): If an item is referenced then items whose addresses are closely similar will tend to be referenced soon.
  • Sequentially ( the subset of spatial locality ).

The principle of locality may be exploited implementing the memory of computer as a memory hierarchy, taking benefit of all types of memories.

Method: The level near to processor (the fastest) is a subset of any level further away, and all the data is hold at the lowest level (the slowest).

 


Related Discussions:- Principle of locality

One node at the highest level in the structure, There can be more than one ...

There can be more than one node at the highest level in the structure. False.  One can describe only single node at the highest level in the structure on LDB

Why is c standard library needed, Why is C standard library needed?  C ...

Why is C standard library needed?  C Standard Library: C would have been a tough programming language in absence of the standard library. The standard library in C contains

Can an rc circuit be used as clock source for 8085, Yes, it can be used, if...

Yes, it can be used, if an accurate clock frequency is not needed. Also, the component cost is low contrast to LC or Crystal.

How many flip-flops are required to construct mod 30 counter, How many flip...

How many flip-flops are required to construct mod 30 counter ? Ans. Mod - 30 counter +/- requires 5 Flip-Flop as 30 5 . Mod - N counter counts overall ' N ' number of state

Determine about the the difference engine - pascaline, THE DIFFERENCE ENGIN...

THE DIFFERENCE ENGINE - Pascaline The difference enigne was based on the mathematical principle of finite differences and was used to solve calculations based on large numbers

State the optimal route of node, State the optimal route of node Consid...

State the optimal route of node Consider the node i which has path length K+1, with the directly preceding node on the path being j. The distance to node i is w(j, i) plus the

Explain the differences between paging and segmentation, Explain the differ...

Explain the differences between Paging and segmentation. Paging and segmentation P aging Segmentation Computer memory is separa

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