NTU self-examination process detailed
self-examination-computer application major
2020 system structure series: analysis of major questions
Conflict-free access, storage body split storage principle
- Knowledge review
- Consolidation of examples
-
- 1. What is the minimum number m of the memory?
- 2. Draw the distribution of each element of the array in each sub-body of the memory (assuming that the sub-body number starts from 0, the internal address starts from i+0, and a00 has been stored in the sub-body number 2, and the internal address is i+ 0 position).
Knowledge review
Be sure to memorize the formula, this topic is just with the formula set
Consolidation of examples
1. What is the minimum number m of the memory?
The formula in the set of knowledge points, m=2^2p+1, m>n (n=4), and m is equal to a prime number, P is a positive integer, and p is at least 1. In summary, m is at least 5
2. Draw the distribution of each element of the array in each sub-body of the memory (assuming that the sub-body number starts from 0, the internal address starts from i+0, and a00 has been stored in the sub-body number 2, and the internal address is i+ 0 position).
The formula in the set of knowledge points
Body number address: j=(aδ1+bδ2+c)mod m
body address: i=a
Among them, ab is the subscript of any element Aab in A,
and c is the body number address of the starting element A00.
The sufficient condition for realizing conflict-free access is to let δ1=2^p, δ2=1
According to the above question,
Find the position of a01 (01 is the subscript ab)
, then p=1, m=5, δ1=2, δ2=1, a=0, b=1, c=2 (the title has been given, a00 is stored in the subscript The body number is 2)
into the formula
Body number address: j=(axδ1+bxδ2+c)mod m=(0x2+1x1+2) mod 5=3mod5=3
body address: i=a=0
, that is, a01 body number address is 3, body address is 0
By analogy, find a02~a33, as shown in the figure below
Little water monsters who love programming, welcome to pay attention. Please point out any mistakes, let's work together.