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

What kinds of statements are present in an assembly language, What kinds of...

What kinds of statements are present in an assembly language program? Discuss. An assembly program contains subsequent three types of statements: 1. Imperative statements: The

How many ram chips are required for memory of 2048 bytes, How many 128 × 8 ...

How many 128 × 8 RAM chips are required to provide a memory capacity of 2048 bytes. Ans. Available here RAM chips = 128 x 8 Required the memory capacity    = 2048 x 8 No. of chip

Calculate number of calls put through by a single server, A group of 20 ser...

A group of 20 servers carry traffic of 10 erlangs. If the average duration of a call is three minutes, calculate the number of calls put through by a single server and the group as

Specifying optimisation criteria of describe function, Specifying Optimisat...

Specifying Optimisation Criteria Specify values to be minimized, maximized or optimized. You can understand it as way you normalize data in database. For instance, you should

What is perl, Perl is an interpreted language (not compiled, like Java) whi...

Perl is an interpreted language (not compiled, like Java) which is ideally suited for CGI programming. It has its roots in UNIX system administration and offers various features li

States the term ip addresses, States the term IP addresses? IP address ...

States the term IP addresses? IP address considers to the name of a computer onto a network, as the Internet. a. An Identifier for a device or computer onto a TCP/IP network

What is asynchronous transmission, What is asynchronous transmission An...

What is asynchronous transmission An asynchronous transmission technique used in many interactive terminals employ special bits. With this method each character consists of thr

What is called that switch if switch capacity is full, When a switch capaci...

When a switch capacity is full, calls coming into that switch are said to be                 . (A)  open                                            (B)  shorted (C) bloc

Minimum degree of t=1 for a b-tree, Why don't we permit a minimum degree of...

Why don't we permit a minimum degree of t=1 for a B-tree? According to the definition of B-Tree, a B-Tree of order n means that every node in the tree has a maximum of n-1 keys

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