isa - How to Speak Computer High Level Language Program...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
struction Set Architecture Instruction Set Architecture or “How to talk to computers if you aren’t on Star Trek” CSE 240A Dean Tullsen How to Speak Computer pm p High Level Language Program temp = v[k]; [k] = v[k+1]; g Compiler lw $15, 0($2) 16 ($2) v[k] v[k 1]; v[k+1] = temp; Assembly Language Program lw $16, 4($2) sw $16, 0($2) sw $15, 4($2) Assembler Machine Language Program 1000110001100010000000000000000 1000110011110010000000000000100 1010110011110010000000000000000 ontrol Signal Spec Machine Interpretation 1010110001100010000000000000100 CSE 240A Dean Tullsen Control Signal Spec ALUOP[0:3] <= InstReg[9:11] & MASK Crafting an ISA Designing an ISA is both an art and a science ISA design involves dealing in an extremely rare resource me things we want out of our ISA Some things we want out of our ISA – completeness – orthogonality and – compactness – ease of – ease of implementation CSE 240A Dean Tullsen Where are the instructions? Harvard architecture Von Neumann architecture inst orage inst & data cpu “stored-program” computer data storage storage cpu storage 1 L1 t L1 inst cache cpu Mem L2 cache CSE 240A Dean Tullsen data cache
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Key ISA decisions Ky perations operation destination operand operations – how many? – which ones y = x + b source operands operands – how many? – location – types – how to specify? instruction format how does the computer know what 0001 0100 1101 1111 – size – how many formats? means? CSE 240A Dean Tullsen Choice 1: Operand Location ccumulator Accumulator Stack egisters Registers Memory We can classify most machines into 4 types: accumulator , stack , register-memory (most operands can be registers or emory) ad ore rithmetic operations must have memory), load-store (arithmetic operations must have register operands).
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 01/21/2010 for the course CSE240A 662015 taught by Professor Tullsen,deanmichael during the Fall '09 term at UCSD.

Page1 / 6

isa - How to Speak Computer High Level Language Program...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online