Registers used in organisation of an associative memory, Computer Engineering

In the organisation of an associative memory, many registers are used:

  • Comparand Register (C):This register is used to grasp the operands, which are being searched for, or being compared with.
  • Masking Register (M): It might be possible that each bit slices are not involved in parallel operations. The Masking register is used to enable or disable the bit slices.

Indicator (I) and Temporary (T) Registers: Indicator register is used to hold the present match patterns and temporary registers are used to hold the earlier

 

Posted Date: 3/4/2013 5:28:41 AM | Location : United States







Related Discussions:- Registers used in organisation of an associative memory, Assignment Help, Ask Question on Registers used in organisation of an associative memory, Get Answer, Expert's Help, Registers used in organisation of an associative memory Discussions

Write discussion on Registers used in organisation of an associative memory
Your posts are moderated
Related Questions
What are the events by which we can program "help texts" and display "possible value lists"? -PROCESS ON HELP-REQUEST (POH). -PROCESS ON VALUE-REQUEST (POV).

Write notes on Frame Filtering Techniques. Frame filtering: The most valuable function performed through bridges is frame filtering. A bridge doesn't forward a frame unles

a. Explain the hardware mechanism for handling multiple interrupt requests. b. What are handshaking signals? Describe the handshake control of data transfer during input and out

How many flip-flops are required to construct mod 30 counter ? Ans. Mod - 30 counter +/- requires 5 Flip-Flop as 30 5 . Mod - N counter counts overall ' N ' number of state

Rational RequisitePro is a needed management tool that helps project teams control the development process. RequisitePro organizes your requirements by linking Microsoft Word to a

Q. Feature of micro-instruction execution? Feature of micro-instruction execution is micro-instruction sequencing which involves address calculation of next micro-instruction.

Explain busy waiting semaphores. Weak, Busy-wait Semaphores: The simplest method to implement semaphores. Useful while critical sections last for a short time, or we

Difference between the fork -join and begin-end. The fork - join keywords: Groups several statements together.Cause statements to be evaluated in parallel (all at the same

What are the Process states? By the courses of implementation, processes change state. Status of a process is express by its present activity. Dissimilar practical states of

Q. Explain Program Source Code? Program Source Code  Every assembly language statement appears as: {identifier}  Keyword {{parameter},}  {;comment}.   Element of a