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

Queue depth should be greater than zero, Tell me which queue having present...

Tell me which queue having present queue depth should be greater than zero? Ans) Event queues Open MQ Explorer by selecting Start > Programs > IBM WebSphere MQ > WebSphere

Mode counter, desing mode level counter starting at 0011 using D flipflop

desing mode level counter starting at 0011 using D flipflop

Explain loop-invariant code motion, Explain briefly Loop-invariant code ...

Explain briefly Loop-invariant code motion of the commonly used code optimization techniques. Loop-invariant code motion If a quantity is calculated inside a loop duri

Define the terms - spatial locality and temporal locality, Define the terms...

Define the terms : spatial locality and temporal locality. Spatial Locality:  The spatial aspect means that instructions in close proximity to a recently implemented instruct

Simplify the expressions by using boolean postulates, Simplify the given ex...

Simplify the given expressions using Boolean postulates Y = (A + B)(A‾ + C)(B + C) Ans. Y = (A + B)(A‾ + C)(B + C) = (A A‾ + AC + B A‾ + BC) (B + C) = (AC + B A‾ + BC) (B + C)

Explain demand paging, What is Demand paging? Virtual memory is commonl...

What is Demand paging? Virtual memory is commonly executed by demand paging. In demand paging, the pager brings only those essential pages into memory instead of swapping in a

How much CMOS circuits consume power, CMOS circuits consume power ? An...

CMOS circuits consume power ? Ans. As in CMOS one device is ON and one is Always OFF therefore power consumption is low or can say less than TTL.

Processor technology , Processor Technology: Computers consist of elec...

Processor Technology: Computers consist of electronic components assembled in a design or "architecture" that will perform necessary functions of input, output, computation an

What do you mean by linker, Q. What do you mean by Linker? For modular...

Q. What do you mean by Linker? For modularity of your programs it is better to break your program in numerous sub routines. It's even better to put common routine such as read

Determine the 2's complement subtraction, Perform 2's complement subtractio...

Perform 2's complement subtraction of (7) 10 - (11) 10 . Ans. 2's Complements Subtraction of (7) 10 - (11) 10 Firstly convert the decimal numbers 7 and 11 to there binary e

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