Associative array processing, Computer Engineering

Assignment Help:

Consider that a list of record or a table is stored in the memory and you wish to find some information in that particular list. E.g. the list comprises three fields as displayed below:

331_Associative Array Processing.png

Assume that we want to find the age and ID number of Ravi. If we use conventional RAM, it is essential to give the exact physical address of entry associated to Ravi in the instruction access entry such as:

    READ ROW 3

Another alternative idea is that we explore the whole list by means of the Name field as an address in instruction like:

    READ NAME = RAVI

Again with serial access memory this option may be implemented simply but it's a very slow process. An associative memory assists at this point and concurrently examines all the entries in the list and returns the desired list very rapidly. SIMD array computers have been developed with associative memory. This memory is content addressable memory by which it's meant that multiple memory words are accessible concurrently. The parallel accessing feature support parallel search and parallel compare too. This ability can be used in numerous applications like:

  • Radar signal tracking
  • Image processing
  • Artificial Intelligence
  • Retrieval and Storage of databases that are changing rapidly

The inherent parallelism characteristic of this memory has huge advantages and impact in parallel computer architecture. The associative memory is expensive compared to RAM. The array processor built with associative memory is termed as Associative array processor. In this section we explain a number of categories of associative array processor. Kinds of associative processors are based on organisation of associative memory. So first we discuss about associative memory organisation.


Related Discussions:- Associative array processing

Multi-layer network architectures, Multi-Layer Network Architectures: ...

Multi-Layer Network Architectures: As we considered we saw in the previous lecture that perceptrons have limited scope in the type of concepts that they can learn - but they c

Ring, Ring This is a easy linear array where the end nodes are connecte...

Ring This is a easy linear array where the end nodes are connected.  It is equivalent to a engage with wrap around connections. The data transmit in a ring is normally one dire

Password cracking, Hashed strings can often be deciphered by 'brute forcing...

Hashed strings can often be deciphered by 'brute forcing'. Bad news, eh? Yes, and particularly if your encrypted passwords/usernames are floating around in an unprotected file some

How many bits must be decoded for 128 × 8 ram chips, How many bits must be ...

How many bits must be decoded for chip select? What is the size of decoder when 128 × 8 RAM chips are required to provide a memory capacity of 2048 bytes? Ans. All higher order l

The source to the current version, How do I update an existing copy of the ...

How do I update an existing copy of the source to the current version? Ans) As the common code changes, you might need to update your copy to have the lastest version. To do tha

Adding layers to the timeline, ADDING LAYERS TO THE TIMELINE AND GIVING MOT...

ADDING LAYERS TO THE TIMELINE AND GIVING MOTION TO THE LAYER Step 1:  Choose Layer from Common toolbar after that draw a layer. Step 2:  Write the text inside Layer. Step

Simplify the Boolean expression, The Boolean expression A‾.B + A.B‾ + A.B i...

The Boolean expression A‾.B + A.B‾ + A.B is equivalent to ? Ans. The Boolean expression A‾ .B + A. B‾+ A.B is equivalent to A + B (A‾ .B + A. B‾+ A.B = B( A‾ + A) + A. B‾ =

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