1 / 41

IKI10230 Pengantar Organisasi Komputer Kuliah no. 4: CISC vs. RISC Instruction Sets

IKI10230 Pengantar Organisasi Komputer Kuliah no. 4: CISC vs. RISC Instruction Sets. Sumber : 1. Hamacher. Computer Organization , ed-5. 2. Materi kuliah CS61C/2000 & CS152/1997, UCB. 12 Maret 2003 Bobby Nazief (nazief@cs.ui.ac.id) Qonita Shahab (niet@cs.ui.ac.id)

lexine
Download Presentation

IKI10230 Pengantar Organisasi Komputer Kuliah no. 4: CISC vs. RISC Instruction Sets

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. IKI10230Pengantar Organisasi KomputerKuliah no. 4: CISC vs. RISC Instruction Sets Sumber:1. Hamacher. Computer Organization, ed-5.2. Materi kuliah CS61C/2000 & CS152/1997, UCB. 12 Maret 2003 Bobby Nazief (nazief@cs.ui.ac.id)Qonita Shahab (niet@cs.ui.ac.id) bahan kuliah: http://www.cs.ui.ac.id/kuliah/iki10230/

  2. Review: Jenis-jenis Operasi Data Transfers memory-to-memory move register-to-register move memory-to-register move Arithmetic & Logic integer (binary + decimal) or FP Add, Subtract, Multiply, Divide shift left/right, rotate left/right not, and, or, set, clear Program Sequencing & Control unconditional, conditional Branch call, return trap, return Input/Output Transfers register-to-i/o device move Synchronization test & set (atomic r-m-w) String search, translate Graphics (MMX) parallel subword ops (4 16bit add)

  3. Review: Modus Pengalamatan (1/2) JenisSyntaxEffective Address • Immediate: #Value ; Operand = Value Add #10,R1 ; R1  [R1] + 10 • Register: Ri ; EA = Ri Add R2,R1 ; R1  [R1] + [R2] • Absolute (Direct): LOC ; EA = LOC Add 100,R1 ; R1  [R1] + [100] • Indirect-Register: (Ri) ; EA = [Ri] Add (R2),R1 ; R1  [R1] + [[R2]] Indirect-Memory: (LOC) ; EA = [LOC] Add (100),R1 ; R1  [R1] + [[100]]

  4. Review: Modus Pengalamatan (2/2) • Index: X(R2) ; EA = [R2] + X Add 10(R2),R1 ; R1  [R1] + [[R2]+10] Base+Index: (R1,R2) ; EA = [R1] + [R2] Add (R1,R2),R3 ; R3  [R3] + [[R1]+[R2]] Base+Index+Offset: X(R1,R2) ; EA = [R1] + [R2] + X Add 10(R1,R2),R3 ; R3  [R3] + [[R1]+[R2]+10] • Relative: X(PC) ; EA = [PC] + X Beq 10 ; if (Z==1) then PC  [PC]+10 • Autoincrement: (Ri)+ ; EA = [Ri], Increment Ri Add (R2)+,R1 ; R1  [R1] + [[R2]], ; R2  [R2] + d • Autodecrement: -(Ri) ; DecrementRi, EA = [Ri] Add -(R2),R1 ; R2  [R2] – d, ; R1  [R1] + [[R2]]

  5. Solusi PR #1 • 2.8 A x X + C x D pada single-accumulator processor Load A Multiply B ; Accumulator = A x B Store X ; X can be A, B, or others except C or D Load C Multiply D ; Accumulator = C x D Add X ; Accumulator = A x B + C x D

  6. Solusi PR #1 • 2.9 Jumlah nilai dari N siswa, J tes; J >> jumlah register Move #SUM,R0 ; R0 points to SUM Move J,R1 ; R1 = j Move R1,R2 Add #1,R2 Multiply #4,R2 ; R2 = (j + 1)*4 Lj: Move #LIST,R3 ; R3 points to first student Move J,R4 Sub R1,R4 ; R4: index to particular test of first student Multiply #4,R4 Add R4,R3 ; R3 points to particular test of first student Move N,R4 ; R4 = n Clear R5 ; Reset the accumulator Ln: Add (R3),R5 ; Accumulate the sum particular test Add R2,R3 ; R3 points to particular test of next student Decrement R4 Branch>0 Ln ; Iterate for all students Move R5,(R0) ; Store the sum of particular test Add #4,R0 ; R0 point to sum of the next test Decrement R1 Branch>0 Lj ; Iterate for all tests

  7. Solusi PR #1 • 2.10 (a)“Dot product” pada arsitektur Load/Store Move #AVEC,R1 ; R1 points to vector A. Move #BVEC,R2 ; R2 points to vector B. Load N,R3 ; R3 serves as a counter. Clear R0 ; R0 accumulates the product. LOOP: Load (R1)+,R4 Load (R2)+,R5 Multiply R5,R4 ; Compute the product of next ; components. Add R4,R0 ; Add to previous sum. Decrement R3 ; Decrement the counter. Branch>0 LOOP ; Loop again if not done. Store R0,DOTPROD ; Store the product in memory.

  8. Solusi PR #1 • 2.13 Effective Address R1 = 1200, R2 = 4600 Load 20(R1),R5 ; EA = [R1] + 20 = 1200 + 20 = 1220 Move #3000,R5 ; EA = tidak ada (#3000: immd. value) Store R5,30(R1,R2) ; EA = [R1] + [R2] + 30 = 5830 Add -(R2),R5 ; EA = [R2] – 1 = 4600 – 1 = 4599 Subtract (R1)+,R5 ; EA = [R1] = 1200

  9. Solusi PR #1 • 2.14 Linked list Move #1000,R0 Clear R1 Clear R2 Clear R3 LOOP: Add 8(R0),R1 Add 12(R0),R2 Add 16(R0),R3 Move 4(R0),R0 Compare #0,R0 BNE LOOP Move R1,SUM1 Move R2,SUM2 Move R3,Sum3

  10. RISC vs. CISC

  11. RISC vs. CISC • RISC = Reduced Instruction Set Computer • Term coined at Berkeley, ideas pioneered by IBM, Berkeley, Stanford • RISC characteristics: • Load-store architecture • Fixed-length instructions (typically 32 bits) • Three-address architecture • Simple operations • RISC examples: MIPS, SPARC, IBM/Motorola PowerPC, Compaq Alpha, ARM, SH4, HP-PA, ... • CISC = Complex Instruction Set Computer • Term referred to non-RISC architectures • CISC characteristics: • Register-memory architecture • Variable-length instructions • Complex operations • CISC examples: Intel 80x86, VAX, IBM 360, …

  12. MIPS

  13. MIPS I Registers • Programmable storage • 2^32 x bytes of memory • 31 x 32-bit GPRs (R0 = 0) • 32 x 32-bit FP regs (paired DP) • HI, LO, PC

  14. MIPS Addressing Modes/Instruction Formats • All instructions 32 bits wide Register (direct) op rs rt rd register Immediate op rs rt immed Base+index op rs rt immed Memory register + PC-relative op rs rt immed Memory PC + • Destination first: OPcode Rdest,Rsrc1,Rsrc2

  15. MIPS Data Transfer Instructions Instruction Comment SW500(R4), R3 Store word SH502(R2), R3 Store half SB41(R3), R2 Store byte LW R1, 30(R2) Load word LH R1, 40(R3) Load halfword LHU R1, 40(R3) Load halfword unsigned LB R1, 40(R3) Load byte LBU R1, 40(R3) Load byte unsigned LUI R1, 40 Load Upper Immediate (16 bits shifted left by 16) LUI R5 R5 0000 … 0000

  16. MIPS Arithmetic Instructions Instruction Example Meaning Comments add add $1,$2,$3 $1 = $2 + $3 3 operands subtract sub $1,$2,$3 $1 = $2 – $3 3 operands add immediate addi $1,$2,100 $1 = $2 + 100 + constant add unsigned addu $1,$2,$3 $1 = $2 + $3 3 operands subtract unsigned subu $1,$2,$3 $1 = $2 – $3 3 operands add imm. unsign. addiu $1,$2,100 $1 = $2 + 100 + constant multiply mult $2,$3 Hi, Lo = $2 x $3 64-bit signed product multiply unsigned multu$2,$3 Hi, Lo = $2 x $3 64-bit unsigned product divide div $2,$3 Lo = $2 ÷ $3,Hi = $2 mod $3 divide unsigned divu $2,$3 Lo = $2 ÷ $3, Hi = $2 mod $3 Move from Hi mfhi $1 $1 = Hi Used to get copy of Hi Move from Lo mflo $1 $1 = Lo Used to get copy of Lo

  17. MIPS Logical Instructions Instruction Example Meaning Comment and and $1,$2,$3 $1 = $2 & $3 3 reg. operands or or $1,$2,$3 $1 = $2 | $3 3 reg. operands xor xor $1,$2,$3 $1 = $2 Å $3 3 reg. operands nor nor $1,$2,$3 $1 = ~($2 |$3) 3 reg. operands and immediate andi $1,$2,10 $1 = $2 & 10 Logical AND reg, constant shift left logical sll $1,$2,10 $1 = $2 << 10 Shift left by constant shift right logical srl $1,$2,10 $1 = $2 >> 10 Shift right by constant shift right arithm. sra $1,$2,10 $1 = $2 >> 10 Shift right (sign extend) shift left logical sllv $1,$2,$3 $1 = $2 << $3 Shift left by variable shift right logical srlv $1,$2, $3 $1 = $2 >> $3 Shift right by variable shift right arithm. srav $1,$2, $3 $1 = $2 >> $3 Shift right arith. by variable

  18. MIPS Compare and Branch Instructions • Compare and Branch • BEQ rs, rt, offset if R[rs] == R[rt] then PC-relative branch • BNE rs, rt, offset<> • Compare to zero and Branch • BLEZ rs, offsetif R[rs] <= 0 then PC-relative branch • BGTZ rs, offset > • BLT < • BGEZ >= • BLTZAL rs, offsetif R[rs] < 0 then branch and link (into R 31) • BGEZAL>=

  19. MIPS Compare and Set, Jump instructions Instruction Example Meaning set on less than slt $1,$2,$3 if ($2 < $3) $1=1; else $1=0 Compare less than; 2’s comp. set less than imm slti $1,$2,100 if ($2 < 100) $1=1; else $1=0 Compare < constant; 2’s comp. set less than uns. sltu $1,$2,$3 if ($2 < $3) $1=1; else $1=0 Compare less than; natural numbers set l. t. imm. uns. sltiu $1,$2,100 if ($2 < 100) $1=1; else $1=0 Compare < constant; natural numbers jump j 10000 go to 10000 Jump to target address jump register jr $31 go to $31 For switch, procedure return jump and link jal 10000 $31 = PC + 4; go to 10000 For procedure call

  20. MIPS I/O Instructions • MIPS tidak memiliki instruksi khusus untuk I/O • I/O diperlakukan sebagai “memori”  Status Register & Data Register “dianggap” sebagai memori

  21. Contoh Program: Vector Dot Product LUI R1,high(AVEC) ; R1 points to vector A. ORI R1,R1,low(AVEC) LUI R2,high(BVEC) ; R2 points to vector B. ORI R2,R2,low(BVEC) LUI R6,high(N) LW R3,low(N)(R6) ; R3 serves as a counter. AND R4,R4,R0 ; R4 accumulates the product. LOOP: LW R5,0(R1) ; Compute the product of LW R6,0(R2) ; next components. MULT R5,R5,R6 ADD R4,R4,R5 ; Add to previous sum. ADDI R3,R3,-1 ; Decrement the counter. BNE R3,R0,LOOP ; Loop again if not done. LUI R6,high(DOTPROD) ; Store the product in memory. SW low(DOTPROD)(R6),R4

  22. x86

  23. Intel History: ISA evolved since 1978 • 8086: 16-bit, all internal registers 16 bits wide; no general purpose registers; ‘78 • 8087: + 60 Fl. Pt. instructions, (Prof. Kahan) adds 80-bit-wide stack, but no registers; ‘80 • 80286: adds elaborate protection model; ‘82 • 80386: 32-bit; converts 8 16-bit registers into 8 32-bit general purpose registers; new addressing modes; adds paging; ‘85 • 80486, Pentium, Pentium II: + 4 instructions • MMX: + 57 instructions for multimedia; ‘97 • Pentium III: +70 instructions for multimedia; ‘99 • Pentium 4: +144 instructions for multimedia; '00

  24. x86 Registers Program Counter (PC)

  25. Organization of Segment Registers

  26. Prefix Opcode Mod R/M SIB Displacement Immediate Instruction Format • Ukuran instruksi [n] bervariasi: 1  n  16 byte 0, 1, 2, 3, 4 1, 2 0,1 0,1 0, 1, 2, 3, 4 0, 1, 2, 3, 4 • Prefix: (Lock, Repeat), Overrides: Segment, Operand Size, Address Size • ModR/M: Addressing Mode • SIB: Scale, Index, Base • Displacement: Displacement’s Value • Immediate: Immediate’s Value • Konvensi: OPcode dst,src ; dst  dst OP src MOV AL,BL ; byte (8 bit) MOV AX,BX ; word (16 bit) MOV EAX,EBX ; double-word (32 bit)

  27. Addressing Modes • Immediate • Register • Direct (Absolute) • Indirect (Register) • Index:

  28. Addressing Modes: Contoh • Immediate: MOV EAX,25 ; EAX  25 MOV EAX,NUM ; NUM: konstanta • Register: MOV EAX,EBX ; EAX  [EBX] • Direct (Absolute): MOV EAX,LOC ; EAX  [LOC] ; LOC: label alamat MOV EAX,[LOC]; EAX  [LOC] • Register Indirect: MOV EBX,OFFSET LOC ; EBX  #LOC MOV EAX,[EBX] ; EAX  [[EBX]] • Index: • Base+disp.: MOV EAX,[EBP+10] ; EAX  [EBP+10] • Index+disp.: MOV EAX,[ESI*4+10] ; EAX  [ESI*4+10] • Base+Index: MOV EAX,[EBP+ESI*4] ; EAX  [EBP+ESI*4] • Base+Index+disp.: MOV EAX,[EBP+ESI*4+10] ; EAX  [EBP+ESI*4+10]

  29. Data Transfer Instructions • MOV Move • PUSH Push onto stack • PUSHA/PUSHAD Push GP registers onto stack • XCHG Exchange • CWD/CDQConvert word to doubleword/Convertdoubleword to quadword • XLAT Table lookup translation • CMOVEConditional move if equal • CMOVNEConditional move if not equal • CMPXCHG Compare and exchange

  30. Arithmetic Instructions • Binary Arithmetic: • ADD, ADC, SUB, SBB • IMUL, MUL, IDIV, DIV • INC, DEC, NEG, CMP • Decimal Arithmetic: • DAA Decimal adjust after addition • DAS Decimal adjust after subtraction • AAA ASCII adjust after addition • AAS ASCII adjust after subtraction

  31. Logical Instructions • ANDAnd • OROr • XORExclusive or • NOTNot • … • SAR/L Shift arithmetic right/left • SHR/L Shift logical right/left • SHRDShift right double • SHLDShift left double • ROR/L Rotate right/left • RCR/L Rotate through carry right/left

  32. Branch Instructions • JMP Jump • JE/JZ Jump if equal/Jump if zero • JNE/JNZ Jump if not equal/Jump if not zero • JC Jump if carry • JNC Jump if not carry • JCXZ/JECXZ Jump register CX zero/Jump register ECX zero • LOOP Loop with ECX counter • INT Software interrupt • IRET Return from interrupt

  33. I/O Instructions • INRead from a port • OUT Writeto a port

  34. String • MOVS/MOVSB Move string/Move byte string • MOVS/MOVSW Move string/Move word string • MOVS/MOVSD Move string/Move doubleword string • INS/INSB Input string from port/Input byte string from port • OUTS/OUTSB Output string to port/Output byte string to port • CMPS/CMPSB Compare string/Compare byte string • SCAS/SCASB Scan string/Scan byte string • REP Repeat while ECX not zero • REPE/REPZ Repeat while equal/Repeat while zero • REPNE/REPNZ Repeat while not equal/Repeat while not zero

  35. HLL Support & Extended Instruction Sets • HLL Support: • BOUND Detect value out of range • ENTER High-level procedure entry; creates a stack frame • LEAVE High-level procedure exit; reverses the action of previous ENTER • Extended: • MMX Instructions • Operate on Packed (64 bits) Data simultaneously  use 8 MMX Register Set • Floating-point Instructions • System Instruction • Streaming SIMD Extensions • Operate on Packed (128 bits) Floating-point Data simultenously  uses 8 XMMX Register Set

  36. Contoh Program: Vector Dot Product LEA EBP,AVEC ; EBP points to vector A. LEA EBX,BVEC ; EBX points to vector B. MOV ECX,N ; ECX serves as a counter. MOV EAX,0 ; EAX accumulates the product. MOV EDI,0 ; EDI is an index register. LOOPSTART: MOV EDX,[EBP+EDI*4] ; Compute the product of IMUL EDX,[EBX+EDI*4] ; next components. INC EDI ; Increment index. ADD EAX,EDX ; Add to previous sum. LOOP LOOPSTART ; Loop again if not done. MOV DOTPROD,EAX ; Store the product in memory.

  37. MIPS (RISC) vs. Intel 80x86 (CISC)

  38. MIPS vs. Intel 80x86 • MIPS: “Three-address architecture” • Arithmetic-logic specify all 3 operands add $s0,$s1,$s2 # s0=s1+s2 • Benefit: fewer instructions  performance • x86: “Two-address architecture” • Only 2 operands, so the destination is also one of the sources add $s1,$s0 # s0=s0+s1 • Often true in C statements: c += b; • Benefit: smaller instructions  smaller code

  39. MIPS vs. Intel 80x86 • MIPS: “load-store architecture” • Only Load/Store access memory; rest operations register-register; e.g., lw $t0, 12($gp) add $s0,$s0,$t0 # s0=s0+Mem[12+gp] • Benefit: simpler hardware  easier to pipeline, higher performance • x86: “register-memory architecture” • All operations can have an operand in memory; other operand is a register; e.g., add 12(%gp),%s0 # s0=s0+Mem[12+gp] • Benefit: fewer instructions  smaller code

  40. MIPS vs. Intel 80x86 • MIPS: “fixed-length instructions” • All instructions same size, e.g., 4 bytes • simple hardware  performance • branches can be multiples of 4 bytes • x86: “variable-length instructions” • Instructions are multiple of bytes: 1 to 16;  small code size (30% smaller?) • More Recent Performance Benefit: better instruction cache hit rates • Instructions can include 8- or 32-bit immediates

  41. MIPS vs. x86: Code Length LUI R1,high(AVEC) ORI R1,R1,low(AVEC) LUI R2,high(BVEC) ORI R2,R2,low(BVEC) LUI R6,high(N) LW R3,low(N)(R6) AND R4,R4,R0 LOOP:LW R5,0(R1) LW R6,0(R2) MULT R5,R5,R6 ADD R4,R4,R5 ADDI R3,R3,-1 BNE R3,R0,LOOP LUI R6,high(DOTPROD) SW low(DOTPROD)(R6),R4 LEA EBP,AVEC LEA EBX,BVEC MOV ECX,N MOV EAX,0 MOV EDI,0 LOOPSTART: MOV EDX,[EBP+EDI*4] IMUL EDX,[EBX+EDI*4] INC EDI ADD EAX,EDX LOOP LOOPSTART MOV DOTPROD,EAX

More Related