Instruction issue degree in superscalar processing, Computer Engineering

Assignment Help:

Q. Instruction Issue degree in superscalar processing?

The major concept in superscalar processing is how many instructions we are able to issue per cycle. If we are able to issue k number of instructions for each cycle in a superscalar processor then that processor is known as a k-degree superscalar processor. If we wish to exploit the full parallelism from a superscalar processor then k instructions should be executable in parallel.

For illustration, we think about a 2-degree superscalar processor with 4 pipeline phases for instruction cycle which means instruction fetch (IF), decode instruction (DI), fetch the operands (FO), execute the instruction (EI) as displayed in Figure below. In this superscalar processor 2 instructions are issued per cycle as displayed in Figure below. Here, 6 instructions in 4 stage pipelines have been executed in 6 clock cycles. Under ideal situations, after steady state, two instructions are being executed for each cycle.

917_Instruction Issue degree in superscalar processing.png

Figure: Superscalar processing of instruction cycle in 4-stage instruction pipeline


Related Discussions:- Instruction issue degree in superscalar processing

Describe characteristics needed for an e-commerce server, Describe the addi...

Describe the additional characteristics needed for an e-commerce server? E-commerce services need dynamic configuration abilities and seasonal and every day service configurat

What is compact disk rom, Q. What is Compact Disk ROM? Both audio CD an...

Q. What is Compact Disk ROM? Both audio CD and CD-ROM (compact disk read-only memory) share similar technology. Main difference is that CD-ROM players are more rugged and have

Explain bus, Define bus. When a word of data is transferred among units...

Define bus. When a word of data is transferred among units, all the bits are transferred in parallel over a set of lines called bus. In addition to the lines that take the data

Learning decision trees using id3 - artificial intelligence, L e arning D...

L e arning Decision Trees Using ID3 Sp eci f y i n g the Problem We now have to look at how you mentally created your decision tree when deciding what to do at

Process of minimax algorithm, Process of Minimax algorithm: Our aim is...

Process of Minimax algorithm: Our aim is just to write the best of best score on the top branches of the tree that player one can guarantee to score if he chooses that move.

Simplify the expression by using karnaugh map, Simplify   the   following  ...

Simplify   the   following   expression   into   sum   of   products   using   Karnaugh   map F(A, B, C, D) = ∑ (1,3,4,5,6,7,9,12,13) Ans. Simplification of the giv

Functions employed for messaging passing, Q. Functions employed for messagi...

Q. Functions employed for messaging passing? The functions employed for messaging passing are: int MPI_Send(void *msgaddr, int count, MPI_Datatype datatype, int dest, int ta

What is mini computer, Q. What is Mini computer? The term minicomputer ...

Q. What is Mini computer? The term minicomputer introduced in 1960's when it was realized that numerous computing tasks don't need an expensive modern mainframe computers howev

Swing, how to make a dfd of simple calculator?

how to make a dfd of simple calculator?

Perceptrons of artificial neural networks, Perceptrons: However the we...

Perceptrons: However the weights in any ANN are usually just real numbers and the learning problem boils down to choosing the best value for each weight in the network. Becaus

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