0
1. FI (fetch instruction) - get the next instruction
2. DI (decode instruction) - decode the opcode and operands
3. CO (calculate operands) - calculate EA of the operands
4. FO (fetch operands) - fetch operands from memory (not necessary for register
data)
5. EI (execute instruction) - execute instruction storing result if necessary
6. WO (write operand) - write the result in MEM
The decomposition of the instruction processing by 6 stages is the following.
- Fetch Instruction (FI): Read the next expected introduction into a buffer
- Decode Instruction (DI): Determine the opcode and the operand specifiers
- Calculate Operands (CO): Calculate the effective address of each source operand. This may involve displacement, register indirect, indirect or other forms of address calculations.
- Fetch Operands (FO): Fetch each operand from memory. Operands in register need not be fetched.
- Execute Instruction (EI): Perform the indicated operation and store the result, if any, in the specified destination operand location.
- Write Operand (WO): Store result in memory.
Add your answer:
Earn +20 pts
What is the term that describes the methodology by which the CPU begins running a new instruction before it finishes with the current instruction?
pipelining
Difference between static pipeline and dynamic pipeline?
static pipelining - it is composition of stages one after another means that the output of one stage is become input to the next stage we also called it linear pipelining. it is further divided in two types synchronous and asynchronous. dynamic pipeling- in it stages are connected in a liner fashion but this kind of pipeling used feedforward and feed backword connections as a input to the stages.it perform variable function but static perform fixed functions. in dynamic pipelining we can take intermediate outputs.
What nonlinear pipelining?
Nonlinear Pipeline  Dynamic  Multifunction  Allows feed back and feed forward connections,in addition to the streamline connections.  More than one output; the output of the pipelineis not necessarily from the last stage.
What technology called a processor can begin executing an instruction before it completes the previous instruction?
The 8085 microprocessor does not prefetch instructions. The 8086/8088 and higher microprocessors do, in order to boost performance. They are trading idle time in the bus-interface unit, idle time waiting on the execution unit, in order to attempt to have the next instruction already fetched and available when the execution unit finally needs it. This is done by separating the execution unit from the bus-interface unit, and allowing them to operate somewhat asynchronously. Since most instructions will be followed by instructions at the next higher address, this can boost performance by minimizing idle time.
Advantages and disadvantages of Harvard architecture?
Advantages of Harvard Architecture· Efficient Pipelining - Operand Fetch and Instruction Fetch can be overlapped.· Separate Buses for data and instructions.· Tailored towards an FPGA implementation.Disadvantages of Harvard Architecture· Not widely used.· More difficult to implement.· More pins.
What are the two types of instruction execution?
The two types of instruction execution are pipelining and not pipelining. Pipelining involves breaking down instruction execution into multiple stages that can overlap, improving efficiency. Not pipelining involves executing one instruction at a time without overlapping stages.
If a processor has begun executing an instruction before it completes the previous instruction it must be using?
pipelining
What is the term that describes the methodology by which the CPU begins running a new instruction before it finishes with the current instruction?
pipelining
What is the purpose of instruction pipelining?
An instruction pipeline is a technique used in the design of computers and other digital electronic devices to increase their instruction throughput (the number of instructions that can be executed in a unit of time).
The ability to work on more than one instruction during the four stages of processing is called?
pipelining
What frees processors from having to wait for one instruction to compleate the machine cycle before fetching the next?
pipelining
What is difference between super scalar pipeline and super pipeline?
Supserscaling and pipelining both increase instruction output. Superscaling also uses pipelining, however, superscaling allows for all the processes to be carried out at one time.
What is the difference between instruction pipelining and arithmetic pipelining?
Arithmetic pipelines differ from instruction pipelines in some important ways. They are generally synchronous. This means that each stage executes in a fixed number of clock cycles. In a synchronous pipeline, moreover, no buffering between stages is provided. Each stage must be ready to accept the data passed from a previous stage when that data is produced.Another important difference is that an arithmetic pipeline may be nonlinear. The "stages" in this type of pipeline are associated with key processing components such as adders, shifters, etc. Instead of a steady progression through a fixed sequence of stages, a task in a nonlinear pipeline may use more than one stage at a time, or may return to the same stage at several points in processing.
How is parallel processing achieved using pipelining?
A very limited form of parallelism is achieved by using pipelining in that several instructions (up to the limit of the depth of the pipeline) are being processed (each at a different stage of instruction processing) at the same time. An example of this using a 6 stage pipeline is as follows:instruction completion (this is the oldest instruction stage)data storage to memoryinstruction execution & perform input/outputdata read from memorymemory address resolutioninstruction fetch from memory (this is the newest instruction stage)This form of parallelism was first used in the IBM 7030 Stretch computer released in 1961 but did not become a common feature in computer architectures until the introduction of RISC in the 1980s. The main advantage of pipelining is that under normal conditions none of the instruction processing hardware becomes idle. The main disadvantage of pipelining is that unscheduled events (e.g. interrupts, branch mispredictions, arithmetic exceptions) cause pipeline content flushes and having to spend time reloading the now empty pipeline to resume correct processing.Some computers designed with pipelines having an unusually high number of stages had their performance so degraded by that disadvantage that real world benchmarks showed their performance to be only slightly better than the traditional nonpipelined computers, even though their estimated performance was originally much higher. RISC specified that the number of stages in the pipeline should be kept to a minimum to reduce this problem.
How is the Intel 8086 architecture designed to incorporate pipelining?
Intel 8086 has two separate units for fetching the instruction and executing the instruction. Thus while executing one instruction other instruction can be fetched. Thus it avoids the waiting time for the Execution Unit to receive other instruction. Bus Interface Unit (instruction fetching unit) stores the fetched instructions in a 6 level deep FIFO. This improves overall speed of the processor.
What is pipelining in pic microcontroller?
In PIC Microcontroller , During the Fatching of instruction no. 1it needs of one clock cycle, then after for the exicution of instruction no. 1 it reqires one extra clock cycle , but at the same time it fatches inst. no. 2 . Similarly, during the execution time of inst. no. 2 , it fatches inst. no. 3 and so on.In other words we can say that, PIC Microcontroller requires 2 clock cycle at starting the after it requires only one clock pulse. In this way we can say that instruction pipelining is done in PIC microcontroller.
Difference of scalar pipelining and vector pipelining?
Scalar pipelining offers an alternative to vector pipelining whereby the cycles are used in a linear fashion. Vector pipelining performs vector computations.
