<<

Central Processing Unit 1

• Introduction

• General Register Organization

• Stack Organization

• Instruction Formats

• Addressing Modes

Transfer and Manipulation

• Program Control

• Reduced Instruction Set

Computer Organization Central Processing Unit 2 Introduction MAJOR COMPONENTS OF CPU

Storage Components Registers Flags

Execution(Processing) Components Logic Unit(ALU) Arithmetic calculations, Logical , Shifts/Rotates

Transfer Components

Control Components

Register File ALU

Control Unit

Computer Organization Central Processing Unit 3 General Register Organization GENERAL REGISTER ORGANIZATION

Clock

R1 R2 R3 R4 R5 R6 R7 (7 lines) SELA { MUX MUX } SELB

3 x 8 A bus B bus decoder

SELD OPR ALU

Output

Computer Organization Central Processing Unit 4 Control OPERATION OF CONTROL UNIT The control unit Directs the information flow through ALU by - Selecting various Components in the system - Selecting the of ALU Example: R1 <- R2 + R3 [1] MUX A selector (SELA): BUS A ← R2 [2] MUX B selector (SELB): BUS B ← R3 [3] ALU operation selector (OPR): ALU to ADD [4] Decoder destination selector (SELD): R1 ← Out Bus

3 3 3 5 Control Word SELA SELB SELD OPR

Encoding of register selection fields Binary Code SELA SELB SELD 000 Input Input None 001 R1 R1 R1 010 R2 R2 R2 011 R3 R3 R3 100 R4 R4 R4 101 R5 R5 R5 110 R6 R6 R6 111 R7 R7 R7

Computer Organization Central Processing Unit 5 Control ALU CONTROL

Encoding of ALU operations OPR Select Operation Symbol 00000 Transfer A TSFA 00001 Increment A INCA 00010 ADD A + B ADD 00101 Subtract A - B SUB 00110 Decrement A DECA 01000 AND A and B AND 01010 OR A and B OR 01100 XOR A and B XOR 01110 Complement A COMA 10000 Shift right A SHRA 11000 Shift left A SHLA Examples of ALU Microoperations

Symbolic Designation Microoperation SELA SELB SELD OPR Control Word R1 ← R2 - R3 R2 R3 R1 SUB 010 011 001 00101 R4 ← R4 ∨ R5 R4 R5 R4 OR 100 101 100 01010 R6 ← R6 + 1 R6 - R6 INCA 110 000 110 00001 R7 ← R1 R1 - R7 TSFA 001 000 111 00000 Output ← R2 R2 - None TSFA 010 000 000 00000 Output ← Input Input - None TSFA 000 000 000 00000 R4 ← shl R4 R4 - R4 SHLA 100 000 100 11000 R5 ← 0 R5 R5 R5 XOR 101 101 101 01100

Computer Organization Central Processing Unit 6 Stack Organization REGISTER STACK ORGANIZATION

Stack - Very useful feature for nested , nested loops control - Also efficient for arithmetic expression evaluation - Storage which can be accessed in LIFO - Pointer: SP - Only PUSH and POP operations are applicable stack Address Register Stack Flags 63 FULL EMPTY

Stack pointer 4 SP 3 B 2 A 1 Push, Pop operations 0 DR /* Initially, SP = 0, EMPTY = 1, FULL = 0 */ PUSH POP SP ← SP + 1 DR ← M[SP] M[SP] ← DR SP ← SP - 1 If (SP = 0) then (FULL ← 1) If (SP = 0) then (EMPTY ← 1) EMPTY ← 0 FULL ← 0

Computer Organization Central Processing Unit 7 Stack Organization MEMORY STACK ORGANIZATION

1000 Program Memory with Program, Data, PC (instructions) and Stack Segments

Data AR ()

SP 3000 stack

3997 3998 3999 4000 4001 - A portion of memory is used as a stack with a DR register as a stack pointer

- PUSH: SP ← SP - 1 M[SP] ← DR - POP: DR ← M[SP] SP ← SP + 1

- Most do not provide hardware to check stack overflow (full stack) or underflow(empty stack)

Computer Organization Central Processing Unit 8 Stack Organization REVERSE POLISH NOTATION

Arithmetic Expressions: A + B A + B Infix notation + A B Prefix or Polish notation A B + Postfix or reverse Polish notation

- The reverse Polish notation is very suitable for stack manipulation

Evaluation of Arithmetic Expressions Any arithmetic expression can be expressed in parenthesis-free Polish notation, including reverse Polish notation

(3 * 4) + (5 * 6) ⇒ 3 4 * 5 6 * +

6 4 5 5 30 3 3 12 12 12 12 42 3 4 * 5 6 * +

Computer Organization Central Processing Unit 9 Instruction Format INSTRUCTION FORMAT

Instruction Fields OP-code field - specifies the operation to be performed Address field - designates (es) or a (s) Mode field - specifies the way the or the effective address is determined

The number of address fields in the instruction format depends on the internal organization of CPU

- The three most common CPU organizations: Single organization: ADD X /* AC ← AC + M[X] */ General register organization: ADD R1, R2, R3 /* R1 ← R2 + R3 */ ADD R1, R2 /* R1 ← R1 + R2 */ MOV R1, R2 /* R1 ← R2 */ ADD R1, X /* R1 ← R1 + M[X] */ Stack organization: PUSH X /* TOS ← M[X] */ ADD

Computer Organization Central Processing Unit 10 Instruction Format THREE, AND TWO-ADDRESS INSTRUCTIONS Three-Address Instructions

Program to evaluate X = (A + B) * (C + ) : ADD R1, A, B /* R1 ← M[A] + M[B] */ ADD R2, C, D /* R2 ← M[C] + M[D] */ MUL X, R1, R2 /* M[X] ← R1 * R2 */

- Results in short programs - Instruction becomes long (many )

Two-Address Instructions

Program to evaluate X = (A + B) * (C + D) :

MOV R1, A /* R1 ← M[A] */ ADD R1, B /* R1 ← R1 + M[A] */ MOV R2, C /* R2 ← M[C] */ ADD R2, D /* R2 ← R2 + M[D] */ MUL R1, R2 /* R1 ← R1 * R2 */ MOV X, R1 /* M[X] ← R1 */

Computer Organization Central Processing Unit 11 Instruction Format ONE, AND ZERO-ADDRESS INSTRUCTIONS

One-Address Instructions - Use an implied AC register for all data manipulation - Program to evaluate X = (A + B) * (C + D) : LOAD A /* AC ← M[A] */ ADD B /* AC ← AC + M[B] */ STORE T /* M[T] ← AC */ LOAD C /* AC ← M[C] */ ADD D /* AC ← AC + M[D] */ MUL T /* AC ← AC * M[T] */ STORE X /* M[X] ← AC */ Zero-Address Instructions - Can be found in a stack-organized computer - Program to evaluate X = (A + B) * (C + D) : PUSH A /* TOS ← A */ PUSH B /* TOS ← B */ ADD /* TOS ← (A + B) */ PUSH C /* TOS ← C */ PUSH D /* TOS ← D */ ADD /* TOS ← (C + D) */ MUL /* TOS ← (C + D) * (A + B) */ POP X /* M[X] ← TOS */

Computer Organization Central Processing Unit 12 Addressing Modes ADDRESSING MODES

Addressing Modes

* Specifies a rule for interpreting or modifying the address field of the instruction (before the operand is actually referenced)

* Variety of addressing modes

- to give programming flexibility to the - to use the bits in the address field of the instruction efficiently

Computer Organization Central Processing Unit 13 Addressing Modes TYPES OF ADDRESSING MODES

Implied Mode Address of the operands are specified implicitly in the definition of the instruction - No need to specify address in the instruction - EA = AC, or EA = Stack[SP]

Immediate Mode Instead of specifying the address of the operand, operand itself is specified - No need to specify address in the instruction - However, operand itself needs to be specified - Sometimes, require more bits than the address - Fast to acquire an operand

Register Mode Address specified in the instruction is the register address - Designated operand need to be in a register - Shorter address than the memory address - Saving address field in the instruction - Faster to acquire an operand than the memory addressing - EA = IR(R) (IR(R): Register field of IR)

Computer Organization Central Processing Unit 14 Addressing Modes TYPES OF ADDRESSING MODES

Register Indirect Mode Instruction specifies a register which contains the memory address of the operand - Saving instruction bits since register address is shorter than the memory address - Slower to acquire an operand than both the register addressing or memory addressing - EA = [IR(R)] ([x]: Content of x)

Register used in Register Indirect Mode may have Autoincrement or Autodecrement features - When the address in the register is used to access memory, the value in the register is incremented or decremented by 1 automatically

Direct Address Mode Instruction specifies the memory address which can be used directly to the physical memory - Faster than the other memory addressing modes - Too many bits are needed to specify the address for a large physical memory space - EA = IR(addr) (IR(addr): address field of IR)

Computer Organization Central Processing Unit 15 Addressing Modes TYPES OF ADDRESSING MODES Indirect The address field of an instruction specifies the address of a memory location that contains the address of the operand - When the abbreviated address is used large physical memory can be addressed with a relatively small number of bits - Slow to acquire an operand because of an additional memory access - EA = M[IR(address)]

Relative Addressing Modes The Address fields of an instruction specifies the part of the address (abbreviated address) which can be used along with a designated register to calculate the address of the operand - Address field of the instruction is short - Large physical memory can be accessed with a small number of address bits - EA = f(IR(address), R), R is sometimes implied

3 different Relative Addressing Modes depending on R; * PC Relative Addressing Mode(R = PC) - EA = PC + IR(address) * Indexed Addressing Mode(R = IX, where IX: ) - EA = IX + IR(address) * Base Register Addressing Mode(R = BAR, where BAR: Base Address Register) - EA = BAR + IR(address) Computer Organization Central Processing Unit 16 Addressing Modes ADDRESSING MODES - EXAMPLES -

Address Memory 200 Load to AC Mode PC = 200 201 Address = 500 202 Next instruction R1 = 400

399 450 XR = 100 400 700

AC 500 800

600 900

Addressing Effective Content 702 325 Mode Address of AC Direct address 500 /* AC ← (500) */ 800 Immediate operand - /* AC ← 500 */ 500 800 300 Indirect address 800 /* AC ← ((500)) */ 300 Relative address 702 /* AC ← (PC+500) */ 325 Indexed address 600 /* AC ← (RX+500) */ 900 Register - /* AC ← R1 */ 400 Register indirect 400 /* AC ← (R1) */ 700 Autoincrement 400 /* AC ← (R1)+ */ 700 Autodecrement 399 /* AC ← -(R) */ 450

Computer Organization Central Processing Unit 17 Data Transfer and Manipulation DATA TRANSFER INSTRUCTIONS

Typical Data Transfer Instructions Load LD Store ST Move MOV Exchange XCH Input IN Output OUT Push PUSH Pop POP

Data Transfer Instructions with Different Addressing Modes Assembly Mode Convention Register Transfer Direct address LD ADR AC ← M[ADR] Indirect address LD @ADR AC ← M[M[ADR]] Relative address LD $ADR AC ← M[PC + ADR] Immediate operand LD #NBR AC ← NBR Index addressing LD ADR(X) AC ← M[ADR + XR] Register LD R1 AC ← R1 Register indirect LD (R1) AC ← M[R1] Autoincrement LD (R1)+ AC ← M[R1], R1 ← R1 + 1 Autodecrement LD -(R1) R1 ← R1 - 1, AC ← M[R1]

Computer Organization Central Processing Unit 18 Data Transfer and Manipulation DATA MANIPULATION INSTRUCTIONS Three Basic Types: Arithmetic instructions Logical and manipulation instructions Shift instructions Arithmetic Instructions Name Mnemonic Increment INC Decrement DEC Add ADD Subtract SUB Multiply MUL Divide DIV Add with ADDC Subtract with Borrow SUBB Negate(2’s Complement) NEG Logical and Instructions Shift Instructions Name Mnemonic Name Mnemonic Clear CLR Logical shift right SHR Complement COM Logical shift left SHL AND AND Arithmetic shift right SHRA OR OR Arithmetic shift left SHLA Exclusive-OR XOR Rotate right ROR Clear carry CLRC Rotate left ROL Set carry SETC Rotate right thru carry RORC Complement carry COMC Rotate left thru carry ROLC Enable EI Disable interrupt DI

Computer Organization Central Processing Unit 19 Program Control PROGRAM CONTROL INSTRUCTIONS

+1 In-Line Sequencing (Next instruction is fetched from the PC adjacent location in the memory)

Address from other source; Current Instruction, Stack, etc Branch, Conditional Branch, , etc Program Control Instructions Name Mnemonic Branch BR Jump JMP Skip SKP Call CALL * and TST instructions do not retain their Return RTN results of operations(- and AND, respectively). Compare(by - ) CMP They only set or clear certain Flags. Test(by AND) TST

Status Flag Circuit A B 8 8

c7 8-bit ALU c8 F7 - F0 V Z S C F7 Check for 8 zero output F Computer Organization Central Processing Unit 20 Program Control CONDITIONAL BRANCH INSTRUCTIONS

Mnemonic Branch condition Tested condition BZ Branch if zero Z = 1 BNZ Branch if not zero Z = 0 BC Branch if carry C = 1 BNC Branch if no carry C = 0 BP Branch if plus S = 0 BM Branch if minus S = 1 BV Branch if overflow V = 1 BNV Branch if no overflow V = 0 Unsigned compare conditions (A - B) BHI Branch if higher A > B BHE Branch if higher or equal A ≥ B BLO Branch if lower A < B BLOE Branch if lower or equal A ≤ B BE Branch if equal A = B BNE Branch if not equal A ≠ B Signed compare conditions (A - B) BGT Branch if greater than A > B BGE Branch if greater or equal A ≥ B BLT Branch if less than A < B BLE Branch if less or equal A ≤ B BE Branch if equal A = B BNE Branch if not equal A ≠ B

Computer Organization Central Processing Unit 21 Program Control SUBROUTINE CALL AND RETURN

SUBROUTINE CALL Call subroutine Jump to subroutine Branch to subroutine Branch and save return address Two Most Important Operations are Implied;

* Branch to the beginning of the Subroutine - Same as the Branch or Conditional Branch

* Save the Return Address to get the address of the location in the Calling Program upon exit from the Subroutine - Locations for storing Return Address • Fixed Location in the subroutine(Memory) CALL • Fixed Location in memory SP ← SP - 1 • In a processor Register M[SP] ← PC • In a memory stack PC ← EA - most efficient way RTN PC ← M[SP] SP ← SP + 1

Computer Organization Central Processing Unit 22 Program Control PROGRAM INTERRUPT Types of External interrupts External Interrupts initiated from the outside of CPU and Memory - I/O Device -> Data transfer request or Data transfer complete - Timing Device -> Timeout - Power Failure - Operator

Internal interrupts (traps) Internal Interrupts are caused by the currently running program - Register, Stack Overflow - Divide by zero - OP-code Violation - Protection Violation

Software Interrupts Both External and Internal Interrupts are initiated by the computer HW. Interrupts are initiated by the executing an instruction. - Supervisor Call -> Switching from a user mode to the supervisor mode -> Allows to execute a certain class of operations which are not allowed in the user mode

Computer Organization Central Processing Unit 23 Program Control INTERRUPT PROCEDURE

Interrupt Procedure and Subroutine Call - The interrupt is usually initiated by an internal or an external rather than from the of an instruction (except for the software interrupt)

- The address of the interrupt service program is determined by the hardware rather than from the address field of an instruction

- An interrupt procedure usually stores all the information necessary to define the of CPU rather than storing only the PC.

The state of the CPU is determined from; Content of the PC Content of all processor registers Content of status bits Many ways of saving the CPU state depending on the CPU

Computer Organization Central Processing Unit 24 RISC RISC: REDUCED INSTRUCTION SET COMPUTERS Historical Background IBM System/360, 1964 - The real beginning of modern computer - Distinction between Architecture and - Architecture: The abstract of a computer seen by an assembly-language

Compiler µ-program High-Level Instruction Hardware Language Set Architecture Implementation

Continuing growth in memory and microprogramming -> A much richer and complicated instruction sets => CISC(Complex Instruction Set Computer)

- Arguments advanced at that time Richer instruction sets would simplify Richer instruction sets would alleviate the software crisis - move as much functions to the hardware as possible - close Semantic Gap between language and the high-level language Richer instruction sets would improve architecture quality Computer Organization Central Processing Unit 25 RISC ARCHITECTURE DESIGN PRINCIPLES - IN 70’s -

* Large microprograms would add little or nothing to the cost of the machine <- Rapid growth of memory technology -> Large General Purpose Instruction Set

* Microprogram is much faster than the machine instructions <- Microprogram memory is much faster than main memory -> Moving the software functions into Microprogram for the high performance

* Execution speed is proportional to the program size -> Architectural techniques that led to small program -> High performance instruction set

* Number of registers in CPU has limitations -> Very costly -> Difficult to utilize them efficiently

Computer Organization Central Processing Unit 26 RISC COMPARISONS OF EXECUTION MODELS

A <- B + C Data: 32-bit

Register-to-register 8 4 16 Load rB B Load rC C Add rA rB rC Store rA A I = 104b; D = 96b; M = 200b

Memory-to-register 8 16 Load B Add C Store A I = 72b; D = 96b; M = 168b Memory-to-memory 8 16 16 16 Add B C A I = 56b; D = 96b; M = 152b Computer Organization Central Processing Unit 27 RISC FOUR MODERN ARCHITECTURES IN 70’s

DEC Xerox IBM 370/168 VAX-11/780 Dorado iAPX-432 Year 1973 1978 1978 1982 # of instrs. 208 303 270 222 Control mem. size 420 Kb 480 Kb 136 Kb 420 Kb Instr. size (bits) 16-48 16-456 8-24 6-321 ECL MSI TTL MSI ECL MSI NMOS VLSI

Execution model reg-mem reg-mem stack stack mem-mem mem-mem mem-mem reg-reg reg-reg

Cache size 64 Kb 64 Kb 64 Kb 64 Kb

Changes in the Implementation World in 70’s

* Main Memory is no longer 10 times slower than Microprogram memory -> microprogram rather slows down the speed

* Caches had been invented -> Further improvement on the Main Memory speed

* Compilers were subsetting architectures

Computer Organization Central Processing Unit 28 RISC CRITICISM ON COMPLEX INSTRUCTION SET COMPUTERS

Complex Instruction Set Computers - CISC

High Performance General Purpose Instructions

- Complex Instruction -> Format, Length, Addressing Modes -> Complicated control due to the complex decoding HW and decoding

- Multiple memory cycle instructions -> Operations on memory data -> Multiple memory accesses/instruction

- Microprogrammed control is necessity -> Microprogram control storage takes substantial portion of CPU area -> Semantic Gap is large between machine instruction and microinstruction

- General purpose instruction set includes all the features required by individually different applications -> When any one application is running, all the features required by the other applications are extra burden to the application

Computer Organization Central Processing Unit 29 RISC PHYLOSOPHY OF RISC

Reduce the semantic gap between machine instruction and microinstruction

1-Cycle instruction

Most of the instructions complete their execution in 1 CPU cycle - like a microoperation

* Functions of the instruction (contrast to CISC) - Very simple functions - Very simple instruction format - Similar to microinstructions => No need for microprogrammed control

* Register-Register Instructions - Avoid memory reference instructions except Load and Store instructions - Most of the operands can be found in the registers instead of main memory => Shorter instructions => Uniform instruction cycle => Requirement of large number of registers

* Employ instruction

Computer Organization Central Processing Unit 30 RISC ARCHITECTURAL METRIC

A <- B + C B <- A + C D <- D - B Register-to-register (Reuse of Operands) 8 4 16 Load rB B Load rC C Add rA rB rC I = 228b Store rA A Add rB rA rC D = 192b Store rB B M = 420b Load rD D Sub rD rD rB Store rD D Register-to-register ( allocates Operands in registers) 8 4 4 4 Add rA rB rC I = 60b Add rB rA rC D = 0b Sub rD rD rB M = 60b Memory-to-memory 8 16 16 16 Add B C A I = 168b Add A C B D = 288b Sub B D D M = 456b

Computer Organization Central Processing Unit 31 RISC CHARACTERISTICS OF RISC

Common RISC Characteristics - Operations are register-to-register, with only LOAD and STORE accessing memory - The operations and addressing modes are reduced Instruction formats are simple and do not cross word boundaries - RISC branches avoid pipeline penalties - delayed branch.

Characteristics of Initial RISC Machines IBM 801 RISC I MIPS Year 1980 1982 1983 Number of instructions 120 39 55 Control memory size 0 0 0 Instruction size (bits) 32 32 32 Technology ECL MSI NMOS VLSI NMOS VLSI Execution model reg-reg reg-reg reg-reg

Computer Organization Central Processing Unit 32 RISC COMPARISON OF INSTRUCTION

32b memory port

OP DEST SOUR1 SOUR2 A ← B + C register A ← A + 1 RISC 1 ADD rA rB rC D ← D - B operand immediate ADD rA rA 1 operand register SUB rD rD rB operand

VAX ADD register B register C register A (3 operands) operand operand operand INC SUB register A register B (1 operands) operand (2 operands) operand

register D operand

432 3 operands B C ... in memory A ... C A D D A 1 operand I D A N D in memory C I 2 operands N B in memory D ... C ... D SUB

Computer Organization Central Processing Unit 33 RISC TWO INITIAL APPROACHES TO RISC

Two Approaches to utilizing RISC registers

• The Approach - A large number of registers to store variables - Berkeley RISC I, RISC II • The Approach - A smart compiler to allocate variables most efficiently to registers - IBM 801, Stanford MIPS

Machine- Memory Dynamic Instruction Reference Occurrence Weighted Weighted Pascal C Pascal C Pascal C ASSIGN 45 38 13 13 14 15 LOOP 5 3 42 32 33 26 CALL 15 12 31 33 44 45 IF 29 43 11 21 7 13 GOTO 3 Other 6 1 3 1 2 1

=> The procedure call/return is the most time-consuming operations in typical HLL programs

Computer Organization Central Processing Unit 34 RISC REGISTER WINDOW APPROACH Observations

- Weighted Dynamic Frequency of HLL Operations => Procedure call/return is the most time consuming operations

- Locality of Procedure Nesting => The depth of procedure activation fluctuates within a relatively narrow range

- A typical procedure employs only a few passed parameters and local variables Solution

- Use multiple small sets of registers (windows), each assigned to a different procedure

- A procedure call automatically the CPU to use a different window of registers, rather than saving registers in memory

- Windows for adjacent procedures are overlapped to allow parameter passing

Computer Organization Central Processing Unit 35 RISC CALL-RETURN BEHAVIOR

Call-return behavior as a function of nesting depth and time

Computer Organization Central Processing Unit 36 RISC CIRCULAR OVERLAPPED REGISTER WINDOWS

Computer Organization Central Processing Unit 37 RISC OVERLAPPED REGISTER WINDOWS

R73 R25 Local to D R64 R16 R63 R15 R31 Common to C and D R58 R10 R26 R57 Proc D R25 Local to C R48 R16 R47 R15 R31 Common to B and C R42 R10 R26 R41 Proc C R25 Local to B R32 R16 R31 R15 R31 Common to A and B R26 R10 R26 R25 Proc B R25 Local to A R16 R16 R15 R31 R15 Common Common to A and D R10 R26 to D and A R10 R9 R9 Proc A Common to all procedures R0 R0 Global registers

Computer Organization Central Processing Unit 38 RISC BERKELEY RISC I

- 32-bit CPU - 32-bit address, 8-, 16-, 32-bit data - 32-bit instruction format - total 31 instructions - three addressing modes: register; immediate; PC relative addressing - 138 registers 10 global registers 8 windows of 32 registers each Berkeley RISC I Instruction Formats Regsiter mode: (S2 specifies a register) 31 24 23 19 18 14 13 12 5 4 0 Rd Rs 0 Not used S2 8 5 5 1 8 5

Register-immediate mode (S2 specifies an operand) 31 24 23 19 18 14 13 12 0 Opcode Rd Rs 1 S2 8 5 5 1 13

PC relative mode 31 24 23 19 18 0 Opcode COND Y 8 5 19

Computer Organization Central Processing Unit 39 RISC INSTRUCTION SET OF BERKELEY RISC I

Opcode Operands Register Transfer Description Data manipulation instructions ADD Rs,S2,Rd Rd ← Rs + S2 add ADDC Rs,S2,Rd Rd ← Rs + S2 + carry Add with carry SUB Rs,S2,Rd Rd ← Rs - S2 Integer subtract SUBC Rs,S2,Rd Rd ← Rs - S2 - carry Subtract with carry SUBR Rs,S2,Rd Rd ← S2 - Rs Subtract reverse SUBCR Rs,S2,Rd Rd ← S2 - Rs - carry Subtract with carry AND Rs,S2,Rd Rd ← Rs ∧ S2 AND OR Rs,S2,Rd Rd ← Rs ∨ S2 OR XOR Rs,S2,Rd Rd ← Rs ⊕ S2 Exclusive-OR SLL Rs,S2,Rd Rd ← Rs shifted by S2 Shift-left SRL Rs,S2,Rd Rd ← Rs shifted by S2 Shift-right logical SRA Rs,S2,Rd Rd ← Rs shifted by S2 Shift-right arithmetic

Data transfer instructions LDL (Rs)S2,Rd Rd ← M[Rs + S2] Load long LDSU (Rs)S2,Rd Rd ← M[Rs + S2] Load short unsigned LDSS (Rs)S2,Rd Rd ← M[Rs + S2] Load short signed LDBU (Rs)S2,Rd Rd ← M[Rs + S2] Load unsigned LDBS (Rs)S2,Rd Rd ← M[Rs + S2] Load byte signed LDHI Rd,Y Rd ← Y Load immediate high STL Rd,(Rs)S2 M[Rs + S2] ← Rd Store long STS Rd,(Rs)S2 M[Rs + S2] ← Rd Store short STB Rd,(Rs)S2 M[Rs + S2] ← Rd Store byte GETPSW Rd Rd ← PSW Load status word PUTPSW Rd PSW ← Rd Set status word

Computer Organization Central Processing Unit 40

Opcode Operands Register Transfer Description Program control instructions JMP COND,S2(Rs) PC ← Rs + S2 Conditional jump JMPR COND,Y PC ← PC + Y Jump relative CALL Rd,S2(Rs) Rd ← PC, PC ← Rs + S2 Call subroutine and CWP ← CWP - 1 change window CALLR Rd,Y Rd ← PC, PC ← PC + Y Call relative and CWP ← CWP - 1 change window RET Rd,S2 PC ← Rd + S2 Return and CWP ← CWP + 1 change window CALLINT Rd Rd ← PC,CWP ← CWP - 1 Call an interrupt pr. RETINT Rd,S2 PC ← Rd + S2 Return from CWP ← CWP + 1 interrupt pr. GTLPC Rd Rd ← PC Get last PC

Computer Organization Central Processing Unit 41 RISC CHARACTERISTICS OF RISC

RISC Characteristics - Relatively few instructions - Relatively few addressing modes - Memory access limited to load and store instructions - All operations done within the registers of the CPU - Fixed-length, easily decoded instruction format - Single-cycle instruction format - Hardwired rather than microprogrammed control

Advantages of RISC - VLSI Realization - Computing Speed - Design Costs and Reliability - High Level Language Support

Computer Organization Central Processing Unit 42 RISC ADVANTAGES OF RISC

• VLSI Realization Example: Control area is considerably reduced RISC I: 6% RISC II: 10% MC68020: 68% general CISCs: ~50%

--> RISC chips allow a large number of registers on the chip - Enhancement of performance and HLL support - Higher regularization factor and lower VLSI design cost

The GaAs VLSI chip realization is possible

• Computing Speed - Simpler, smaller control unit --> faster - Simpler instruction set; addressing modes;instruction format --> faster decoding - Register operation --> faster than memory operation - Register window --> enhances the overall speed of execution - Identical instruction length, One cycle instruction execution --> suitable for pipelining --> faster

Computer Organization Central Processing Unit 43 RISC ADVANTAGES OF RISC

• Design Costs and Reliability - Shorter time to design --> reduction in the overall design cost and reduces the problem that the end product will be obsolete by the time the design is completed

- Simpler, smaller control unit --> higher reliability

- Simple instruction format (of fixed length) --> ease of management

• High Level Language Support - A single choice of instruction --> shorter, simpler compiler

- A large number of CPU registers --> more efficient code

- Register window --> Direct support of HLL

- Reduced burden on compiler writer

Computer Organization