ADVANCED PROCESSOR ARCHITECTURE

Slides:



Advertisements
Similar presentations
The Fetch – Execute Cycle
Advertisements

Control path Recall that the control path is the physical entity in a processor which: fetches instructions, fetches operands, decodes instructions, schedules.
M. Mateen Yaqoob The University of Lahore Spring 2014.
PART 5: (2/2) Processor Internals CHAPTER 15: CONTROL UNIT OPERATION 1.
ARITHMETIC LOGIC SHIFT UNIT
Chapter 16 Control Unit Operation No HW problems on this chapter. It is important to understand this material on the architecture of computer control units,
Basic Computer Organization and Design
Chapter 16 Control Unit Implemntation. A Basic Computer Model.
Chapters 5 - The LC-3 LC-3 Computer Architecture Memory Map
Chapter 15 IA 64 Architecture Review Predication Predication Registers Speculation Control Data Software Pipelining Prolog, Kernel, & Epilog phases Automatic.
Computer Organization and Architecture
Dr. Bernard Chen Ph.D. University of Central Arkansas Spring 2009
Micro-operations Are the functional, or atomic, operations of a processor. A single micro-operation generally involves a transfer between registers, transfer.
Bus Architecture Memory unit AR PC DR E ALU AC INPR 16-bit Bus IR TR
Computer System Architecture ESGD2204
Chapter No 5 Basic Computer Organization And Design.
1 Basic Computer Organization & Design Computer Organization Computer Architectures Lab BASIC COMPUTER ORGANIZATION AND DESIGN Instruction Codes Computer.
Eng. Mohammed Timraz Electronics & Communication Engineer University of Palestine Faculty of Engineering and Urban planning Software Engineering Department.
Bus Architecture Memory unit AR PC DR E ALU AC INPR 16-bit Bus IR TR
Exam2 Review Dr. Bernard Chen Ph.D. University of Central Arkansas Spring 2009.
Model Computer CPU Arithmetic Logic Unit Control Unit Memory Unit
1 Purpose of This Chapter In this chapter we introduce a basic computer and show how its operation can be specified with register transfer statements.
M. Mateen Yaqoob The University of Lahore Spring 2014.
Lec 5 Basic Computer Organization
5-6 Memory Ref. Instruction
M. Mateen Yaqoob The University of Lahore Spring 2014
CSE 241 Computer Organization Lecture # 8 Ch. 7 Control Unit Dr. Tamer Samy Gaafar Dept. of Computer & Systems Engineering.
Dale & Lewis Chapter 5 Computing components
Instruction.
Ch5. 기본 컴퓨터의 구조와 설계.
GROUP 2 CHAPTER 16 CONTROL UNIT Group Members ๏ Evelio L. Hernandez ๏ Ashwin Soerdien ๏ Andrew Keiper ๏ Hermes Andino.
PART 4: (1/2) Central Processing Unit (CPU) Basics CHAPTER 12: P ROCESSOR S TRUCTURE AND F UNCTION.
8085 processor.
Control Unit Operations Chapter10:. What is Control Unit (CU)?(1)  Part of a CPU or other device that directs its operation.  Tells the rest of the.
Chapter 10 Control Unit Operation “Controls the operation of the processor”
Processor Organization
Jeremy R. Johnson William M. Mongan
Chapter 5 Computer Organization TIT 304/TCS 303. Purpose of This Chapter In this chapter we introduce a basic computer and show how its operation can.
Functions of Processor Operation Addressing modes Registers i/o module interface Memory module interface Interrupts.
REGISTER TRANSFER AND MICROOPERATIONS
UNIT 2 REGISTER TRANSFER AND MICROOPERATIONS
Basic Computer Organization and Design
SAP1 (Simple-As-Possible) Computer
REGISTER TRANSFER AND MICROOPERATIONS
Symbol Hex Code Description I=0 I=1
Micro-Operations A computer executes a program Fetch/execute cycle
William Stallings Computer Organization and Architecture
William Stallings Computer Organization and Architecture 7th Edition
Computer Organization and Design
BASIC COMPUTER ORGANIZATION AND DESIGN
Overview Instruction Codes Computer Registers Computer Instructions
Overview Instruction Codes Computer Registers Computer Instructions
Chapter 15 Control Unit Operation
BASIC COMPUTER ORGANIZATION AND DESIGN
BASIC COMPUTER ORGANIZATION AND DESIGN
By: A. H. Abdul Hafez CAO, by Dr. A.H. Abdul Hafez, CE Dept. HKU
سازمان و طراحي کامپيوتر پايه.
Instruction and Control II
Computer Architecture and Organization: L11: Design Control Lines
William Stallings Computer Organization and Architecture 7th Edition
Chapter 14 Control Unit Operation
Fundamental Concepts Processor fetches one instruction at a time and perform the operation specified. Instructions are fetched from successive memory locations.
William Stallings Computer Organization and Architecture 8th Edition
By: A. H. Abdul Hafez Computer Architecture and Organization: L06: Stored program and Instruction code.
Computer Architecture and Organization: L07: Control Sequence
Chapter 5 Basic Computer Organization and Design
Computer Architecture
Presentation transcript:

ADVANCED PROCESSOR ARCHITECTURE SVNIT, SURAT ADVANCED PROCESSOR ARCHITECTURE BY: ANKIT DHIMMAR

Summary of previous lect. Computer instructions Instruction completeness Timing & control

Control unit

Instruction cycle Fetch an instruction from memory Decode the instruction Read the effective address from memory if the instruction has an indirect address Execute the instruction

Fetch & decode T0 : AR ← PC T1 : IR ← M[AR], PC ←PC+1 T2 : D0,…,D7 ← DECODE IR(12-14), AR ←IR(0-11), I ←IR(15)

REGISTER TRANSFER FOR FETCH PHASE

DATA PATH FOR TRANSFER OF PC TO AR Place the content of PC onto the bus by making the bus selection inputs s2s1s0 equal to 010. Transfer the content of the bus to AR by enabling the LD input of AR.

Data path for transfer of memory to ir Enable the read input of memory. Place the content of memory onto the bus by making s2s1s0=111. Transfer the content of the bus to IR by enabling the LD input of IR. Increment PC by enabling the INR input of PC.

Flow chart for instruction cycle

D7IT3: AR ← M[AR] D7IT3: Nothing D7IT3: Execute a register-reference instruction D7IT3: Execute an input-output instruction

Register reference instructions D7 =1 and I = 0 These instructions use bits 0 through 11 of the instruction code to specify one of 12 (IR 0 to 11) instructions.

Execution of register reference instruction

Memory reference instructions

And to ac An instruction that performs the AND logic operation on pairs of bits in AC and the memory word specified by the effective address. The result of the operation is transferred to AC. D0T4: DR← M[AR] D0T5: AC ←AC л DR, SC ←0

ADD TO AC Instruction adds the content of the memory word specified by the effective address to the value of AC. The sum is transferred into AC and the output carry Cout is transferred to the E (extended accumulator) flip-flop. D1T4: DR← M[AR] D1T5: AC ←AC + DR,E ← Cout, SC ←0

Lda : load to ac Instruction transfers the memory word specified by the effective address to AC. D2T4: DR← M[AR] D2T5: AC ←DR,SC ←0 There is no direct path from the bus into AC. The adder & logic circuit receive information from DR which can be transferred into AC. Therefore, it is necessary to read the memory word into DR first and then transfer the content of DR into AC. The reason for not connecting the bus to the inputs of AC is the delay encountered in the adder and logic circuit. It is assumed that the time it takes to read from memory and transfer the word through the bus as well as the adder & logic circuit is more than the time of one clock cycle. By not connecting the bus to the inputs of AC one can maintain one clock cycle per microoperation.

Sta: store AC Instruction stores the content of AC into the memory word specified by the effective address. Output of AC is applied to the bus and the data input of memory is connected to the bus. D3T4: M[AR]← AC, SC ←0

Bun: branch unconditionally Instruction transfers the program to the instruction specified by the effective address. PC holds the address of the instruction to be read from memory in the next cycle. PC is incremented at time T1 to prepare it for the address of the next instruction in the program sequence. BUN instruction allows the programmer to specify an instruction out of sequence and program jumps unconditionally. D4T4: PC← AR, SC ←0

Bsa: branch and save return address Instruction is useful for branching to a portion of the program called a subroutine or procedure. When executed, the BSA instruction stores the address of the next instruction in sequence which is available in PC into a memory location specified by the effective address. The effective address plus one is then transferred to PC to serve as the address of the first instruction in the subroutine. M[AR] ← PC, PC ← AR+1

example M[135] ←21, PC ←135+1=136

It is not possible to perform the operation of the BSA instruction in one clock cycle when we use the bus system of the basic computer. To use the memory and the bus properly, the BSA instruction must be executed with a sequence of two microoperations: D5T4: M[AR] ← PC, AR ← AR+1 D5T5: PC← AR, SC ←0

ISZ : increment and skip if zero Instruction increments the word specified by the effective address, and if the incremented value is equal to 0, PC is incremented by 1. The programmer usually stores a negative number(in 2’s complement) in a memory word. As this number is repeatedly incremented by one, it eventually reaches the value of zero. At this time PC is incremented by one in order to skip the next instruction in the program.

Cont… It is not possible to increment a word inside the memory, it is necessary to read the word into DR, increment DR and store the word back into memory. D6T4: DR ← M[AR] AR ← AR+1 D6T5: DR ← DR+1 PC← AR, SC ←0 D6T6: M[AR] ← DR, if (DR =0) then (PC← PC+1), SC ←0

Control flowchart