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

Trace the pseudo-code, Consider the following pseudo-code segment. 1.  i...

Consider the following pseudo-code segment. 1.  input y {y is a three-digit hexadecimal number} 2.  d ← 0 3. for i = 1 to 3      3.1. char ← i th character from y readin

Handshake packets - computer architecture, Handshake packets: Handshak...

Handshake packets: Handshake packets consist of nothing but a PID byte, and are usually sent in response to data packets. The 3 basic types are, NAK, indicating that the data

Explain j2ee, With respect to security, which one is the better choice? ...

With respect to security, which one is the better choice? .Net or J2EE? Explain? As per majority programmers .NET is the best one which have single vendor compare to, the

Write an interrupt routine to handle division by zero, Q. Write an interrup...

Q. Write an interrupt routine to handle 'division by zero'? This file can be loaded just like a COM file though makes itself permanently resident until the system is running.

Problem solving in parallel-, Problem Solving In Parallel Introduction ...

Problem Solving In Parallel Introduction to Parallel Computing This section examines how a particular task can be broken into minor subtasks and how subtasks can be answer i

General purpose register - assembly language, General purpose register - as...

General purpose register - assembly language: Basic ISA Classes: Accumulator: 1 address add Aacc ←acc + mem [A] Stack: 0 address add to s ←to s+ next G

Difference between data warehousing and data mining, What is the difference...

What is the difference between data warehousing and data mining? The dissimilarity between data warehousing and data mining: Data warehousing seems to the data storage wh

Explain about distributed systems, Q. Explain about distributed systems? ...

Q. Explain about distributed systems? A Distributed System in that Data, Process and Interface component of information System are distributed to many locations in a computer n

Define program counter, Define Program Counter(PC) The Program Counter ...

Define Program Counter(PC) The Program Counter holds the address of the next instruction to be read from memory after the current instruction is implemented.

Which data structures used in language processing, Which structure can be u...

Which structure can be used as a criterion for classification of data structures used in language processing. And. Nature of a data structure, purpose of a data structure and l

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