Scribd
Upload
230 views

Associative Memory

Associative memory is a type of computer memory that retrieves items based on matching part of their content rather than their specific address, making it a content-addressable memory. It works by storing words in a memory array and comparing the argument register containing the search data in parallel to all words. Words that fully match set their corresponding bit in the match register. The key register acts as a mask to specify which bits in the argument are compared, allowing searches on part of the data. This allows associative memory to access data simultaneously based on its content.

Uploaded by

rampothineni2005
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
230 views

Associative Memory

Associative memory is a type of computer memory that retrieves items based on matching part of their content rather than their specific address, making it a content-addressable memory. It works by storing words in a memory array and comparing the argument register containing the search data in parallel to all words. Words that fully match set their corresponding bit in the match register. The key register acts as a mask to specify which bits in the argument are compared, allowing searches on part of the data. This allows associative memory to access data simultaneously based on its content.

Uploaded by

rampothineni2005
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Associative memory:

A type of computer memory from which items may be retrieved by matching some part of their
content, rather than by specifying their address (hence also called associative storage or Content-
addressable memory (CAM) . This type of memory is accessed simultaneously and in parallel on
the basis of data content rather than buy specific address or memory location.

From the block diagram, we can say that an associative memory consists of a memory array and
match logic for 'm' words with 'n' bits per word. The functional registers like the argument
register A and key register K each have n bits, one for each bit of a word. The match register M
consists of m bits, one for each memory word.

The words which are kept in the memory are compared in parallel with the content of the
argument register. The words that match with the word stored in the argument register set
corresponding bits in match register. Therefore reading can be accomplished by sequential
access to memory for those words whose corresponding bits in the match register have been set
The key register (K) provides a mask for choosing a particular field or key in the argument word.
If the key register contains a binary value of all 1's, then the entire argument is compared with
each memory word. Otherwise, only those bits in the argument that have 1's in their
corresponding position of the key register are compared. Thus, the key provides a mask for
identifying a piece of information which specifies how the reference to memory is made.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy