Associative memory can search data tag for access by content of data rather than address. Dinesh Thakur is a Freelance Writer who helps different clients from all over the globe. For any type of query or something that you think is missing, please feel free to Contact us. The argument register A and key register K each have n-bits per word. Each word in memory is compared in parallel with the contents of the argument register.
The words match with the word stored in the argument register set corresponding bits in the match register. Therefore, reading can be accomplished by a sequential access to memory for those words whose corresponding bits in the match register have been set. The key register provides a mask for choosing a particular field or bits in the argument word.
Only those bits in the argument register having 1's in their corresponding position of the key register are compared.
For example, if an argument register A and the key register K have the bit configuration shown below. Angular 7. Machine Learning. Data Structures. Operating System. Computer Network. Compiler Design. Computer Organization.
Discrete Mathematics. Ethical Hacking. Computer Graphics. Software Engineering. Web Technology. Cyber Security. C Programming. The match register M has m bits, one for each memory word. Each word in memory is related in parallel with the content of the argument register. The words that connect the bits of the argument register set an equivalent bit in the match register.
After the matching process, those bits in the match register that have been set denote the fact that their equivalent words have been connected. Reading is proficient through sequential access to memory for those words whose equivalent bits in the match register have been set.
The key register supports a mask for selecting a specific field or key in the argument word.
0コメント