You may be speculative however the central processor is programmed. It contains a special register — the instruction register — whose bit pattern determines what the central processor unit can do. Once that action has been completed, the bit pattern within the instruction register may be modified, and also the central processor unit can perform the operation nominative by this next bit pattern.
Since directions are simply bit patterns, they will be kept in memory. The instruction pointer register continuously has the memory address of (points to) the next instruction to be executed. so as for the management unit to execute this instruction, it’s derived into the instruction register. the case is as follows:
- A sequence of instructions is stored in memory.
- The memory address wherever the first instruction is found is copied to the instruction pointer.
- The CPU sends the address within the instruction pointer to memory on the address bus.
- The CPU sends a “read” signal to the control bus.
- Memory responds by sending a copy of the state of the bits at that memory location on the
data bus, that the CPU then copies into its instruction register.
- The instruction pointer is automatically incremented to contain the address of the next
instruction in memory.
- The CPU executes the instruction within the instruction register.
- Go to step 3
Steps 3, 4, and 5 are called an instruction fetch. Notice that steps 3 – 8 constitute a cycle, the instruction execution cycle. It is shown graphically below.
Attention reader! Don’t stop learning now. Get hold of all the important CS Theory concepts for SDE interviews with the CS Theory Course at a student-friendly price and become industry ready.
- Program execution transfer instructions in 8086 microprocessor
- Computer Organization and Architecture | Pipelining | Set 1 (Execution, Stages and Throughput)
- Manufacturing Execution Systems
- Do You Want To Be An Entrepreneur - Explore The Path Before Execution
- Difference between Load Time and Execution Time address binding
- Difference between Compile Time and Execution Time address binding
- Essential Registers for Instruction Execution
- Longest Remaining Time First (LRTF) CPU Scheduling Program
- What's difference between CPU Cache and TLB?
- Multilevel Queue (MLQ) CPU Scheduling
- Shortest Job First CPU Scheduling with predicted burst time
- Multilevel Feedback Queue Scheduling (MLFQ) CPU Scheduling
- Highest Response Ratio Next (HRRN) CPU Scheduling
- Priority CPU Scheduling with different arrival time - Set 2
- Difference between Preemptive Priority based and Non-preemptive Priority based CPU scheduling algorithms
- Introduction of Stack based CPU Organization
- Longest Remaining Time First (LRTF) CPU Scheduling Algorithm
- Introduction of Single Accumulator based CPU organization
- Introduction of General Register based CPU Organization
- What are Threads in Computer Processor or CPU?
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.