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

Explain the term - rational rose and visio 2000 enterprise, Explain the ter...

Explain the term - Rational Rose and Visio 2000 Enterprise Rational Rose: IBM Rational RequisitePro is a powerful and easy-to-use tool for use case management and requirement

Computer network, how Hierarchical Routing implement in c or cpp

how Hierarchical Routing implement in c or cpp

Responsibilities of objects, The Transaction object is responsible for read...

The Transaction object is responsible for reading the transaction file, finding the relevant account in the array of customers and applying the transaction. To find the relevant ac

Graph has a minimum spanning tree already computed, Assume that a graph has...

Assume that a graph has a minimum spanning tree already computed.  How fastly can the minimum spanning tree be updated if a new vertex and incident edges are added to G? If the

Dynamic partitioning - computer architecture, Dynamic partitioning: To...

Dynamic partitioning: To rise above from difficulties with fixed partitioning, partitioning can be done dynamically, which called dynamic partitioning. Having it, the primary

Define the types programmable logic devices?, Define the types Programmable...

Define the types Programmable logic devices? There are mostly three types PLDs. These are vary in the placement of fuses in the AND- OR array. 1. ROM- It has fixed AND array

Appropriate name for the superclass, Suppose that your team is then asked t...

Suppose that your team is then asked to expand the system. The publisher now wishes to make other computer science publications. As a team member, you are asked to make a class tha

What are the major functions of io system, What are the major functions of ...

What are the major functions of IO system?  i. Interface to the CPU and memory by the system bus.  ii. Interface to one or more IO devices by tailored data link.

Explain the for loop, Explain The for loop The for loop is frequently ...

Explain The for loop The for loop is frequently used, usually where the loop will be traversed a fixed number of times. It is very flexible, and novice programmers should take

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