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

Analysis of parallel algorithms, A generic algorithm is mostly analysed on ...

A generic algorithm is mostly analysed on basis of subsequent parameters: the space complexity (amount of space required) and the time complexity (execution time). Generally we giv

How can we resize layout cells, Q. How can we Resize Layout Cells? To p...

Q. How can we Resize Layout Cells? To precisely design a page, you can set size of cells you add in a document. You can reposition cells in the page as well. 1.      Click o

Cut-off search - artificial intelligence, Cut-off Search: By using  a m...

Cut-off Search: By using  a minimax search, all we have to do is program, in a game playing situation our agent to look at the whole  search tree from the current state of the

Explain the storage class extern, Explain The Storage Class extern The...

Explain The Storage Class extern The Storage Class extern : One method of transmitting information across blocks and functions is to use external variables. When a variable is

Karnaugh maps, Minimisation using Boolean algebra is not always straight fo...

Minimisation using Boolean algebra is not always straight forward and sometimes it is not obvious if a further manipulation would give a simpler circuit. Karnaugh maps are a muc

Explain traffic handling capacity, Traffic Handling Capacity is given by ...

Traffic Handling Capacity is given by (A)  Switching capacity × Theoretical maximum load (B)  Switching capacity / Theoretical maximum load (C)  Theoretical maximu

Input output techniques - computer architecture, Input Output Techniques: ...

Input Output Techniques: o   Interrupt driven o   Direct Memory Access (DMA) o   Programmed Programmed I/O   CPU has control over I/O directly   Read/write

What is enhanced ide, Q. What is Enhanced IDE? The principle behind EID...

Q. What is Enhanced IDE? The principle behind EIDE interface is the same as in IDE interface however this drive has capacities varying from 10.2GB to 20.5GB. The rotation speed

What is the accessibility testing, Accessibility testing for web sites is a...

Accessibility testing for web sites is a service that can give much more than the standard point-by-point testing methods of most automated services.

Define deadlock with resource request and allocation graph, Define Deadlock...

Define Deadlock with Resource request and allocation graph (RRAG) Deadlocks can be described through a directed bipartite graph termed as a RRAG that is Resource Request All

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