What is content addressable memory, Computer Engineering

What is content addressable memory?

The memory unit accessed by the content is known as an associative memory or content addressable memory. This type of memory is accessed concurrently and in parallel on the basis of data content rather than by exact address or location.  

 

Posted Date: 7/27/2013 3:04:59 AM | Location : United States







Related Discussions:- What is content addressable memory, Assignment Help, Ask Question on What is content addressable memory, Get Answer, Expert's Help, What is content addressable memory Discussions

Write discussion on What is content addressable memory
Your posts are moderated
Related Questions
What do you understand by Electronic Funds Transfer?  Electronic Funds Transfer: It's an electronic payment method that transfers the money value from one bank account to

Q. What do you mean by Keyboard Touch? When employing a keyboard the most important factor is the feel of keyboard it implies that how typing feels on that specific keyboard.

Q. What is Hypercube Network? The hypercube architecture has played a significant role in development of parallel processing and is quite influential and popular. The highly sy

Q. Illustrate Left shift register with parallel load? A register that shifts data in one direction only is known as Uni-directional shift register and a register that can shift

What logic gets synthesized when I use an integer instead of a reg variable as a storage element? Is use of integer recommended? An  integer  can  take  place  of  a  reg  as

advantages and disadvantages of a header node

Equivalence between VHDL and C? There is concept of understanding in C there is structure.Based upon requirement structure provide facility to store collection of various data

Q. Analysis of Amdahls law? The conclusions of analysis of Amdahl's law are: 1) To optimize performance of parallel computers modified compilers should be developed that sho

for calculating simple interest

Why don't we permit a minimum degree of t=1 for a B-tree? According to the definition of B-Tree, a B-Tree of order n means that every node in the tree has a maximum of n-1 keys