Illustrate associative memory, Computer Engineering

Assignment Help:

Q. Illustrate Associative Memory?

The time required to find an item which is stored in memory can be decreased significantly if stored data can be identified for access by contents of data itself instead of by an address. A memory unit accessed by content of data is termed as associative memory or content addressable memory (CAM). This kind of memory is accessed concurrently and in parallel on the basis of data content rather than by particular location or address. When a word is written in an associative memory then no address is given. Memory is capable of finding an empty unused location to store that word. When a word is to be read from associative memory then content of the word or portion of word is specified. Memory locates all words that matches specified content as well as marks them for reading.

Due to its organization associative memory is uniquely suited to do parallel searches by data association. Furthermore searches can be done on a complete word or on a specific field within a word. An associative memory is more costly than a random access memory since every cell should have storage capability in addition of logic circuits for matching its content with an external argument. Because of this cause associative memories are used in applications where search time is extremely critical and should be very short.


Related Discussions:- Illustrate associative memory

How can i model a bi-directional net, How can I model a bi-directional net ...

How can I model a bi-directional net with assignments influencing both source and destination? Assign statement constitutes a continuous assignment. Changes on the RHS of stat

Draw and elucidate the block diagram 8259, Draw and elucidate the block dia...

Draw and elucidate the block diagram of programmable interrupt controller 8259. The 8259A adds 8 vectored priority encoded interrupts to microprocessor. It can be expanded to 6

Positive logic nand gate is equivalent to negative logic nor, Show that a p...

Show that a positive logic NAND gate is equivalent to negative logic NOR gate. Ans:  Positive logic denotes True or 1 with a high voltage and False or 0 with a low volt

Illustrate process of swapping system, What does the swapping system do if ...

What does the swapping system do if it identifies the illegal page for swapping? If the disk block descriptor does not have any record of the faulted page, then this causes the

How many types memory mgt can divided, They are of two types. They are big ...

They are of two types. They are big endian and little endian. Memory is separated into two bank, 1:even bank 2:odd bank.

System engineering hierarcy, develop system engineering hirarcy for public ...

develop system engineering hirarcy for public health care?

Illustrate the term EDI trading patterns, Illustrate the term EDI Trading P...

Illustrate the term EDI Trading Patterns? EDI Trading Patterns are illustrated below: a. Hubs and Spokes: Several of the prime movers into the adoption of Electronic Da

What is digital versatile disk, Digital versatile disk (DVD) This is an...

Digital versatile disk (DVD) This is an optical system for storing data. It's similar to CD though typically can hold 4.7 Gbyte of data compared to only 700 MB of data on a CD.

Switch statement with the use of nested if-else statement, Compare the use ...

Compare the use of switch statement with the use of nested if-else statement. If-else statement:  When there are many conditional statements that may all evaluate to true, bu

Define syntax of mpi_scatter function, Q. Define syntax of MPI_Scatter func...

Q. Define syntax of MPI_Scatter function? MPI_Scatter(Sendaddr, Scount, Sdatatype, Receiveaddr, Rcount, Rdatatype, Rank, Comm): 'Using this function process with rank' ran

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd