Instruction pipeline-level of processing, Computer Engineering

Classification according to level of processing

According to this classification, computer operations are classified as arithmetic operations and instruction implementation. Next, we talk about these classes of this classification:

Instruction Pipeline: As we know that an instruction cycle may consist of several operations like, decode opcode, fetch opcode, compute operand addresses, fetch operands, and implement instructions. These operations of the instruction implementation cycle can be realized by the pipelining concept. Each of these operations forms one phase of a pipeline. The overlapping of implementation of the operations through the pipeline gives a speedup over the common execution. Thus, the pipelines used for instruction cycle operations are called as instruction pipelines.

 

 

Posted Date: 3/2/2013 6:57:59 AM | Location : United States







Related Discussions:- Instruction pipeline-level of processing, Assignment Help, Ask Question on Instruction pipeline-level of processing, Get Answer, Expert's Help, Instruction pipeline-level of processing Discussions

Write discussion on Instruction pipeline-level of processing
Your posts are moderated
Related Questions
Q. How to Access the Disk Data? Disks operate is semi-random mode of operation and generally referenced block wise. The data access time on a disk comprises two major component


Vector-Vector Instructions In this type, vector operands are fetched by the vector register and saved in another vector register. These instructions are indicated with the foll

Q. Explain functions of direct memory access? Though CPU intervention in DMA is minimised however it should use path between interfaces that is system bus. So DMA involves an e

Explain the term- Scan Insertion Scan Insertion is completed by a tool and results in all (or most) of your design's flip-flops to be changed by special "Scan Flip-flops". Sca

With a C program to read the text book number, title, author and publisher into a structure and print these values. # include # include void main() { struct boo

Forward checking: Whether to add some sophistication to the search method there constraint solvers use a technique called as forward checking. So here the general idea is to w

time to left (TTL) in transport layer

Choose the descriptions below with the most appropriate memory management scheme (A through D).  Solutions may be used once, more than once, or not at all. A.     Fixed-partitio

Explain in brief about the broadband It isn't just computers which can be linked without wires, different peripheral devices can be linked to a computer system without the need