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

Determine how simulation can be developed, Determine how Simulation can be ...

Determine how Simulation can be developed To determine how a simulation can be developed for use in a real situation the below illustration has been chosen. Scenario chosen is

Define the do while loop, The do while Loop This is very similar to the...

The do while Loop This is very similar to the while loop except that the test occurs at the end of the loop body. This guarantees that the loop is executed at least once before

Example of bitwise-and operator, Example of Bitwise-AND Operator In the...

Example of Bitwise-AND Operator In the following example, the bitwise-AND operator (&) compares the bits of two integers, nNumA and nNumB: // Example of the bitwise-AND oper

Explain the working of dynamic ram - computer memory, Explain the working o...

Explain the working of Dynamic RAM? A plain piece of hardware called a DRAM controller can be used to make DRAM behave more like SRAM and the job of the DRAM controller is to p

Search methods and heuristics - artificial intelligence, Search Methods and...

Search Methods and Heuristics - Artificial intelligence: Here now we come to the question of how constraint solvers search for solutions -constraint preserving coursework of v

Marked statement is implemented , Consider the ReadRear Java method (a)...

Consider the ReadRear Java method (a) Illustrate pictures that explain the data structure every time a checkpoint is reached for the problems of sizes one, two, three and four s

What is use case and use case diagram, What is use case and use case diagra...

What is use case and use case diagram? A use case is a coherent piece of functionality that a system can give by interacting with actors. Use case includes one or more actors a

Post interrupts - computer architecture, Post interrupts - computer archite...

Post interrupts - computer architecture: Post interrupts Exact interrupts examine interrupt bit on entering WB Longer latency Handle immediately

Explain token ring, Explain Token Ring. Token Ring: A token ring is ...

Explain Token Ring. Token Ring: A token ring is a collection of single point -to-point links, which arise from a circle. In a token ring a special bi t pattern, termed as th

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