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

Explain the term- software, Explain the term- Software Some of the key ...

Explain the term- Software Some of the key aspects of software are considered in this section. Familiarisation with software packages is generally best achieved by carrying out

Explain the uses of arithmetic processor, Explain the uses of arithmetic pr...

Explain the uses of arithmetic processor A processor has arithmetic processor (as a sub part of it) which executes arithmetic operations.  The data  type,  assumed  to  reside

Create a complete mp3 player, Write a GUI/MP3 program called MP3Random that...

Write a GUI/MP3 program called MP3Random that reads all MP3 les in a directory and plays them in random order. The GUI should have a little window with: 1. A button Next that s

What are the techniques of data collection, What are the techniques of Data...

What are the techniques of Data Collection It can be either automatic or manual. Manual techniques can include: -  Keypads/Keyboards to type in data -  touch screens to s

What is task identifier, Q. What is task identifier? Each and every PVM...

Q. What is task identifier? Each and every PVM task is uniquely recognized by an integer known as task identifier (TID) assigned by local pvmd. Messages are received from and s

Queue, A Queue is a FIFO ( rst in, rst out) data structure. Given the foll...

A Queue is a FIFO ( rst in, rst out) data structure. Given the following queue interface: public interface Queue { int size(); // current queue size boolean isEmpty(); //

Target - data phase, Target abort -computer architecture: Usually, a t...

Target abort -computer architecture: Usually, a target holds DEVSEL# asserted through the final data phase. However, if a target desserts DEVSEL# before disconnecting without

Rules for minimisation using k maps, 1) All squares containing a 1 must be ...

1) All squares containing a 1 must be grouped. 2) The largest possible groups must be formed. 3) Groups can overlap if this allows larger groups to be formed. 4) Groups mu

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