Professional Documents
Culture Documents
Associative Memory
Associative Memory
Associative Memory
Match
register
Input
Associative memory
array and logic M
Read
Write m words
n bits per word
Output
Associative memory of an m word, n cells per word
A1 Aj An
K1 Kj Kn
Word 1 C 11 C 1j C 1n M1
Word i C i1 C ij C in Mi
Word m C m1 C mj C mn Mm
Write
R S Match
F ij To M i
logic
Read
Output
The average time required to reach a storage location in
memory and obtain its contents is called the ……….
A) Seek Time
B) Transfer Time
C) Access Time
D) Turnaround Time
Match logic
Neglect the K bits and compare the argument in A with the bits
stored in the cells of the words.
K1 A1 K2 A2 Kn An
Mi
In a vectored interrupt
If only one word may match the unmasked argument field, then
connect output Mi directly to the read line in the same word
position,
If we exclude words having zero content, then all zero output will
indicate that no match occurred and that the searched item is
not available in memory.
Write Operation