Fully parallel associative processor (fpap), Computer Engineering

Fully Parallel Associative Processor (FPAP): This processor accepts the bit parallel memory organisation. FPAP has two type of this associative processor named as:

  • Word Organized associative processor: In this processor one comparison logic is used with every bit cell of each word and the logical decision is achieved at the output of each word.
  • Distributed associative processor: In this processor comparison logic is provided with every difficult cell of a fixed number of bits or with a group of character cells. This is less difficult and thus less costly compared to word organized associative processor.

 

Posted Date: 3/4/2013 5:30:12 AM | Location : United States







Related Discussions:- Fully parallel associative processor (fpap), Assignment Help, Ask Question on Fully parallel associative processor (fpap), Get Answer, Expert's Help, Fully parallel associative processor (fpap) Discussions

Write discussion on Fully parallel associative processor (fpap)
Your posts are moderated
Related Questions
Explain an exceptional handling in java with the help of suitable example. Java exception handling is managed through five keywords: catch, try, throw, finally and throws. Th

How many ways can an argument be passed to a subroutine in programming? Ans)  An argument can be passed in two way in a programming language. They are Pass by Value and Passi

The idea of clustering is defined as use of multiple computers naturally multiple storage devices, PCs or UNIX workstations and their interconnections to make what emerges to users

Explain the difference between a subroutine & macro. It is inefficient to have to write code for standard routines.  For instance reading a character form the keyboard or savin

Explain the uses of arithmetic processor A processor has arithmetic processor (as a sub part of it) which executes arithmetic operations.  The data  type,  assumed  to  reside

What is swapping?   A process can be swapped out temporarily of memory to a backing store and after that brought back in memory for execution as continued.

Associativity of Connectives : Here brackets are very important in order to tell us where to perform calculations in arithmetic and logic. By using these brackets we evaluate

How many address bits are required to represent 4K memory ? Ans. 12 address bits are required for representing 4K memory, as 4K = 2 2 x 2 10   = 2 12 Therefore 1K = 1024

Parallelism Conditions As discussed earlier, parallel computing needs that the segments to be implemented in parallel must be free of each other. Thus, before implementing para

Open a LOCAL MACHINE window and type: xhost +ashland # Add the following code sequence just before the plot command that was giving you problems: figure; set(gcf,'renderer','zbuffe