Register

ISRO2007-14

• retagged by
5,814 views
8 votes
8 votes

The principal of the locality of reference justifies the use of

  1. virtual memory
  2. interrupts
  3. main memory
  4. cache memory
• retagged by
User Avatar

4 Answers

6 votes
6 votes

ans is (d)

, locality of reference, also known as the principle of locality, is a term for the phenomenon in which the same values, or related storage locations, are frequently accessed, depending on the memory access pattern.

There are two basic types of reference locality –

temporal and spatial locality.

Temporal locality refers to the reuse of specific data, and/or resources, within a relatively small time duration. Spatial locality refers to the use of data elements within relatively close storage locations. Sequential locality, a special case of spatial locality, occurs when data elements are arranged and accessed linearly, such as, traversing the elements in a one-dimensional array.

User Avatar
1 votes
1 votes
Spatial Locality of reference – this says that there is chance that element will be present in the close proximity to the reference point and next time if again searched then more close proximity to the point of reference.
Temporal Locality of reference – In this Least recently used algorithm will be used. Whenever there is page fault occurs within word will not only load word in main memory but complete page fault will be loaded because spatial locality of reference rule says that if you are referring any word next word will be referred in its register that’s why we load complete page table so complete block will be loaded.
Principle of locality of reference justifies the use of cache.
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

8 votes
8 votes
2 answers
1
go_editor asked Jun 10, 2016
3,142 views
ISRO2007-46
Consider a small $2$-way set-associative cache memory, consisting of four blocks. For choosing the block to be replaced, use the least recently (LRU) scheme. The number of cache misses for the following sequence of block addresses is $8, 12, 0, 12, 8$ $2$ $3$ $4$ $5$
Consider a small $2$-way set-associative cache memory, consisting of four blocks. For choosing the block to be replaced, use the least recently (LRU) scheme. The number o...
User Avatar
11 votes
11 votes
5 answers
2
go_editor asked Jun 10, 2016
4,789 views
ISRO2007-53
In the Big-Endian system, the computer stores MSB of data in the lowest memory address of data unit LSB of data in the lowest memory address of data unit MSB of data in the highest memory address of data unit LSB of data in the highest memory address of data unit
In the Big-Endian system, the computer storesMSB of data in the lowest memory address of data unitLSB of data in the lowest memory address of data unitMSB of data in the ...
User Avatar
8 votes
8 votes
2 answers
3
go_editor asked Jun 10, 2016
7,177 views
ISRO2007-37
In comparison with static RAM memory, the dynamic Ram memory has lower bit density and higher power consumption higher bit density and higher power consumption lower bit density and lower power consumption higher bit density and lower power consumption
In comparison with static RAM memory, the dynamic Ram memory haslower bit density and higher power consumptionhigher bit density and higher power consumptionlower bit den...
User Avatar
6 votes
6 votes
2 answers
4
go_editor asked Jun 10, 2016
4,745 views
ISRO2007-08
A read bit can be read and written by CPU and written by peripheral by peripheral and written by CPU by CPU and written by the peripheral
A read bit can be readand written by CPUand written by peripheralby peripheral and written by CPUby CPU and written by the peripheral
User Avatar
Link Copied!