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

Write an applet that display the directory holding html file, Write an appl...

Write an applet that display the directory holding the HTML file that started the applet and the directory from which, applet class file was loaded. An applet is here given bel

Programming in c, Write a program to find the area under the curve y = f(x)...

Write a program to find the area under the curve y = f(x) between x = a and x = b, integrate y = f(x) between the limits of a and b. The area under a curve between two points can b

Five design principles, Visibility. Controls should be clearly visible, so ...

Visibility. Controls should be clearly visible, so users can see the controls that are available to them. Visual feedback should also be clearly visible, so users can understand wh

How many types of stages include in process of data mining, How many types ...

How many types of stages include in process of data mining? The process of data mining comprised three stages as given below: a) The initial exploration b) Model buildin

Doubly linked list, A doubly linked list is like a linked list except that ...

A doubly linked list is like a linked list except that each node has a pointer both to the next node in the list and to the previous node in the list. There are also pointers to th

Evaluate sop expression, Q. For function F(x,y,z) = ∑m(0,1,2,6,7) using TRU...

Q. For function F(x,y,z) = ∑m(0,1,2,6,7) using TRUTH TABLE only.   1. Find SOP expression 2. Implement this simplified expression using two level AND-to-OR gate network 3. I

Maximum number of nodes in a binary tree, The maximum number of nodes in a ...

The maximum number of nodes in a binary tree of depth 5 is 31 is the maximum number of nodes in a binary tree

Enginering mechanics, if 2 forces are equal at an angle alpha between them...

if 2 forces are equal at an angle alpha between them - its resultant R and its direction

Explain non-pre-emptive algorithms, Explain non-pre-emptive algorithms?   ...

Explain non-pre-emptive algorithms?   Non preemptive algorithms: In this algorithm a job is provided to CPU for execution as long as the job is non-completed the CPU cannot

Decoder, how to make a dec oder

how to make a dec oder

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