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

Which memory can not be accessed randomly, Which of following can not be ac...

Which of following can not be accessed randomly DRAM, SRAM, ROM or Magnetic tape ? Ans. Magnetic tape cannot be accessed randomly; it can only be accessed sequentially.

Write a short notes on storage classes in c, Write a short notes on storage...

Write a short notes on storage classes in C. Every variable and function in C has two attributes : type and storage class. The four storage classes are automatic, external, reg

Explain a TTL NAND gate and its operation, Give the circuit of a TTL NAND g...

Give the circuit of a TTL NAND gate and explain its operation in brief. Ans: Operation of TTL NAND Gate: Fig.(d) Demonstrates a TTL NAND gate with a totem pole output.

How are comparisons done in 8086 assembly language, Q. How are comparisons ...

Q. How are comparisons done in 8086 assembly language? There is a compare instruction CMP. Though this instruction just sets the flags on comparing two operands (both 16 bits

What are the two types of branch prediction techniques, What are the two ty...

What are the two types of branch prediction techniques available?  The two types of branch prediction methods are  1) Static branch prediction  2) Dynamic branch predicti

Describe the micro programmed control unit in detail, Describe the micro pr...

Describe the micro programmed control unit in detail. A micro programmed control unit is built around a storage unit is known as a control store where all the control signals a

Explain the types of hardware used in supermarkets, Explain the types of ha...

Explain the types of hardware used in supermarkets These use many types of specialist I/O hardware. For instance: -  Bar code readers/scanners (to read product details and e

Web designing, how to start a web designing would you please guide me

how to start a web designing would you please guide me

Recursive binary search, The implementation of a (non-recursive) binary sea...

The implementation of a (non-recursive) binary search of an array. The assumption is that a given array is sorted. We want to see if a particular value, that we'll call the target

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