lec2-mipsex_jae.ppt - MIPS Processor Example 1 Outline \u2022 Design Partitioning \u2022 MIPS Processor Example \u2022 \u2022 \u2022 \u2022 \u2022 Architecture

lec2-mipsex_jae.ppt - MIPS Processor Example 1 Outline...

This preview shows page 1 - 14 out of 42 pages.

MIPS Processor Example 1
Outline Design Partitioning MIPS Processor Example Architecture Microarchitecture Logic Design Circuit Design Physical Design Fabrication, Packaging, Testing 2
Coping with Complexity How to design System-on-Chip? Many millions (even billions!) of transistors Tens to hundreds of engineers Structured Design Reuse at Various Levels of Abstraction Parametrics Design Partitioning 3
Structured Design Hierarchy : Divide and Conquer Recursively system into modules Regularity Reuse modules wherever possible Ex: Standard cell library Modularity : well-formed interfaces Allows modules to be treated as black boxes Locality Physical and temporal 4
Design Partitioning Architecture : User’s perspective, what does it do? Instruction set, registers MIPS, x86, Alpha, PIC, ARM, … Microarchitecture Single cycle, multcycle, pipelined, superscalar? Logic : how are functional blocks constructed Ripple carry, carry lookahead, carry select adders Circuit : how are transistors used Complementary CMOS, pass transistors, domino Physical : chip layout Datapaths, memories, random logic 5
Gajski Y-Chart 6
MIPS Jr. Architecture Example: subset of MIPS processor architecture Drawn from Patterson & Hennessy MIPS is a 32-bit architecture with 32 registers Consider 8-bit subset using 8-bit datapath Only implement 8 registers ($0 - $7) $0 hardwired to 00000000 8-bit program counter We sometimes build this processor in the labs Illustrate the key concepts in VLSI design 9
Instruction Set 10
Instruction Encoding 32-bit instruction encoding Requires four cycles to fetch on 8-bit datapath 11 format example encoding R I J 0 ra rb rd 0 funct op op ra rb imm 6 6 6 6 5 5 5 5 5 5 16 26 add $rd, $ra, $rb beq $ra, $rb, imm j dest dest
Fibonacci (C) f 0 = 1; f -1 = -1 f n = f n-1 + f n-2 f = 1, 1, 2, 3, 5, 8, 13, … 12
Fibonacci (Assembly) 1 st statement: n = 8 How do we translate this to assembly?

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture