Associative array processing, Computer Engineering

Assignment Help:

Associative Array Processing

Consider that a list of record or a table is stored in the memory and you want to search some information in that list. For example, the list having of three fields as given below:

Name   ID Number      Age

Sumit           234           23

Ramesh        136           26

Ravi             97             35

 

Suppose now that we want to search the ID number and age of Ravi. If we use conventional RAM then it is essential to give the exact physical address of entry related to Ravi in the instruction access the entry such as:

                           READ ROW 3

One more alternative idea is that we seek the whole list using the Name field as an address in the instruction such as:

                       READ NAME = RAVI

Again with serial access memory this option can be executed easily but it is a very slow process. An associative memory helps at this point and simultaneously looks at all the entries in the list and returns the desired list very fastly.

SIMD array computers have been developed with associative memory. An associative memory is content addressable memory, by which it is says that multiple memory words are accessible in parallel. The parallel accessing feature also gives support parallel compare and parallel search. This capability can be used in following applications such as:

  • Retrieval and storage of databases which are changing rapidly
  • Radar signal tracking
  • Image processing
  • Artificial Intelligence

The inherent parallelism element of this memory has great benefits and impact in parallel computer architecture. The associative memory is costly measure to RAM. The array processor built with associative memory is known as Associative array processor. In this part, we describe some of categories of associative array processor. Types of associative processors are relying on the organisation of associative memory. Thus, first we discuss about the associative memory organisation.


Related Discussions:- Associative array processing

What is a heap, What is a heap? A complete binary tree, every of whose ...

What is a heap? A complete binary tree, every of whose elements contains a value that is  greater than or equal to the value of every of its children is known a Heap

Difference between field-group header and other field groups, What is the d...

What is the difference between field-group header and other field groups? The header field group is a particular field group for the sort criteria.  The system automatically p

DBMS, DEFINE FILE ORGANISATION

DEFINE FILE ORGANISATION

Explain about operand address calculation, Q. Explain about Operand Address...

Q. Explain about Operand Address Calculation? In actual machines effective address can be a register address, memory or I/O port address. Register reference instructions for ex

Computer, How does computer started?

How does computer started?

Arrow keys - input commands, When the user is inputting commands into your...

When the user is inputting commands into your shell, it should identify the left, right , up and down arrow keys. To implement this, you will need to use the termios.h library to

Explain parsing techniques, Explain any three parsing techniques. Follo...

Explain any three parsing techniques. Following are three parsing techniques: Top-down parsing: This parsing can be viewed as an attempt to get left-most derivations of an

What do you mean by analysis and design, Analysis: Basically, it is the...

Analysis: Basically, it is the process of determining what requirement to be done before how it should be done. In order to accomplish this, the developer shows the existing sy

Add multiple layout cells, Q. Add Multiple Layout Cells ? Next you will...

Q. Add Multiple Layout Cells ? Next you will add three layout cells below the logo cell you just created. Afterwards you will insert page's navigation buttons in these cells.

Binary search tree, Given the following interface public interface WordS...

Given the following interface public interface WordSet extends Iterable { public void add(Word word); // Add word if not already added public boolean contains(Word word);

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