Clock T FF1 T CL1 T FF2 T T T FF T T FF T CL T FF T CL T FF T T FF T T FF T CL. T cyc T H. Clock T FF T T FF T CL T FF T T FF T CL.
|
|
- Ambrose Chase
- 6 years ago
- Views:
Transcription
1 etup TA 60 c, vcc 3v Hold TA 30 c, vcc 5v Tkew TL TL TH FF FF 2 T cyc T H T L Clock TpdFF 2 TpdCL2Tetup FF Tcyc TL 2 2 TpdFF TpdCL Tetup FF2 TH 2 T FF T T FF T CL Hold L cd cd T FF T T FF T CL Hold L cd cd FF FF 2 FF FF 2 FF FF 2 Tkew TH TH TL FF 2 FF T cyc T H T L Clock T FF T CL T FF2 T T 2 T FF T CL T FF T pd pd etup L T FF T T FF T CL Hold H cd cd pd pd etup cyc H T FF T T FF T CL Hold H cd cd FF FF 2 FF FF 2 FF FF 2 ( '!&$%%###!
2 FF 2 FF T L T H T cyc T H T L Clock T FF2 T CL2 T FF T FF 2 pd pd etup L T FF T CL T FF T pd pd etup H FF 2 T Hold THold Tpd FF 2 FF #! FF FF 2 $ #! &% T FF2 T CL2 T FF T T ( FF) T T ( FF2) T ( CL2) pd pd etup L hold L cd cd T FF2 T CL2 T FF T T ( FF 2) T ( CL2) T ( FF) pd pd etup L cd cd hold T, T T, T pd etup cd Hold ( '!&$%%###!
3 NAND( x,'') x ) t pd t cd t setup t hold NAND In In 2 D Out CLK '' '' NAND T cd T hold ( '!&$%%###!
4 RA CA W A0 A CA W D A0 A KM4C6000C-5 KM4C6000C-5 KM4C6000C-5 KM4C6000C-5 KM4C6000C-5 KM4C6000C-5 KM4C6000C-5 KM4C6000C-5 Decoder 3 8 RA KM4C6000C-5 KM4C6000C-5 KM4C6000C-5 KM4C6000C-5 KM4C6000C-5 KM4C6000C-5 KM4C6000C-5 KM4C6000C A2 A3 A 4 D D D D D D D 0 ' KM4C6000C-5 Fanout DRAM' D 7 DRAM RA RA DRAM Tpd Decoder inout Tpd t * t Tpd RRH RRH t * t Tpd RAH RAH tcrp* tcrptpd t * t Tpd RAL RAL t * t Tpd RAC RAC tcac* tcac Tpd ( '!&$%%###!
5 CA W D A0 A KM4C6000C-5 KM4C6000C-5 KM4C6000C-5 KM4C6000C-5 KM4C6000C-5 KM4C6000C-5 KM4C6000C-5 KM4C6000C-5 Decoder 3 8 A2 A3 A 4 RA ( DRAM RA ) W CA RA t * t Tpd RA RAH RAH tpd 0 ( '!&$%%###!
6 t RCD t CA CA RA trac 50 T t ns min RC 90 Tmin tra trp ns T max t, t max t, t t, t t 50 t min CRP AR RAC max RAD AAmax RCD min CAC max OFF min max 5, 0 max 50,5 25, ns 75>tRA,tCH,tRDC+tRH T trp>30 min 05 ns $ trcd>20 55 tcrp= ns & %&% 5ns 45ns T min 00 T max t, t max t, t t, t t 50 t min CRP AR RAC max RAD AAmax RCD min CAC max OFF min max 5, 0 max 50,5 25, ns Tmin 95ns ns ( '!&$%%###!
7 * CA t max t, t rows max t t, t min min 2 ns ns ns ns CRP AR RA RP RC max 5, 0 2 max 50 30, s 0.37ms W CA t max t, t max t, t rows max t t, t min min 2 RP CR RPC CP RA RP RC max 30,5max 5,0 2 max 5030, ns 2 90ns s 0.37ms 64ms DRAM 0.4msCA BEFORE RA) +*DRAM ++ 5ms 0.4ms 9000nsRA ONLY DRAMTRADEOFF DRAM + 0.4msCA BEFORE RA) CBR RA ONLY++* ( '!&$%%###!
8 + Idle Output_Ready Compute Init0 Clr_Reg Init DR_Num LD_A el_cnt Init2 DR_Y LD_B LD_C el_cnt Z Z' Z CheckZ el_cnt Calc ALU_OP DR_ALU LD_C updnum el_cnt DR_ALU LD_A OutRdy Clr_Reg , Idle Init0 ++ Num Init ++ Y Init2 $ + ANum- updnum! ++ CB+C Calc - + Num-=0 CheckZ. + ALU_OP DR_Y DR_Num DR_ALU LD_C LD_B LD_A $ ! P Compute= Z=0 Z= el_cnt Z' ( '!&$%%###!
9 Output Compute Z Preset tate, ROM Output_Ready Next tate Register Controls &% Output Compute Z Preset tate ROM Cominational Logic Next tate Output_Ready Controls ZCompute$-ROM /Output_Ready$ROM 5 5 ROM $ 2 &% ROM ROM Address Data Com DR_ P OutRdy ClrReg elcnt ALUOP DR_Y pute Z Num DRALU LD_C LD_B LD_A N ( '!&$%%###! Register
10 ROM Addres Data Com P pute Z N ( 0 Dr_Num Output_Ready Clr_Reg Next tate Decoder OR OR el_cnt Dr_Y, Ld_B Dr_ALU ALU_OP 6 7 OR OR Ld_C Ld_A ( '!&$%%###!
11 Preset tate Test ROM True False Outputs Output_Ready Controls Compute Z 0 ele ctor elector Next tate Register &% Preset tate Test ROM True False Controls Output_Ready Compute Z 0 ele ctor elector Next tate Combinational Logic Register False True $0Test Outputs ROM ROMtest, linkt, linkf ( '!&$%%###!
12 Address test + linktrue linkfalse Output ROM Address test linktrue linkfalse a d b e F J c f T ns ( '!&$%%###!
13 ) T 2T s 2T c 42ns L pd pd o TP 42 c FA s o co FA s c FA s o FA FA co co s s Count FF 9 T max,0 T FF T K 4 TPmax FF 539ns cyc pd su CL T 3AdderP KT 49 76ns L cyc TP max 9 ( '!&$%%###!
14 ai bi tart FA ci c s o 2 el Controller T T FF T el T FA T FF tart el, Done ns cyc pd pd pd su T nt 26n n L cyc TP ntcyc Done n ( '!&$%%###!
15 ! $ D-2, G-, H-, K-, N-,- n n 48, 48 ' 75, ! Latency - ' 2 2 # pipe $ $ $ $ 2 2 TP T cyc!! -... T L n7 K 3 T 4 cyc KT cyc D-2, G-, H-, K-, N-,- D-,G-,H-,I-,J-,K-,N-,- D-,G-,H-,M-,N-,O-,- D-,G-,H-,O-,P-,- I-,J-,K-,N-,- M-,N-,O-,- TP T cyc n!t cyc 4 6 ( '!&$%%###!
16 while (a OR b) do nothing; c=0; while (a NAND b) do nothing; c=; a b C c d F a F b C F c F d a b J F c d x A x f A, B,, t x P g f x P f x f x f p B p p 2 g A g B p 2 ( '!&$%%###!
17 * A x A, B f f p B p p F J B p 2 A g g ForkJoin W A x A, B f f p B p p F J W B p 2 A g g (! ( ( '!&$%%###!
18 + rs label - beqz rs,label - beq $rs,$zero,label branch blt * & %branch branch )label label= add $t7, $t7, $t beq $t7, $t7, addi $t7,$t7, $t7 addi branch $t7( [0x ] add $t0,$zero,$zero $t0 = 0 [0x ] addi $s0,$zero,0x4004 $s0 = 0x4004 [0x ] addi $t0,$t0,4 $t0 += 4 [0x C] add $s0,$s0,$t0 $s0 += $t0 [0x ] jr $s0 Goto $s0 +$t0 $s0*$s0=0x4004 $t0=4!$t0 $ $t0! $s0*$s0=0x4008$t0$s0! $s00x400 - $t0=8!$t0. jr $s0*+$s0=0x40$t0$s0, $s0jr ' '$t0jr ( '!&$%%###!
19 , s2=s2+0 add $s2, $s2, $zero NOP s2=s2+0 addi $s2, $s2, 0 NOP ( ) NOP j 0x ) ( beq NOP beq $s2, $s2 0x ' *( % n n 5 n # -& 2 & 4.5 n 8 n%ingle Cycle MIP.data 0x # Data egment start (assembler directive) A:.word 0 # array element A[0] of Fibonacci series array.word 0 # A[].word 0.word 0.word 0.word 0.word 0.word 0.word 0.word 0 # A[9] n:.word 9 # n.text.globl main main: la $s0, A # Code egment start (assembler directive) # load value of A into register $s0 --> $s0 = &A[0] la $a0, n # load address of n into $a0 # lw $a0, 0($a0) # load value of n into $a0 # --> $a0 = n loop: addi $t0, $zero, 0 # first element $t0 = a_ = 0 addi $t, $zero, # second element $t = a_2 = sw $t0, 0($s0) addi $a0, $a0 - beq $a0, $zero, done sw $t, 4($s0) # stores element a_n # decrease index: n=n- # stores element a_n+ done: add $t0, $t0, $t add $t, $t0, $t addi $s0, $s0, 8 addi $a0, $a0, - bne $a0, $zero, loop # calculates $t0 = a_n+2 # calculates $t = a_n+3 # moves to the next 2 elements in the array # decrease index: n=n- addi $v0, $0, 0 # exit the program by calling syscall with parameter 0 syscall ( '!&$%%###!
20 .data 0x # Data egment start n:.word # n $ 0 2 n v.text # Code egment start.globl main main: la $a0, n lw $a0, 0($a0) # load $a0=n addi $s0, $zero, # $s0 = addi $s, $zero, 0 # $s = 0 loop: slt $s2, $a0, $s # if $a0 < $s then $s2 = else $s2 = 0 bne $s2, $zero, finish # if $s2 == goto finish # actually: if $a0 < $s goto finish add $s0, $s0, $s0 # $s0 = 2 * $s0 addi $s, $s, # $s ++ j loop # goto loop finish: add $v0, $s0, $zero # $v0 = $s0 ( '!&$%%###!
21 ! jrr-type orii-type jj-type $s2 $s=, $s2=5, $s3=3 ALUmux +--Zero Extend ALUrc=2$ rsoralu OR PC+4 R-type lw/sw PC) (beq ) PC+4 beq j ( '!&$%%###!
22 Preserved on call ( Prologue Epilogue Preserved on call $a0-$a3 A $a0a $ B B jal B $a0c C jal C,$a0BC $$a0 BEpilogue Preseved on $v0,$v call B B$v0A post-callbpre-callframe Preserved on call &%)++3 2 Preserved on call&% ( ( '!&$%%###!
23 main: addi $sp, $sp, -32 # Main - prologue sw $ra, 20($sp) # Main - prologue sw $fp, 6($sp) # Main - prologue addi $fp, $sp, 28 # Main - prologue li $a0, 2 li $a, 8 jal gcd lw $fp, 6($sp) # Main - epilogue lw $ra, 20($sp) # Main - epilogue addi $sp, $sp, 32 # Main - epilogue jr $ra # Main - epilogue gcd: addi $sp, $sp, -32 # GCD - prologue sw $ra, 20($sp) # GCD - prologue sw $fp, 6($sp) # GCD - prologue sw $a0, 2($sp) # GCD - prologue sw $a, 8($sp) # GCD - prologue sw $s0, 4($sp) # GCD - prologue addi $fp, $sp, 28 # GCD - prologue slt $t0, $a0, $a bne $t0, $0, smaller slt $s0, $a, $a0 bne $s0, $0, greater addi $v0, $a0, 0 j return smaller: sub $a, $a, $a0 j callagain greater: sub $a0, $a0, $a callagain: jal gcd return: lw $s0, 4($sp) # GCD - prologue lw $a, 8($sp) # GCD - epilogue lw $a0, 2($sp) # GCD - epilogue lw $fp, 6($sp) # GCD - epilogue lw $ra, 20($sp) # GCD - epilogue addi $sp, $sp, 32 # GCD - epilogue jr $ra # GCD - epilogue ) gcdinstances $fp Frame ) $v0 gcd jal gcd returnreturn ))() $v0 $sp $ra $fp $a0 $a $s0 ( '!&$%%###!
24 # MemRead (lw (!opcode Dispatch ROM cyclememread ALUOut rt [20-6]( Label dr-a dr-b ld-a ld-b dr-alu ALUop Done equencing Idle Dispatch LoadA eq LoadB eq CalcA-B 0 Dispatch2 A<-A-B 0 CalcA-B B<-B-A CalcA-B $ AddrCtrl tate Mux CalcA-B Dispatch ROM 2 Dispatch ROM CC tart 0, 0 equencing ROM bitROM ( '!&$%%###!
25 rt &!%rs&rs %rs! DataMem[-4($rs)]$rt $rs$rs 4 MemRead ALUrcA=0 IorD=0 IRWrite ALUrcB=0 ALUOp=00 PCWrite PCource=00 ALUrcA=0 ALUrcB= ALUOp=00 beqsub ALUrcA= ALUrcB=00 ALUOp=0 PCWriteCond PCource=0 RegDest=0 RegWrite MemtoReg=0 ( '!&$%%###!
CSE Computer Architecture I
Execution Sequence Summary CSE 30321 Computer Architecture I Lecture 17 - Multi Cycle Control Michael Niemier Department of Computer Science and Engineering Step name Instruction fetch Instruction decode/register
More informationComputer Engineering Department. CC 311- Computer Architecture. Chapter 4. The Processor: Datapath and Control. Single Cycle
Computer Engineering Department CC 311- Computer Architecture Chapter 4 The Processor: Datapath and Control Single Cycle Introduction The 5 classic components of a computer Processor Input Control Memory
More informationCPU DESIGN The Single-Cycle Implementation
CSE 202 Computer Organization CPU DESIGN The Single-Cycle Implementation Shakil M. Khan (adapted from Prof. H. Roumani) Dept of CS & Eng, York University Sequential vs. Combinational Circuits Digital circuits
More informationSpiral 1 / Unit 3
-3. Spiral / Unit 3 Minterm and Maxterms Canonical Sums and Products 2- and 3-Variable Boolean Algebra Theorems DeMorgan's Theorem Function Synthesis use Canonical Sums/Products -3.2 Outcomes I know the
More informationCSc 256 Midterm 2 Fall 2010
CSc 256 Midterm 2 Fall 2010 NAME: 1a)YouaregivenaMIPSbranchinstruction: x:beq$12,$0,y Theaddressofthelabel"y"is0x40013c.Thememorylocationat"x"contains: addresscontents 0x4002080001000110000000????????????????...whichrepresentsthebeqinstruction;the????...????arethe
More informationEC 413 Computer Organization
EC 413 Computer Organization rithmetic Logic Unit (LU) and Register File Prof. Michel. Kinsy Computing: Computer Organization The DN of Modern Computing Computer CPU Memory System LU Register File Disks
More informationLH NMOS 256K (256K 1) Dynamic RAM DESCRIPTION
LH2256 NMOS 256K (256K ) Dynamic RAM FEATURES 262,44 bit organization Access times: 00/20/50 ns (MAX.) Cycle times: 200/230/260 ns (MIN.) Page mode operation Power supply: +5 V ± 0% Power consumption:
More informationDQ0 DQ1 DQ2 DQ3 NC WE# RAS# A0 A1 A2 A3 A4 A5. x = speed
DRAM MT4LCME1, MT4LCMB6 For the latest data sheet, please refer to the Micron Web site: www.micron.com/products/datasheets/dramds.html FEATURES Single +3.3 ±0.3 power supply Industry-standard x pinout,
More informationImplementing the Controller. Harvard-Style Datapath for DLX
6.823, L6--1 Implementing the Controller Laboratory for Computer Science M.I.T. http://www.csg.lcs.mit.edu/6.823 6.823, L6--2 Harvard-Style Datapath for DLX Src1 ( j / ~j ) Src2 ( R / RInd) RegWrite MemWrite
More informationDatasheetDirect.com. Visit to get your free datasheets. This datasheet has been downloaded by
DatasheetDirect.com Your dedicated source for free downloadable datasheets. Over one million datasheets Optimized search function Rapid quote option Free unlimited downloads Visit www.datasheetdirect.com
More informationDesign of Digital Circuits Lecture 14: Microprogramming. Prof. Onur Mutlu ETH Zurich Spring April 2017
Design of Digital Circuits Lecture 4: Microprogramming Prof. Onur Mutlu ETH Zurich Spring 27 7 April 27 Agenda for Today & Next Few Lectures! Single-cycle Microarchitectures! Multi-cycle and Microprogrammed
More informationOutcomes. Spiral 1 / Unit 2. Boolean Algebra BOOLEAN ALGEBRA INTRO. Basic Boolean Algebra Logic Functions Decoders Multiplexers
-2. -2.2 piral / Unit 2 Basic Boolean Algebra Logic Functions Decoders Multipleers Mark Redekopp Outcomes I know the difference between combinational and sequential logic and can name eamples of each.
More informationVcc DQ1 DQ2 DQ3 DQ4 Vcc DQ5 DQ6 DQ7 DQ8 WE# RAS# A0 A1 A2 A3 Vcc
TECHNOLOGY I. MEG x 6 DRAM MT4CM6C3 MT4LCM6C3 FEATURES JEDEC- and industry-standard x6 timing functions pinouts and packages High-performance low power CMOS silicon-gate process Single power supply (+3.3
More informationHM534251B Series word 4-bit Multiport CMOS Video RAM
262144-word 4-bit Multiport CMOS Video RAM Description The HM534251B is a 1-Mbit multiport video RAM equipped with a 256-kword 4-bit dynamic RAM and a 512-word 4-bit SAM (serial access memory). Its RAM
More informationProject Two RISC Processor Implementation ECE 485
Project Two RISC Processor Implementation ECE 485 Chenqi Bao Peter Chinetti November 6, 2013 Instructor: Professor Borkar 1 Statement of Problem This project requires the design and test of a RISC processor
More informationDesigning MIPS Processor
CSE 675.: Introdction to Compter Architectre Designing IPS Processor (lti-cycle) Presentation H Reading Assignment: 5.5,5.6 lti-cycle Design Principles Break p eection of each instrction into steps. The
More informationDQ0 DQ1 NC NC NC NC WE# RAS# A0 A1 A2 A3 A4 A5
DRAM MT4LC16M4G3, MT4LC16M4H9 For the latest data sheet, please refer to the Micron Web site: www.micronsemi.com/mti/msp/html/datasheet.html FEATURES Single +3.3 ±0.3 power supply Industry-standard x4
More informationReview. Combined Datapath
Review Topics:. A single cycle implementation 2. State Diagrams. A mltiple cycle implementation COSC 22: Compter Organization Instrctor: Dr. Amir Asif Department of Compter Science York University Handot
More informationDRAM MT4LC4M16R6, MT4LC4M16N3. 4 MEG x 16 EDO DRAM
DRAM 4 MEG x 6 MT4LC4M6R6, MT4LC4M6N3 For the latest data sheet, please refer to the Micron Web site: www.micron.com/products/datasheets/dramds.html FEATURES Single +3.3 ±.3 power supply Industry-standard
More information2M x 32 Bit 5V FPM SIMM. Fast Page Mode (FPM) DRAM SIMM S51T04JD Pin 2Mx32 FPM SIMM Unbuffered, 1k Refresh, 5V. General Description.
Fast Page Mode (FPM) DRAM SIMM 322006-S51T04JD Pin 2Mx32 Unbuffered, 1k Refresh, 5V General Description The module is a 2Mx32 bit, 4 chip, 5V, 72 Pin SIMM module consisting of (4) 1Mx16 (SOJ) DRAM. The
More informationTopics: A multiple cycle implementation. Distributed Notes
COSC 22: Compter Organization Instrctor: Dr. Amir Asif Department of Compter Science York University Handot # lticycle Implementation of a IPS Processor Topics: A mltiple cycle implementation Distribted
More informationPipelining. Traditional Execution. CS 365 Lecture 12 Prof. Yih Huang. add ld beq CS CS 365 2
Pipelining CS 365 Lecture 12 Prof. Yih Huang CS 365 1 Traditional Execution 1 2 3 4 1 2 3 4 5 1 2 3 add ld beq CS 365 2 1 Pipelined Execution 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5
More informationTEST 1 REVIEW. Lectures 1-5
TEST 1 REVIEW Lectures 1-5 REVIEW Test 1 will cover lectures 1-5. There are 10 questions in total with the last being a bonus question. The questions take the form of short answers (where you are expected
More informationIBM IBM M IBM B IBM P 4M x 4 12/10 DRAM
IBM01164004M x 412/10, 5.0VMMDD31DSU-011010328. IBM0116400P 4M x 412/10, 3.3V, LP, SRMMDD31DSU-011010328. IBM0116400M 4M x 412/10, 5.0V, LP, SRMMDD31DSU-011010328. IBM0116400B4M x 412/10, 3.3VMMDD31DSU-011010328.
More informationCSCI-564 Advanced Computer Architecture
CSCI-564 Advanced Computer Architecture Lecture 8: Handling Exceptions and Interrupts / Superscalar Bo Wu Colorado School of Mines Branch Delay Slots (expose control hazard to software) Change the ISA
More informationHB56A1636B/SB-6B/7B/8B
16,777,216-word 36-bit High-Density Dynamic RAM Module ADE-203-591A(Z) Rev. 1.0 05/10/96 Description The HB56A1636 is a 16-Mbit 36 dynamic RAM module, consisting of 36 16-Mbit DRAMs (HM5116100BS) sealed
More informationCA Compiler Construction
CA4003 - Compiler Construction Code Generation to MIPS David Sinclair Code Generation The generation o machine code depends heavily on: the intermediate representation;and the target processor. We are
More informationL07-L09 recap: Fundamental lesson(s)!
L7-L9 recap: Fundamental lesson(s)! Over the next 3 lectures (using the IPS ISA as context) I ll explain:! How functions are treated and processed in assembly! How system calls are enabled in assembly!
More informationReview: Single-Cycle Processor. Limits on cycle time
Review: Single-Cycle Processor Jump 3:26 5: MemtoReg Control Unit LUControl 2: Op Funct LUSrc RegDst PCJump PC 4 uction + PCPlus4 25:2 2:6 2:6 5: 5: 2 3 WriteReg 4: Src Src LU Zero LUResult Write + PC
More informationVCC DQ0 DQ1 DQ2 DQ3 DQ4 DQ5 DQ6 DQ7 NC NC NC WE# RAS# NC NC A0 A1 A2 A3
OBSOLETE MT4CM6E5 Meg x 6, 5 MT4LCM6E5 Meg x 6, 3.3 For the latest data sheet, please refer to the Micron Web site: www.micron.com/products/datasheets/sdramds.html FEATURES JEDEC- and industry-standard
More informationA Second Datapath Example YH16
A Second Datapath Example YH16 Lecture 09 Prof. Yih Huang S365 1 A 16-Bit Architecture: YH16 A word is 16 bit wide 32 general purpose registers, 16 bits each Like MIPS, 0 is hardwired zero. 16 bit P 16
More informationOn my honor, as an Aggie, I have neither given nor received unauthorized aid on this academic work
Lab 5 : Linking Name: Sign the following statement: On my honor, as an Aggie, I have neither given nor received unauthorized aid on this academic work 1 Objective The main objective of this lab is to experiment
More informationDesigning Single-Cycle MIPS Processor
CSE 32: Introdction to Compter Architectre Designing Single-Cycle IPS Processor Presentation G Stdy:.-. Gojko Babić 2/9/28 Introdction We're now ready to look at an implementation of the system that incldes
More informationIBM B IBM P 8M x 8 12/11 EDO DRAM
8M x 812/11, 3.3V, EDO. 8M x 812/11, 3.3V, LP, SR, EDO. Features 8,388,608 word by 8 bit organization Single 3.3 ±0.3V power supply Extended Data Out before Refresh - 4096 cycles/retention Time only Refresh
More informationHM514400B/BL Series HM514400C/CL Series
ADE-203-269A (Z) HM514400B/BL Series HM514400C/CL Series 1,048,576-word 4-bit Dynamic Random Access Memory Rev. 1.0 Nov. 29, 1994 The Hitachi HM514400B/BL, HM514400C/CL are CMOS dynamic RAM organized 1,048,576-
More information3. (2) What is the difference between fixed and hybrid instructions?
1. (2 pts) What is a "balanced" pipeline? 2. (2 pts) What are the two main ways to define performance? 3. (2) What is the difference between fixed and hybrid instructions? 4. (2 pts) Clock rates have grown
More informationIBM IBM M IBM B IBM P 4M x 4 11/11 EDO DRAM
IBM01174054M x 411/11, 5.0V, EDOMMDD64DSU-001012331. IBM0117405P4M x 411/11, 3.3V, EDO, LP, SRMMDD64DSU-001012331. IBM0117405M4M x 411/11, 5.0V, EDO, LP, SRMMDD64DSU-001012331. IBM0117405B4M x 411/11,
More informationLecture 3, Performance
Lecture 3, Performance Repeating some definitions: CPI Clocks Per Instruction MHz megahertz, millions of cycles per second MIPS Millions of Instructions Per Second = MHz / CPI MOPS Millions of Operations
More informationLecture 3, Performance
Repeating some definitions: Lecture 3, Performance CPI MHz MIPS MOPS Clocks Per Instruction megahertz, millions of cycles per second Millions of Instructions Per Second = MHz / CPI Millions of Operations
More informationMB81C4256A-60/-70/-80/-10 CMOS 256K x 4 BIT FAST PAGE MODE DYNAMIC RAM
June 1991 Edition 4.0 DATA SHEET /-70/-80/-10 CMOS 256K x 4 BIT FAST PAGE MODE DYNAMIC RAM The Fujitsu MB81C4256A is a CMOS, fully decoded dynamic RAM organized as 262,144 words x 4 bits. The MB81C4256A
More informationComputer Architecture ELEC2401 & ELEC3441
Last Time Pipeline Hazard Computer Architecture ELEC2401 & ELEC3441 Lecture 8 Pipelining (3) Dr. Hayden Kwok-Hay So Department of Electrical and Electronic Engineering Structural Hazard Hazard Control
More information4. (3) What do we mean when we say something is an N-operand machine?
1. (2) What are the two main ways to define performance? 2. (2) When dealing with control hazards, a prediction is not enough - what else is necessary in order to eliminate stalls? 3. (3) What is an "unbalanced"
More information[2] Predicting the direction of a branch is not enough. What else is necessary?
[2] When we talk about the number of operands in an instruction (a 1-operand or a 2-operand instruction, for example), what do we mean? [2] What are the two main ways to define performance? [2] Predicting
More information1. (2 )Clock rates have grown by a factor of 1000 while power consumed has only grown by a factor of 30. How was this accomplished?
1. (2 )Clock rates have grown by a factor of 1000 while power consumed has only grown by a factor of 30. How was this accomplished? 2. (2 )What are the two main ways to define performance? 3. (2 )What
More information[2] Predicting the direction of a branch is not enough. What else is necessary?
[2] What are the two main ways to define performance? [2] Predicting the direction of a branch is not enough. What else is necessary? [2] The power consumed by a chip has increased over time, but the clock
More informationLecture: Pipelining Basics
Lecture: Pipelining Basics Topics: Performance equations wrap-up, Basic pipelining implementation Video 1: What is pipelining? Video 2: Clocks and latches Video 3: An example 5-stage pipeline Video 4:
More informationDesign. Dr. A. Sahu. Indian Institute of Technology Guwahati
CS222: Processor Design: Multi Cycle Design Dr. A. Sahu Dept of Comp. Sc. & Engg. Indian Institute of Technology Guwahati Mid Semester Exam Multi Cycle design Outline Clock periods in single cycle and
More informationECEN 651: Microprogrammed Control of Digital Systems Department of Electrical and Computer Engineering Texas A&M University
ECEN 651: Microprogrammed Control of Digital Systems Department of Electrical and Computer Engineering Texas A&M University Prof. Mi Lu TA: Ehsan Rohani Laboratory Exercise #4 MIPS Assembly and Simulation
More informationEnrico Nardelli Logic Circuits and Computer Architecture
Enrico Nardelli Logic Circuits and Computer Architecture Appendix B The design of VS0: a very simple CPU Rev. 1.4 (2009-10) by Enrico Nardelli B - 1 Instruction set Just 4 instructions LOAD M - Copy into
More informationALU A functional unit
ALU A functional unit that performs arithmetic operations such as ADD, SUB, MPY logical operations such as AND, OR, XOR, NOT on given data types: 8-,16-,32-, or 64-bit values A n-1 A n-2... A 1 A 0 B n-1
More informationEXAMPLES 4/12/2018. The MIPS Pipeline. Hazard Summary. Show the pipeline diagram. Show the pipeline diagram. Pipeline Datapath and Control
The MIPS Pipeline CSCI206 - Computer Organization & Programming Pipeline Datapath and Control zybook: 11.6 Developed and maintained by the Bucknell University Computer Science Department - 2017 Hazard
More informationCOVER SHEET: Problem#: Points
EEL 4712 Midterm 3 Spring 2017 VERSION 1 Name: UFID: Sign here to give permission for your test to be returned in class, where others might see your score: IMPORTANT: Please be neat and write (or draw)
More informationSpiral 2-1. Datapath Components: Counters Adders Design Example: Crosswalk Controller
2-. piral 2- Datapath Components: Counters s Design Example: Crosswalk Controller 2-.2 piral Content Mapping piral Theory Combinational Design equential Design ystem Level Design Implementation and Tools
More informationCMSC 313 Lecture 25 Registers Memory Organization DRAM
CMSC 33 Lecture 25 Registers Memory Organization DRAM UMBC, CMSC33, Richard Chang A-75 Four-Bit Register Appendix A: Digital Logic Makes use of tri-state buffers so that multiple registers
More informationSequential Logic Worksheet
Sequential Logic Worksheet Concept Inventory: Notes: D-latch & the Dynamic Discipline D-register Timing constraints for sequential circuits Set-up and hold times for sequential circuits 6.004 Worksheet
More information61C In the News. Processor Design: 5 steps
www.eetimes.com/electronics-news/23235/thailand-floods-take-toll-on--makers The Thai floods have already claimed the lives of hundreds of pele, with tens of thousands more having had to flee their homes
More informationControl. Control. the ALU. ALU control signals 11/4/14. Next: control. We built the instrument. Now we read music and play it...
// CS 2, Fall 2! CS 2, Fall 2! We built the instrument. Now we read music and play it... A simple implementa/on uc/on uct r r 2 Write r Src Src Extend 6 Mem Next: path 7-2 CS 2, Fall 2! signals CS 2, Fall
More informationECE290 Fall 2012 Lecture 22. Dr. Zbigniew Kalbarczyk
ECE290 Fall 2012 Lecture 22 Dr. Zbigniew Kalbarczyk Today LC-3 Micro-sequencer (the control store) LC-3 Micro-programmed control memory LC-3 Micro-instruction format LC -3 Micro-sequencer (the circuitry)
More informationSequential vs. Combinational
Sequential Circuits Sequential vs. Combinational Combinational Logic: Output depends only on current input TV channel selector (-9) inputs system outputs Sequential Logic: Output depends not only on current
More informationCSE 140 Midterm 2 Tajana Simunic Rosing. Spring 2008
CSE 14 Midterm 2 Tajana Simunic Rosing Spring 28 Do not start the exam until you are told to. Turn off any cell phones or pagers. Write your name and PID at the top of every page. Do not separate the pages.
More informationMicroprocessor Power Analysis by Labeled Simulation
Microprocessor Power Analysis by Labeled Simulation Cheng-Ta Hsieh, Kevin Chen and Massoud Pedram University of Southern California Dept. of EE-Systems Los Angeles CA 989 Outline! Introduction! Problem
More informationCPSC 3300 Spring 2017 Exam 2
CPSC 3300 Spring 2017 Exam 2 Name: 1. Matching. Write the correct term from the list into each blank. (2 pts. each) structural hazard EPIC forwarding precise exception hardwired load-use data hazard VLIW
More informationLOGIC CIRCUITS. Basic Experiment and Design of Electronics
Basic Experiment and Design of Electronics LOGIC CIRCUITS Ho Kyung Kim, Ph.D. hokyung@pusan.ac.kr School of Mechanical Engineering Pusan National University Outline Combinational logic circuits Output
More informationLOGIC CIRCUITS. Basic Experiment and Design of Electronics. Ho Kyung Kim, Ph.D.
Basic Experiment and Design of Electronics LOGIC CIRCUITS Ho Kyung Kim, Ph.D. hokyung@pusan.ac.kr School of Mechanical Engineering Pusan National University Digital IC packages TTL (transistor-transistor
More informationComputer Architecture
Computer Architecture QtSpim, a Mips simulator S. Coudert and R. Pacalet January 4, 2018..................... Memory Mapping 0xFFFF000C 0xFFFF0008 0xFFFF0004 0xffff0000 0x90000000 0x80000000 0x7ffff4d4
More informationLecture 9: Control Hazard and Resolution. James C. Hoe Department of ECE Carnegie Mellon University
18 447 Lectre 9: Control Hazard and Resoltion James C. Hoe Department of ECE Carnegie ellon University 18 447 S18 L09 S1, James C. Hoe, CU/ECE/CALC, 2018 Yor goal today Hosekeeping simple control flow
More informationEE141- Spring 2007 Digital Integrated Circuits
EE141- Spring 27 igital Integrated Circuits Lecture 19 Sequential Circuits 1 Administrative Stuff Project Ph. 2 due Tu. 5pm 24 Cory box + email ee141- project@bwrc.eecs.berkeley.edu Hw 8 Posts this Fr.,
More informationMultiplexers Decoders ROMs (LUTs) Page 1
Multiplexers Decoders ROMs (LUTs) Page A Problem Statement Design a circuit which will select between two inputs (A and B) and pass the selected one to the output (Q). The desired circuit is called a multiplexer
More informationBuilding a Computer. Quiz #2 on 10/31, open book and notes. (This is the last lecture covered) I wonder where this goes? L16- Building a Computer 1
Building a Computer I wonder where this goes? B LU MIPS Kit Quiz # on /3, open book and notes (This is the last lecture covered) Comp 4 Fall 7 /4/7 L6- Building a Computer THIS IS IT! Motivating Force
More informationPlease read carefully. Good luck & Go Gators!!!
Page 1/12 Exam 1 May the Schwartz be with you! Instructions: Turn off all cell phones and other noise making devices and put away all electronics Show all work on the front of the test papers Box each
More informationLogic and Computer Design Fundamentals. Chapter 8 Sequencing and Control
Logic and Computer Design Fundamentals Chapter 8 Sequencing and Control Datapath and Control Datapath - performs data transfer and processing operations Control Unit - Determines enabling and sequencing
More informationUNIVERSITY OF WISCONSIN MADISON
CS/ECE 252: INTRODUCTION TO COMPUTER ENGINEERING UNIVERSITY OF WISCONSIN MADISON Prof. Gurindar Sohi TAs: Minsub Shin, Lisa Ossian, Sujith Surendran Midterm Examination 2 In Class (50 minutes) Friday,
More informationUniversity of Toronto. Final Exam
University of Toronto Final Exam Date - Apr 18, 011 Duration:.5 hrs ECE334 Digital Electronics Lecturer - D. Johns ANSWER QUESTIONS ON THESE SHEETS USING BACKS IF NECESSARY 1. Equation sheet is on last
More informationInstruction register. Data. Registers. Register # Memory data register
Where we are headed Single Cycle Problems: what if we had a more complicated instrction like floating point? wastefl of area One Soltion: se a smaller cycle time have different instrctions take different
More informationLogic Design. CS 270: Mathematical Foundations of Computer Science Jeremy Johnson
Logic Deign CS 270: Mathematical Foundation of Computer Science Jeremy Johnon Logic Deign Objective: To provide an important application of propoitional logic to the deign and implification of logic circuit.
More informationP a g e 5 1 of R e p o r t P B 4 / 0 9
P a g e 5 1 of R e p o r t P B 4 / 0 9 J A R T a l s o c o n c l u d e d t h a t a l t h o u g h t h e i n t e n t o f N e l s o n s r e h a b i l i t a t i o n p l a n i s t o e n h a n c e c o n n e
More informationEM48AM3284LBB. Revision History. Revision 0.1 (May. 2010) - First release.
Revision History Revision 0.1 (May. 2010) - First release. Revision 0.2 (Sep. 2010) - Delete CL=2 parameters - Input Leakage Current = -2μA ~ +2μA - Change Supply Voltage Rating = -0.5 ~ +2.3 - Delete
More informationeorex EM48AM3284LBA Revision History Revision 0.1 (Jul. 2006) - First release. Revision 0.2 (Aug. 2007).. - Add IDD6 PASR Spec.
Revision History Revision 0.1 (Jul. 2006) - First release. Revision 0.2 (Aug. 2007).. - Add IDD6 PASR Spec.(page 7) Revision 0.3 (Dec. 2007).. - TRCD: improved from 30ns to 22.5ns - TRC: improved from
More informationSolutions - Final Exam (Online Section) (Due Date: December 11th by 10:00 am) Clarity is very important! Show your procedure!
DPARTMNT OF LCTRICAL AND COMPUTR NGINRING, TH UNIVRSITY OF NW MXICO C-238L: Computer Logic Deign Fall 23 Solution - Final am (Online Section) (Due Date: December th by : am) Clarity i very important! Show
More informationAUSTIN SEMICONDUCTOR, INC. 4 MEG x 1 DRAM RAS *A10. Vcc 2-23
RAM 4 MEG x 1 RAM FAST PAGE MOE AAABLE AS MITARY SPECIFICATONS SM 5962-90622 M-ST-883 PIN ASSIGNMENT (Top iew) 18-Pin IP 20-Pin ZIP FEATURES Industry standard x1 pinout timing functions and packages High-performance
More informationRAO PAHALD SINGH GROUP OF INSTITUTIONS BALANA(MOHINDER GARH)123029
1 DIGITAL SYSTEM DESIGN LAB (EE-330-F) DIGITAL SYSTEM DESIGN LAB (EE-330-F) LAB MANUAL VI SEMESTER RAO PAHALD SINGH GROUP OF INSTITUTIONS BALANA(MOHINDER GARH)123029 Department Of Electronics & Communication
More informationComputer Science. Questions for discussion Part II. Computer Science COMPUTER SCIENCE. Section 4.2.
COMPUTER SCIENCE S E D G E W I C K / W A Y N E PA R T I I : A L G O R I T H M S, T H E O R Y, A N D M A C H I N E S Computer Science Computer Science An Interdisciplinary Approach Section 4.2 ROBERT SEDGEWICK
More information2
Computer System AA rc hh ii tec ture( 55 ) 2 INTRODUCTION ( d i f f e r e n t r e g i s t e r s, b u s e s, m i c r o o p e r a t i o n s, m a c h i n e i n s t r u c t i o n s, e t c P i p e l i n e E
More informationBasic Computer Organization and Design Part 3/3
Basic Computer Organization and Design Part 3/3 Adapted by Dr. Adel Ammar Computer Organization Interrupt Initiated Input/Output Open communication only when some data has to be passed --> interrupt. The
More informationReview for Final Exam
CSE140: Components and Design Techniques for Digital Systems Review for Final Exam Mohsen Imani CAPE Please submit your evaluations!!!! RTL design Use the RTL design process to design a system that has
More informationEECS 312: Digital Integrated Circuits Final Exam Solutions 23 April 2009
Signature: EECS 312: Digital Integrated Circuits Final Exam Solutions 23 April 2009 Robert Dick Show your work. Derivations are required for credit; end results are insufficient. Closed book. You may use
More informationCSE 140 Midterm 3 version A Tajana Simunic Rosing Spring 2015
CSE 140 Midterm 3 version A Tajana Simunic Rosing Spring 2015 Name of the person on your left : Name of the person on your right: 1. 20 points 2. 20 points 3. 20 points 4. 15 points 5. 15 points 6. 10
More informationName: ID# a) Complete the state transition table for the aforementioned circuit
UNIVERSITY OF CALIFORNIA Department of Electrical Engineering and Computer Sciences EECS150 Fall 2001 Prof. Subramanian Final Examination 1) You are to design a sequential circuit with two JK FFs A and
More informationADVANCED. 16M (2-Bank x 524,288-Word x 16-Bit) Synchronous DRAM FEATURES OPTIONS GENERAL DESCRIPTION. APR (Rev.2.9)
ADVANCED 16M (2-Bank x 524,288-Word x 16-Bit) Synchronous DRAM FEATURES OPTIONS GENERAL DESCRIPTION APR. 2007 (Rev.2.9) F D Read (READ) [RAS = H, CAS = L, WE = H] Write (WRITE) [RAS = H, CAS =WE = L] Chip
More informationCS/COE0447: Computer Organization and Assembly Language
CS/COE0447: Computer Organization and Assembly Language Logic Design Introduction (Brief?) Appendix B: The Basics of Logic Design Dept. of Computer Science Logic design? Digital hardware is implemented
More informationLecture 13: Sequential Circuits, FSM
Lecture 13: Sequential Circuits, FSM Today s topics: Sequential circuits Finite state machines Reminder: midterm on Tue 2/28 will cover Chapters 1-3, App A, B if you understand all slides, assignments,
More informationBALL CONFIGURATION (TOP VIEW) (BGA 90, 8mmX13mmX1.0mm Body, 0.8mm Ball Pitch) A DQ26 DQ24 VSS VDD DQ23 DQ21 B DQ28 VDDQ VSSQ VDDQ VSSQ DQ19
Mobile SDRAM 4M x 32 Bit x 4 Banks Mobile Synchronous DRAM FEATURES 1.8V power supply LVCMOS compatible with multiplexed address Four banks operation MRS cycle with address key programs - CAS Latency (2,
More information256M (16Mx16bit) Hynix SDRAM Memory
256Mb Synchronous DRAM based on 4M x 4Bank x16 I/O 256M (16Mx16bit) Hynix SDRAM Memory Memory Cell Array - Organized as 4banks of 4,194,304 x 16 This document is a general product description and is subject
More informationComputer Architecture. ECE 361 Lecture 5: The Design Process & ALU Design. 361 design.1
Computer Architecture ECE 361 Lecture 5: The Design Process & Design 361 design.1 Quick Review of Last Lecture 361 design.2 MIPS ISA Design Objectives and Implications Support general OS and C- style language
More informationDigital Logic: Boolean Algebra and Gates. Textbook Chapter 3
Digital Logic: Boolean Algebra and Gates Textbook Chapter 3 Basic Logic Gates XOR CMPE12 Summer 2009 02-2 Truth Table The most basic representation of a logic function Lists the output for all possible
More informationLecture 34: Portable Systems Technology Background Professor Randy H. Katz Computer Science 252 Fall 1995
Lecture 34: Portable Systems Technology Background Professor Randy H. Katz Computer Science 252 Fall 1995 RHK.F95 1 Technology Trends: Microprocessor Capacity 100000000 10000000 Pentium Transistors 1000000
More informationKing Fahd University of Petroleum and Minerals College of Computer Science and Engineering Computer Engineering Department
King Fahd University of Petroleum and Minerals College of Computer Science and Engineering Computer Engineering Department Page 1 of 13 COE 202: Digital Logic Design (3-0-3) Term 112 (Spring 2012) Final
More informationEnergy Delay Optimization
EE M216A.:. Fall 21 Lecture 8 Energy Delay Optimization Prof. Dejan Marković ee216a@gmail.com Some Common Questions Is sizing better than V DD for energy reduction? What are the optimal values of gate
More information256M (16Mx16bit) Hynix SDRAM Memory
256Mb Synchronous DRAM based on 4M x 4Bank x16 I/O 256M (16Mx16bit) Hynix SDRAM Memory Memory Cell Array - Organized as 4banks of 4,194,304 x 16 This document is a general product description and is subject
More informationChapter Overview. Memory Classification. Memory Architectures. The Memory Core. Periphery. Reliability. Memory
SRAM Design Chapter Overview Classification Architectures The Core Periphery Reliability Semiconductor Classification RWM NVRWM ROM Random Access Non-Random Access EPROM E 2 PROM Mask-Programmed Programmable
More information