Explain bit-o-ring technique, Computer Engineering

Assignment Help:

Explain bit-O-Ring technique.

The micro program represents that branches are not always made to a one branch address. This is a direct consequence of combining easy micro routines by sharing common parts. Consider a point in the micro program sequencing. At this point, it is essential to choose between actions needed by direct and indirect addressing modes. If the indirect mode is specified in the instruction, then the microinstruction in the location 170 is performed to get the operand from the memory. If the direct mode is specified, this get must be bypassed by branching immediately to location 171. The most efficient way to bypass microinstruction 170 is to have the preceding branch microinstructions state the address 170 and then use an OR gate change the least significant bit of this address to '1' if the direct addressing mode is included. This is known as the bit-O-ring technique for modifying branch address.

 


Related Discussions:- Explain bit-o-ring technique

Parallel random access machines, PRAM is one among the models which are use...

PRAM is one among the models which are used for designing the parallel algorithm as shown in Figure. The PRAM model comprises the following components: i)  A group of identical

Register-to-register architecture, Register-to-Register Architecture : In t...

Register-to-Register Architecture : In this organization, results and operands are accessed not directly from the main memory by the scalar or vector registers. The vectors which a

What qualifications needs to be an security professionals, Qualifications o...

Qualifications of security professionals For the security professionals, it is essential that they have adequate freedom to check the security measures and enforce them and

Static memories - computer architecture, Static memories Circuits c...

Static memories Circuits capable of receiving their state as long as power is applied volatile Static RAM(SRAM)

What does formal verification mean, What does formal verification mean? ...

What does formal verification mean? Formal verification uses Mathematical techniques by proving the design by assertions or properties. Correctness of the design can be achiev

What is race condition, What is Race condition? Race condition: The c...

What is Race condition? Race condition: The circumstances where several processes access - and manipulate shared data-concurrently. The last value of the shared data depends

Define the full form of ssl, Define the full form of SSL SSL has becom...

Define the full form of SSL SSL has become fundamental to the spread of Internet community, and commerce and trade over Internet. Over years, the spread of its use for an incr

Define the register length, Q. Define the Register Length? Register Le...

Q. Define the Register Length? Register Length: Asignificant characteristic related to registers is length of a register. Generally the length of a register is dependent on it

Determine the simplified sop boolean expression, Reduce the following equat...

Reduce the following equation using k-map Y = BC‾D‾ + A‾BC‾D + ABC‾D + A‾BCD + ABCD Ans. Multiplying the first term with (A+A') Y = A'BC'D' + ABC'D' + A'BC'D + ABC'D + A'BCD + A

Define the while loop, The while Loop The while loop repeats a statemen...

The while Loop The while loop repeats a statement until the test at the top proves false. As an example, here is a function to return the length of a string. int string_leng

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