Show two way pipelined timing, Computer Engineering

Assignment Help:

Q. Show Two Way Pipelined Timing?

Figure below demonstrates a simple pipelining scheme in which F and E stages of two different instructions are performed concurrently. This scheme increases the execution rate of sequential scheme.

752_Show Two Way Pipelined Timing.png

Figure: Two Way Pipelined Timing

Please note that pipeline above isn't running at its full capacity. This is ought to the following problems:

  • We are presuming a single port memory so only one memory access is permitted at aninstance. SoData and Fetch transfer operations can't take place at the same instance. So you may notice blank in time slot 3, 5 etc.
  • Last instruction is an unconditional jump. Please note that after this instruction subsequent instruction of calling program will be executed. Though not visible in this illustration a branch instruction interrupts the sequential flow of instruction execution. So causing inefficiencies in pipelined execution.

This pipeline can simply be improved by allowing two memory accesses at a time.  

So modified pipeline will be:

Pipeline may suffer due to data dependencies and branch instructions penalties. A good pipeline has equivalent phases.

2000_Show Two Way Pipelined Timing1.png

Figure: Three-way Pipelining Timing


Related Discussions:- Show two way pipelined timing

Name some pure object oriented languages, Some pure object oriented languag...

Some pure object oriented languages are Smalltalk, Eiffel,  Java, Sather.

State the features of pentium series of microprocessors, State the features...

State the features of Pentium series of microprocessors: Pentium is a 32-bit superscalar, CISC microprocessor.  The term superscalar is used for processor that contains more th

Analysts in computer operations, Q. Analysts in Computer Operations? Co...

Q. Analysts in Computer Operations? Computer Operations: All of the shared computers comprising mainframes, minicomputers and other computers are put to operation and same is c

What is the last entry in all bdc tables, What is the last entry in all BDC...

What is the last entry in all BDC tables? In all BDC tables the last entry is to save the data by using the field name BDC_OKCODE and a field value of '/11'.

What is a map, What is a Map? A Map is an Array, which having the addre...

What is a Map? A Map is an Array, which having the addresses of the free space in the swap device that are allocatable resources, and the number of the resource units available

Pvm communication model, Q. PVM communication model? A nonblocking rece...

Q. PVM communication model? A nonblocking receive as soon as returns with either data or a flag that data hasn't arrived while a blocking receive returns only when data is in r

Microprocessor and interfacing, Write an ALP to count positve and numbers f...

Write an ALP to count positve and numbers from array.

System programming, concurrentisation and vectorisation of program

concurrentisation and vectorisation of program

Advantage of using interrupt initiated data transfer, What is the advantage...

What is the advantage of using interrupt initiated data transfer over transfer under program control without interrupt? In the interrupt initiated data transfer, the processor

Propositional truth tables, Propositional truth tables: There {X\t} is...

Propositional truth tables: There {X\t} is a substitution that replaces all occurances of variable X with a term representing an object t as:  ∀X. A is true if and only

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