Fall 2010 EE457 Instructor: Gandhi Puvvada Date: 10/1/2010, Friday in SGM123 Name:
|
|
- Ralph Berry
- 6 years ago
- Views:
Transcription
1 Fall 2010 EE457 Intructor: Gandhi Puvvada Quiz (~ 10%) Date: 10/1/2010, Friday in SGM123 Name: Calculator and Cadence Verilog guide are allowed; Cloed-book, Cloed-note, Time: 12:00-2:15PM Total point: Student ID: Do NOT write any tudent ID or SSN Perfect core: / 1 ( point) min. 1.1 A and B are negative number repreented in 2 complement notation. A i 16-bit in ize and B i 8-bit in ize. For A to be equal to B, all the 8 A bit (A[14:7]) hall be (all zero / all one) (and / or) the reet of the 7 A bit (A[6:0]) hall be equal to the correponding 7 B bit (B[6:0]). For A to be le than B (like in -3 i le than -2), it i enough if any of the 8 A bit (A[14:7]) i a (zero / one). On the other hand, if all thoe 8 A bit (A[14:7]) are (all zero / all one), then, for A to be le than B, we need the 7-bit A (A[6:0]) to be (lower / higher) than the correponding 7-bit B (B[6:0]). Here we compare the two 7-bit number treating them a (igned / unigned) 7-bit number. 1.2 Mealy machine deign: Browe through the tate diagram on the next page firt. Here, we perform erial inpection of bit of A (or bit of A and B) to compare them. A i a 16-bit number, but for thi part of the quetion, B can be any where between 8-bit to 16-bit number. Here, we are allowed to inpect at a time (in a clock) one bit of A (A[I]) and (imultaneouly, if needed) one bit of B (B[J]). The I and the J are indice into the A and B repectively. I i initialized to 15. J i initiated to Jini (Jinitial) which can be anywhere between 7 through 15 (correponding to the B ize of 8-bit to 16-bit ). You will be needing to compare I and J to ee when they are equal. Note: Your TA ay that,after STAT i given, you hould not take more than 16 clock. After all, A i 16 bit and B i at mot 16 bit. So decrement I and/or J a oon a poible! Suppoe B i an 8-bit number. State an example of A and B (in binary) uch that the concluion i drawn in the leat number of clock. A = ; B = ; How many clock are pent in INS_AI_BJ tate for the above number? State an example of A and B (in binary) uch that the concluion i drawn in the mot number of clock. A = ; B = ; How many clock are pent in INS_AI_BJ tate for the above number? Since A and B are negative, there i no point looking at A[15] and B[Jini]. True / Fale Since A ize i fixed at 16-bit, if A i equal to B (equal in value, but not necearily in ize), it take the ame number of clock to compare A and B, irrepective of the ize of B. True / Fale EE457 Quiz - Fall / 9
2 1.2.4 State diagram: Complete the 7 miing tate tranition condition for 7 tranitition arrow. Complete TL for the three tate. In tate C_I_J (compare I and J), you would like to decrement (I / J / I or J / I and J / I unconditionally and J conditionally / neither I nor J). Crucial point: You want to arrive in INS_AI_BJ with the right combination of I and J whether you arrive from C_I_J or INS_AI. If B i an 8-bit number (B[7:0]), the firt pair to be compared in INS_AI_BJ i (A[7],B[7] / A[6],B[6] / neither). And if B i a 16-bit number (B[15:0]), the firt pair to be compared in INS_AI_BJ i (A[15],B[15] / A[14],B[14] / neither). ESET I STAT Initial A <= Aini; B <= Bini; I <= 15; J <= Jini; STAT C_I_J Compare I, J INS_AI Inpect A[I] INS_AI_BJ Inpect A[I],B[J] D_AGTB Done, A greater than B D_AEQB Done, A equal to B D_ALTB Done, A le than B EE457 Quiz - Fall / 9
3 1.2.4 State diagram: Complete the 7 miing tate tranition condition for 7 tranitition arrow. Complete TL for the three tate. In tate C_I_J (compare I and J), you would like to decrement (I / J / I or J / I and J / I unconditionally and J conditionally / neither I nor J). Crucial point: You want to arrive in INS_AI_BJ with the right combination of I and J whether you arrive from C_I_J or INS_AI. If B i an 8-bit number (B[7:0]), the firt pair to be compared in INS_AI_BJ i (A[7],B[7] / A[6],B[6] / neither). And if B i a 16-bit number (B[15:0]), the firt pair to be compared in INS_AI_BJ i (A[15],B[15] / A[14],B[14] / neither). ESET I STAT Initial A <= Aini; B <= Bini; I <= 15; J <= Jini; STAT C_I_J Compare I, J INS_AI Inpect A[I] INS_AI_BJ Inpect A[I],B[J] D_AGTB Done, A greater than B D_AEQB Done, A equal to B D_ALTB Done, A le than B EE457 Quiz - Fall / 9
4 2 ( point) min. State diagram coding in Verilog (you may refer to the Cadence (Eperan) Verilog guide): Conider the following partial flowchart and the correponding partial tate diagram along with the Verilog code egment written by four tudent. T T S2 T S0 A? F B? F C? S0: if (A) tate <= ; if (B) tate <= S2; if (C) tate <= S3; tate <= S0; #1 S0: if (!A &&!B &&!C) tate <= S0; if (!A &&!B && C) tate <= S3; if (!A && B) tate <= S2; #2 // there i no if A tate <= ; A S3 F A B C S0 A B C A B S3 S2 S0: if (A) tate <= ; if (!A && B) tate <= S2; if (!A &&!B && C) tate <= S3; if (!A &&!B &&!C) tate <= S0; #3 S0: #4 if (A) tate <= ; if (!A && B) tate <= S2; if (!A &&!B && C) tate <= S3; if (!A &&!B &&!C) tate <= S0; 2.1 Notice that code #3 i imilar to code #1, except that code #3 i perhap unnecearily (but harmlely) more verboe (like my wife! don t tell her). Code #4 i formed by removing the three occurrence of "" in code #3. Code #2 i eentially the revere ordering of code #3. Write "ight" or "Wrong" below for each. Code #1 ; Code #2 ; Code #3 ; Code #4 ; 2.2 Now conider the incomplete Code #5 on the ide along with the Karnaugh map repreentation of the deired tate tranition. If all the three, A, B, C, are true, tate get aigned with S3, get reaigned with S2 and further reaigned with. Since the lat aignment prevail over the prior aignment, in thi cae, tate finally goe to. Note that there i no if claue leading back to S0. Complete the "if" condition in code #5. Ele tate reaon why it can not be completed. S0: #5 if ( ) // write either B or C tate <= S3; if ( ) // write either B or C tate <= S2; if (A) tate <= ; A BC B A 1 S0 S3 S2 S2 C EE457 Quiz - Fall / 9
5 2.3 Combinational logic coding: The reult i either the um SUM of A and B (A+B) or the difference DIFF X minu Y (X-Y), deping on which ever i greater. Auming that all needed declaration are already made appropriately (a reg or wire), complete the alway block below. A B X Y + - SUM DIFF P Q Q>P I0 I1S Y GT_Int GT internal ignal Out of the three SUM, DIFF,, we need to aign uing (blocking / non-blocking) aignment operator only, where a we can aign uing any one of the two operator. DIFF_GT ) SUM A + B DIFF X - Y GT_Int DIFF_GT GT_Int if (GT_Int) Sequential logic coding: The above deign i modified to have regitered output. Thee regiter hall be updated only in COMP tate. Complete the TL (datapath operation) in the COMP tate (COMP cae branch). The cae tatement i in an alway block( (poedge CLK) ). A B X Y + - SUM DIFF GT_Int I0 I1S Y I0 I1S Y D Q [7:0] [7:0] CLK P Q Q>P I0 I1S Y D Q QCOMP CLK (STATE == COMP) one-hot CU notation SCLK DIFF_GT Out of the three SUM, DIFF,,we need to aign uing (blocking / non-blocking) aignment operator only, where a we SCLK COMP:// COMP tate cae branch SUM A + B DIFF X - Y GT_Int DIFF_GT GT_Int if (GT_Int) 3 ( 10 point) 7 min. eproduced below i a Fall 2008 Quiz quetion together with it anwer. Fall 2008 Quetion Number ytem, adder deign: You are looking for a 3-bit adder/ubtractor, which can perform addition or ubtraction of igned or unigned 3-bit number and produce appropriate um/difference together with overflow information. You are given the following 4-bit adder/ubtractor chip. Your lab partner connected it to A[2:0], B[2:0], and SUM[2:0] a hown below. He i not ure whether thi i o far correct and alo he doe not know how to proceed with X0 and Y0 (i.e. whether to connect 0,0 or 0,1, or 1,0, or 1,1). EE457 Quiz - Fall / 9
6 Fall 2008 Q & A Carry Carry awcarry B2 B1 B0 Y3 Y2 Y1 Y0 A2 A1 A0 X3 X2 X1 X0 S3 S2 S0 SUM2 SUM1 SUM0 N.C no connection V C0 ADD/SUB Do you agree with your partner partial deign? Agree / Diagree If you agree, tate what choice work for (X0,Y0) among {(0,0), (0,1), (1,0), (1,1)}. If you diagree, tate reaon. Anwer: {(0,0),(1,0)}. Note: (0,1) doe not convey the needed 1 to C1 for ubtraction. (1,1) convey unneceary 1 to C1 during addition. Same quetion a above, but ince 2 pin i broken, we are forced to connect a hown below. awcarry A2 B2 Y3 Y2 Y1 Y0 X3 X2 X1 X0 S3 S2 S0 SUM2 V N.C no connection A1 B1 SUM1 A0 B0 SUM0 C0 ADD/SUB Baically, the full-adder #2 hould act like a tranparent medium conveying the incoming C2 a outgoing C3. Select one or more choice of connecting to (X2, Y2). (i) (0, 0) (ii) (1, 0) (iii) (0, ADD/SUB) (iv) (0, inverted ADD/SUB) (v) ( ) // fill-in 4 ( point) min. Performance: 4.1 We know frequency of occurrence in the dynamic trace can eaily be different from percentage of time pent. For example, floating point intruction may occur only 10% in frequency but may take 20% of the execution time a they are long. In the following table, there are two unknown, F and T. Find them. Hint: Conider 100 intruction, clock pent on them, percentage of clock pent on C category. Category CPI Frequency Time Spent A B C % (50-F)% F % T % (75-T)% 25% 4.2 Without changing ISA or frequency, by improving non-floating point intruction by reducing the number of clock taken to execute them, you will improve (circle all applicable): (A) ET (Execution Time) (B) elative MIPS (C) Native MIPS (D) MFLOP Without changing ISA or frequency, by improving floating point intruction by reducing the number of clock taken to execute them, you will improve (circle all applicable): (A) ET (Execution Time) (B) elative MIPS (C) Native MIPS (D) MFLOP EE457 Quiz - Fall / 9
7 Without changing frequency, by plitting a non-floating point intruction, which wa taking 12 clock, into two non-floating point intruction taking 6 clock each, you will caue (i) ET (Execution Time) (to go up/to go down/to remain the ame) (ii) elative MIPS (to go up/to go down/to remain the ame) (iii) Native MIPS (to go up/to go down/to remain the ame) (iv) MFLOP (to go up/to go down/to remain the ame) Without changing frequency, by plitting a floating point intruction, which wa taking 12 clock, into two floating point intruction taking 6 clock each, you will caue (i) ET (Execution Time) (to go up/to go down/to remain the ame) (ii) elative MIPS (to go up/to go down/to remain the ame) (iii) Native MIPS (to go up/to go down/to remain the ame) (iv) MFLOP (to go up/to go down/to remain the ame) 5 ( point) min. Single-cycle CPU: eproduced on the next two page i the ingle-cycle CPU block diagram, unmodified on the firt page for your reference and partially modified for your completion on the next page to upport thi new load word intruction, lw_addu, which i defined a follow. regular lw: lw rt, offet(r) ; (rt) <= M[offet = (r)] new lw_add: lw_addu rt, offet(r) ; (rt) <= (rt) + M[offet = (r)] After reading the content of the memory, intead of imply depoiting the read-content into rt, it add the read-content to rt and depoit the um into rt. An additional adder after the memory could be ued but Mr. Trojan told u to ue the BTA (Branch Target Addre) calculating adder a it i not required to calculate BTA when thi lw_add i executing. Ue two multiplexer to deliver the memory content and the rt content to the BTA_adder and another multiplexer to deliver the BTA adder reult a WD (write data) to the regiter file. Control all the three multiplexer uing a new control line called lau (hort for lw_addu). 5.1 Complete the block diagram on next to next page and the control ignal table below. Intruction egdt ALUSrc Memtoreg egwrite Memead MemWrite Branch ALUOp1 ALUop0 lau -format lw w X 1 X beq X 0 X v-lw lw_addu If the original lw intruction needed 40n (10n to fetch the lw intruction, 5n to fetch ource regiter, 10n to calculate effective addre, 10n to read the memory, and 5n to write back to the regiter file). What i your etimate of time needed by lw_addu? EE457 Quiz - Fall / 9
8 5.3 The hardware engineer implemented thi new lw_addu intruction in the new verion of the ingle-cycle CPU but compiler wa not redeigned to utilize thi new intruction. So frequency of occurrence of thi intruction in the dynamic execution trace i 0% (zero percent). The ET (execution time) of the bench mark (goe up / goe down / remain the ame). If you aid, goe up or goe down, do you have adequate data to calculate the factor of performance change? Ye / No. If ye, the performance ha changed by 5.4 new lw_add:lw_addu rt, offet(r) ; (rt) <= (rt) + M[offet = (r) How many ource regiter? how many detination regiter? Intercept Single Cycle CPU (unmodified) No need to write on thi page Intercept EE457 Quiz - Fall / 9
9 Single Cycle CPU (modify thi a needed) EE457 Quiz - Fall / 9
10 6 ( point) min. Multi-cycle CPU: 6.1 While PCWrite (i needed / in t needed) in the ingle-cycle CPU, it (i needed / in t needed) in the multi-cycle CPU. Chooe an appropriate PC-egiter deign from the following 3 choice. Choice 1 i the cheapet and #3 i the mot expenive. You hould chooe cheaper deign if it atifie your need. #1 PC #2 PC #3 D Q [31:0] [31:0] CLK D Q [31:0] [31:0] CLK I0 I1S Y D Q [31:0] [31:0] CLK PC Level-enitive Latch Edge-enitive bare regiter (no recirculating mux) Edge-enitive regiter with recirculating mux Your choice of PC for the ingle-cycle CPU : Your choice of PC for the multi-cycle CPU : 6.2 Temporary regiter are needed if information i produced in one clock and conumed in a later clock. However, we could avoid temporary regiter (for example, MD Memory Data egiter) by Temporary regiter have Temp_egWrite control input o that the CU can tell regiter when to write. The exception to thi rule i 6.3 Computing BTA (for an aumed beq intruction), during the decode tate, i (better/wore) than computing EA (effective addre) (for an aumed lw/w intruction) becaue Blank Space (cratch pad area) EE457 Quiz - Fall / 9
Fall 2010 EE457 Instructor: Gandhi Puvvada Date: 10/1/2010, Friday in SGM123 Name:
Fall 2010 EE457 Intructor: Gandhi Puvvada Quiz (~ 10%) Date: 10/1/2010, Friday in SGM123 Name: Calculator and Cadence Verilog guide are allowed; Cloed-book, Cloed-note, Time: 12:00-2:15PM Total point:
More informationSpring 2012 EE457 Instructor: Gandhi Puvvada
Spring 2012 EE457 Intructor: Gandhi Puvvada Quiz (~ 10%) Date: 2/17/2012, Friday in SLH200 Calculator and Cadence Verilog Guide are allowed; Time: 10:00AM-12:45PM Cloed-book/Cloed-note Exam Total point:
More informationLaboratory Exercise 6
Laboratory Exercie 6 Adder, Subtractor, and Multiplier The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each circuit will be decribed in Verilog and implemented
More information2 ( = 46 points) 30 min.
ee457_quiz_fl2010.fm 10/1/10 2 ( 12 10 24 = 46 points) 30 min. State diagram coding in Verilog (you may refer to the Cadence (Esperan) Verilog guide): Consider the following partial flowchart and the corresponding
More informationLaboratory Exercise 6
Laboratory Exercie 6 Adder, Subtractor, and Multiplier a a The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each b c circuit will be decribed in Verilog
More informationLaboratory Exercise 6
Laboratory Exercie 6 Adder, Subtractor, and Multiplier The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each type of circuit will be implemented in two
More informationLaboratory Exercise 2
Laoratory Exercie Numer and Diplay Thi i an exercie in deigning cominational circuit that can perform inary-to-decimal numer converion and inary-coded-decimal (BCD) addition. Part I We wih to diplay on
More informationLaboratory Exercise 6
Laboratory Exercie 6 Adder, Subtractor, and Multiplier The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each circuit will be decribed in VHL and implemented
More informationCourse Project: Adders, Subtractors, and Multipliers a
In the name Allah Department of Computer Engineering 215 Spring emeter Computer Architecture Coure Intructor: Dr. Mahdi Abbai Coure Project: Adder, Subtractor, and Multiplier a a The purpoe of thi p roject
More informationTopics. Lecture 37: Global Optimization. Issues. A Simple Example: Copy Propagation X := 3 B > 0 Y := 0 X := 4 Y := Z + W A := 2 * 3X
Lecture 37: Global Optimization [Adapted from note by R. Bodik and G. Necula] Topic Global optimization refer to program optimization that encompa multiple baic block in a function. (I have ued the term
More informationLaboratory Exercise 2
Laoratory Exercie Numer and Diplay Thi i an exercie in deigning cominational circuit that can perform inary-to-decimal numer converion and inary-coded-decimal (BCD) addition. Part I We wih to diplay on
More informationVLSI Design 9. Datapath Design
VLSI Deign 9. Datapath Deign 9. Datapath Deign Lat module: Adder circuit Simple adder Fat addition Thi module omparator Shifter Multi-input Adder Multiplier omparator detector: A = 1 detector: A = 11 111
More informationComputer Arithmetic Homework Solutions. 1 An adder for graphics. 2 Partitioned adder. 3 HDL implementation of a partitioned adder
Computer Arithmetic Homework 3 2016 2017 Solution 1 An adder for graphic In a normal ripple carry addition of two poitive number, the carry i the ignal for a reult exceeding the maximum. We ue thi ignal
More informationLecture 14: Minimum Spanning Tree I
COMPSCI 0: Deign and Analyi of Algorithm October 4, 07 Lecture 4: Minimum Spanning Tree I Lecturer: Rong Ge Scribe: Fred Zhang Overview Thi lecture we finih our dicuion of the hortet path problem and introduce
More informationFall 2016 Instructor: Gandhi Puvvada. Thursday, 9/22/2016 (A 2H 50M exam) 05:30 PM - 08:20 PM (170 min) in THH101. Student s Last Name:
EE457 Quiz (~0%) Closed-book Closed-notes Exam; No cheat sheets; No cell phones or computers Calculators and Verilog Guides are not needed and hence not allowed. Fall 206 Instructor: Gandhi Puvvada Thursday,
More informationCourse Updates. Reminders: 1) Assignment #13 due Monday. 2) Mirrors & Lenses. 3) Review for Final: Wednesday, May 5th
Coure Update http://www.phy.hawaii.edu/~varner/phys272-spr0/phyic272.html Reminder: ) Aignment #3 due Monday 2) Mirror & Lene 3) Review for Final: Wedneday, May 5th h R- R θ θ -R h Spherical Mirror Infinite
More informationMinimum congestion spanning trees in bipartite and random graphs
Minimum congetion panning tree in bipartite and random graph M.I. Otrovkii Department of Mathematic and Computer Science St. John Univerity 8000 Utopia Parkway Queen, NY 11439, USA e-mail: otrovm@tjohn.edu
More informationProcessor (I) - datapath & control. Hwansoo Han
Processor (I) - datapath & control Hwansoo Han Introduction CPU performance factors Instruction count - Determined by ISA and compiler CPI and Cycle time - Determined by CPU hardware We will examine two
More informationKaren L. Collins. Wesleyan University. Middletown, CT and. Mark Hovey MIT. Cambridge, MA Abstract
Mot Graph are Edge-Cordial Karen L. Collin Dept. of Mathematic Weleyan Univerity Middletown, CT 6457 and Mark Hovey Dept. of Mathematic MIT Cambridge, MA 239 Abtract We extend the definition of edge-cordial
More informationAlgorithmic Discrete Mathematics 4. Exercise Sheet
Algorithmic Dicrete Mathematic. Exercie Sheet Department of Mathematic SS 0 PD Dr. Ulf Lorenz 0. and. May 0 Dipl.-Math. David Meffert Verion of May, 0 Groupwork Exercie G (Shortet path I) (a) Calculate
More informationProblem Set 2 (Due: Friday, October 19, 2018)
Electrical and Computer Engineering Memorial Univerity of Newfoundland ENGI 9876 - Advanced Data Network Fall 2018 Problem Set 2 (Due: Friday, October 19, 2018) Quetion 1 Conider an M/M/1 model of a queue
More informationEE 457 Midterm Summer 14 Redekopp Name: Closed Book / 105 minutes No CALCULATORS Score: / 100
EE 47 Midterm Summer 4 Redekopp Name: Closed Book / minutes No CALCULATORS Score: /. (7 pts.) Short Answer [Fill in the blanks or select the correct answer] a. If a control signal must be valid during
More informationOperational Semantics Class notes for a lecture given by Mooly Sagiv Tel Aviv University 24/5/2007 By Roy Ganor and Uri Juhasz
Operational emantic Page Operational emantic Cla note for a lecture given by Mooly agiv Tel Aviv Univerity 4/5/7 By Roy Ganor and Uri Juhaz Reference emantic with Application, H. Nielon and F. Nielon,
More informationLecture 8: More Pipelining
Overview Lecture 8: More Pipelining David Black-Schaffer davidbb@tanford.edu EE8 Spring 00 Getting Started with Lab Jut get a ingle pixel calculating at one time Then look into filling your pipeline Multiplier
More informationEE457 Lab 4 Part 4 Seven Questions From Previous Midterm Exams and Final Exams ee457_lab4_part4.fm 10/6/04
EE457 Lab 4 Part 4 Seven Questions From Previous Midterm Exams and Final Exams ee457_lab4_part4.fm 10/6/04 1 [Based on Question #7 of Summer 1993 Midterm] Remove TARGET register, add ZERO FF: Please refer
More information1 The secretary problem
Thi i new material: if you ee error, pleae email jtyu at tanford dot edu 1 The ecretary problem We will tart by analyzing the expected runtime of an algorithm, a you will be expected to do on your homework.
More informationMAT 155: Describing, Exploring, and Comparing Data Page 1 of NotesCh2-3.doc
MAT 155: Decribing, Exploring, and Comparing Data Page 1 of 8 001-oteCh-3.doc ote for Chapter Summarizing and Graphing Data Chapter 3 Decribing, Exploring, and Comparing Data Frequency Ditribution, Graphic
More informationA note on degenerate and spectrally degenerate graphs
A note on degenerate and pectrally degenerate graph Noga Alon Abtract A graph G i called pectrally d-degenerate if the larget eigenvalue of each ubgraph of it with maximum degree D i at mot dd. We prove
More informationContents. shortest paths. Notation. Shortest path problem. Applications. Algorithms and Networks 2010/2011. In the entire course:
Content Shortet path Algorithm and Network 21/211 The hortet path problem: Statement Verion Application Algorithm (for ingle ource p problem) Reminder: relaxation, Dijktra, Variant of Dijktra, Bellman-Ford,
More informationTrainable Context Model for Multiscale Segmentation
Trainable Context Model for Multicale Segmentation Hui Cheng and Charle A. Bouman School of Electrical and Computer Engineering Purdue Univerity Wet Lafayette, IN 47907-1285 {hui, bouman}@ ecn.purdue.edu
More information1 ( = 80 points) 50 min. LOAD INI I <= 0; J <= 1; LSA <= 1; DONE. COMP Compare M[I] with PREV
Spring 203 EE457 Intructor: Gndhi Puvvd Quiz (~ 0%) Dte: 2/22/203, Fridy in THH20 Clcultor nd Epern Verilog Guide re llowed; Time: 09:5AM-:45AM (2 Hour 30 Min) Cloed-book/Cloed-note Exm Totl point: 246
More informationA SIMPLE IMPERATIVE LANGUAGE THE STORE FUNCTION NON-TERMINATING COMMANDS
A SIMPLE IMPERATIVE LANGUAGE Eventually we will preent the emantic of a full-blown language, with declaration, type and looping. However, there are many complication, o we will build up lowly. Our firt
More informationRouting Definition 4.1
4 Routing So far, we have only looked at network without dealing with the iue of how to end information in them from one node to another The problem of ending information in a network i known a routing
More informationEE457. Note: Parts of the solutions are extracted from the solutions manual accompanying the text book.
EE457 Instructor: G. Puvvada ======================================================================= Homework 5b, Solution ======================================================================= Note:
More informationChapter 4. The Processor
Chapter 4 The Processor Introduction CPU performance factors Instruction count Determined by ISA and compiler CPI and Cycle time Determined by CPU hardware We will examine two MIPS implementations A simplified
More informationLecture Outline. Global flow analysis. Global Optimization. Global constant propagation. Liveness analysis. Local Optimization. Global Optimization
Lecture Outline Global flow analyi Global Optimization Global contant propagation Livene analyi Adapted from Lecture by Prof. Alex Aiken and George Necula (UCB) CS781(Praad) L27OP 1 CS781(Praad) L27OP
More informationDistributed Packet Processing Architecture with Reconfigurable Hardware Accelerators for 100Gbps Forwarding Performance on Virtualized Edge Router
Ditributed Packet Proceing Architecture with Reconfigurable Hardware Accelerator for 100Gbp Forwarding Performance on Virtualized Edge Router Satohi Nihiyama, Hitohi Kaneko, and Ichiro Kudo Abtract To
More informationChapter 4. The Processor. Computer Architecture and IC Design Lab
Chapter 4 The Processor Introduction CPU performance factors CPI Clock Cycle Time Instruction count Determined by ISA and compiler CPI and Cycle time Determined by CPU hardware We will examine two MIPS
More informationTHE HONG KONG UNIVERSITY OF SCIENCE & TECHNOLOGY Computer Organization (COMP 2611) Spring Semester, 2014 Final Examination
THE HONG KONG UNIVERSITY OF SCIENCE & TECHNOLOGY Computer Organization (COMP 2611) Spring Semester, 2014 Final Examination May 23, 2014 Name: Email: Student ID: Lab Section Number: Instructions: 1. This
More informationDWH Performance Tuning For Better Reporting
DWH Performance Tuning For Better Sandeep Bhargava Reearch Scholar Naveen Hemrajani Aociate Profeor Dineh Goyal Aociate Profeor Subhah Gander IT Profeional ABSTRACT: The concept of data warehoue deal in
More informationSee chapter 8 in the textbook. Dr Muhammad Al Salamah, Industrial Engineering, KFUPM
Goal programming Objective of the topic: Indentify indutrial baed ituation where two or more objective function are required. Write a multi objective function model dla a goal LP Ue weighting um and preemptive
More informationThe Processor: Datapath and Control. Jin-Soo Kim Computer Systems Laboratory Sungkyunkwan University
The Processor: Datapath and Control Jin-Soo Kim (jinsookim@skku.edu) Computer Systems Laboratory Sungkyunkwan University http://csl.skku.edu Introduction CPU performance factors Instruction count Determined
More informationEE 457 Midterm Summer 14 Redekopp Name: Closed Book / 105 minutes No CALCULATORS Score: / 100
EE 47 Midterm Summer 4 Redekopp Name: Closed Book / minutes No CALCULATORS Score: /. (7 pts.) Short Answer [Fill in the blanks or select the correct answer] a. If a control signal must be valid during
More informationThe Processor (1) Jinkyu Jeong Computer Systems Laboratory Sungkyunkwan University
The Processor (1) Jinkyu Jeong (jinkyu@skku.edu) Computer Systems Laboratory Sungkyunkwan University http://csl.skku.edu EEE3050: Theory on Computer Architectures, Spring 2017, Jinkyu Jeong (jinkyu@skku.edu)
More informationCORRECTNESS ISSUES AND LOOP INVARIANTS
The next everal lecture 2 Study algorithm for earching and orting array. Invetigate their complexity how much time and pace they take Formalize the notion of average-cae and wort-cae complexity CORRECTNESS
More informationAdvanced Encryption Standard and Modes of Operation
Advanced Encryption Standard and Mode of Operation G. Bertoni L. Breveglieri Foundation of Cryptography - AES pp. 1 / 50 AES Advanced Encryption Standard (AES) i a ymmetric cryptographic algorithm AES
More informationSIMIT 7. Profinet IO Gateway. User Manual
SIMIT 7 Profinet IO Gateway Uer Manual Edition January 2013 Siemen offer imulation oftware to plan, imulate and optimize plant and machine. The imulation- and optimizationreult are only non-binding uggetion
More informationMidterm 2 March 10, 2014 Name: NetID: # Total Score
CS 3 : Algorithm and Model of Computation, Spring 0 Midterm March 0, 0 Name: NetID: # 3 Total Score Max 0 0 0 0 Grader Don t panic! Pleae print your name and your NetID in the boxe above. Thi i a cloed-book,
More informationES205 Analysis and Design of Engineering Systems: Lab 1: An Introductory Tutorial: Getting Started with SIMULINK
ES05 Analyi and Deign of Engineering Sytem: Lab : An Introductory Tutorial: Getting Started with SIMULINK What i SIMULINK? SIMULINK i a oftware package for modeling, imulating, and analyzing dynamic ytem.
More informationADAM - A PROBLEM-ORIENTED SYMBOL PROCESSOR
ADAM - A PROBLEM-ORIENTED SYMBOL PROCESSOR A. P. Mullery and R. F. Schauer Thoma J. Waton Reearch Center International Buine Machine Corporation Yorktown Height, New York R. Rice International Buine Machine
More informationChapter 4. The Processor
Chapter 4 The Processor Introduction CPU performance factors Instruction count Determined by ISA and compiler CPI and Cycle time Determined by CPU hardware 4.1 Introduction We will examine two MIPS implementations
More informationCS201: Data Structures and Algorithms. Assignment 2. Version 1d
CS201: Data Structure and Algorithm Aignment 2 Introduction Verion 1d You will compare the performance of green binary earch tree veru red-black tree by reading in a corpu of text, toring the word and
More informationAnalyzing Hydra Historical Statistics Part 2
Analyzing Hydra Hitorical Statitic Part Fabio Maimo Ottaviani EPV Technologie White paper 5 hnode HSM Hitorical Record The hnode i the hierarchical data torage management node and ha to perform all the
More informationThe MIPS Processor Datapath
The MIPS Processor Datapath Module Outline MIPS datapath implementation Register File, Instruction memory, Data memory Instruction interpretation and execution. Combinational control Assignment: Datapath
More informationSpring 2013 EE201L Instructor: Gandhi Puvvada. Time: 7:30-10:20AM SGM124 Total points: Perfect score: Open-Book Open-Notes Exam
Spring 2013 EE201L Instructor: Gandhi Puvvada Final Exam 2 (25%) Date: May 9, 2013, Thursday Name: Open-Book Open-Notes Exam Time: 7:30-10:20AM SGM124 Total points: Perfect score: 1 ( points) min. Memory
More information(12) Patent Application Publication (10) Pub. No.: US 2003/ A1
US 2003O196031A1 (19) United State (12) Patent Application Publication (10) Pub. No.: US 2003/0196031 A1 Chen (43) Pub. Date: Oct. 16, 2003 (54) STORAGE CONTROLLER WITH THE DISK Related U.S. Application
More informationCOMPUTER ORGANIZATION AND DESIGN. 5 th Edition. The Hardware/Software Interface. Chapter 4. The Processor
COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface 5 th Edition Chapter 4 The Processor Introduction CPU performance factors Instruction count Determined by ISA and compiler CPI and Cycle
More informationChapter 5 Solutions: For More Practice
Chapter 5 Solutions: For More Practice 1 Chapter 5 Solutions: For More Practice 5.4 Fetching, reading registers, and writing the destination register takes a total of 300ps for both floating point add/subtract
More informationDrawing Lines in 2 Dimensions
Drawing Line in 2 Dimenion Drawing a traight line (or an arc) between two end point when one i limited to dicrete pixel require a bit of thought. Conider the following line uperimpoed on a 2 dimenional
More informationECE260: Fundamentals of Computer Engineering
Datapath for a Simplified Processor James Moscola Dept. of Engineering & Computer Science York College of Pennsylvania Based on Computer Organization and Design, 5th Edition by Patterson & Hennessy Introduction
More informationDIGITAL LOGIC WITH VHDL (Fall 2013) Unit 4
DIGITAL LOGIC WITH VHDL (Fall 2013) Unit 4 Integer DATA TYPE STRUCTURAL DESCRIPTION Hierarchical deign: port-map, for-generate, ifgenerate. Eample: Adder, comparator, multiplier, Look-up Table, Barrel
More informationA Multi-objective Genetic Algorithm for Reliability Optimization Problem
International Journal of Performability Engineering, Vol. 5, No. 3, April 2009, pp. 227-234. RAMS Conultant Printed in India A Multi-objective Genetic Algorithm for Reliability Optimization Problem AMAR
More informationUniversität Augsburg. Institut für Informatik. Approximating Optimal Visual Sensor Placement. E. Hörster, R. Lienhart.
Univerität Augburg à ÊÇÅÍÆ ËÀǼ Approximating Optimal Viual Senor Placement E. Hörter, R. Lienhart Report 2006-01 Januar 2006 Intitut für Informatik D-86135 Augburg Copyright c E. Hörter, R. Lienhart Intitut
More informationRepresentations and Transformations. Objectives
Repreentation and Tranformation Objective Derive homogeneou coordinate tranformation matrice Introduce tandard tranformation - Rotation - Tranlation - Scaling - Shear Scalar, Point, Vector Three baic element
More informationCOMPUTER ORGANIZATION AND DESIGN. 5 th Edition. The Hardware/Software Interface. Chapter 4. The Processor
COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface 5 th Edition Chapter 4 The Processor COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface 5 th Edition The Processor - Introduction
More informationHardware-Based IPS for Embedded Systems
Hardware-Baed IPS for Embedded Sytem Tomoaki SATO, C&C Sytem Center, Hiroaki Univerity Hiroaki 036-8561 Japan Shuya IMARUOKA and Maa-aki FUKASE Graduate School of Science and Technology, Hiroaki Univerity
More informationarxiv: v1 [cs.ds] 27 Feb 2018
Incremental Strong Connectivity and 2-Connectivity in Directed Graph Louka Georgiadi 1, Giueppe F. Italiano 2, and Niko Parotidi 2 arxiv:1802.10189v1 [c.ds] 27 Feb 2018 1 Univerity of Ioannina, Greece.
More informationChapter 4. Instruction Execution. Introduction. CPU Overview. Multiplexers. Chapter 4 The Processor 1. The Processor.
COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface 5 th Edition COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface 5 th Edition Chapter 4 The Processor The Processor - Introduction
More informationExercise 4: Markov Processes, Cellular Automata and Fuzzy Logic
Exercie 4: Marko rocee, Cellular Automata and Fuzzy Logic Formal Method II, Fall Semeter 203 Solution Sheet Marko rocee Theoretical Exercie. (a) ( point) 0.2 0.7 0.3 tanding 0.25 lying 0.5 0.4 0.2 0.05
More informationChapter 4. The Processor. Instruction count Determined by ISA and compiler. We will examine two MIPS implementations
Chapter 4 The Processor Part I Introduction CPU performance factors Instruction count Determined by ISA and compiler CPI and Cycle time Determined by CPU hardware We will examine two MIPS implementations
More informationFloating Point CORDIC Based Power Operation
Floating Point CORDIC Baed Power Operation Kazumi Malhan, Padmaja AVL Electrical and Computer Engineering Department School of Engineering and Computer Science Oakland Univerity, Rocheter, MI e-mail: kmalhan@oakland.edu,
More informationPerformance of a Robust Filter-based Approach for Contour Detection in Wireless Sensor Networks
Performance of a Robut Filter-baed Approach for Contour Detection in Wirele Senor Network Hadi Alati, William A. Armtrong, Jr., and Ai Naipuri Department of Electrical and Computer Engineering The Univerity
More informationChapter 4. The Processor Designing the datapath
Chapter 4 The Processor Designing the datapath Introduction CPU performance determined by Instruction Count Clock Cycles per Instruction (CPI) and Cycle time Determined by Instruction Set Architecure (ISA)
More informationTopics. FPGA Design EECE 277. Number Representation and Adders. Class Exercise. Laboratory Assignment #2
FPGA Deign EECE 277 Number Repreentation and Adder Dr. William H. Robinon Februar 2, 25 Topi There are kind of people in the world, thoe that undertand binar and thoe that don't. Unknown Adminitrative
More informationMid-term review ECE 161C Electrical and Computer Engineering University of California San Diego
Mid-term review ECE 161C Electrical and Computer Engineering Univerity of California San Diego Nuno Vaconcelo Spring 2014 1. We have een in cla that one popular technique for edge detection i the Canny
More informationSelect Operation (σ) It selects tuples that satisfy the given predicate from a relation (choose rows). Review : RELATIONAL ALGEBRA
Review : RELATIONAL ALGEBRA Relational databae ytem are expected to be equipped with a query language that can ait it uer to query the databae intance. There are two kind of query language relational algebra
More informationTopic #6. Processor Design
Topic #6 Processor Design Major Goals! To present the single-cycle implementation and to develop the student's understanding of combinational and clocked sequential circuits and the relationship between
More informationSystems Architecture
Systems Architecture Lecture 15: A Simple Implementation of MIPS Jeremy R. Johnson Anatole D. Ruslanov William M. Mongan Some or all figures from Computer Organization and Design: The Hardware/Software
More informationIncreasing Throughput and Reducing Delay in Wireless Sensor Networks Using Interference Alignment
Int. J. Communication, Network and Sytem Science, 0, 5, 90-97 http://dx.doi.org/0.436/ijcn.0.50 Publihed Online February 0 (http://www.scirp.org/journal/ijcn) Increaing Throughput and Reducing Delay in
More informationLearning Outcomes. Spiral 2 2. Digital System Design DATAPATH COMPONENTS
2-2. 2-2.2 Learning Outcomes piral 2 2 Arithmetic Components and Their Efficient Implementations I know how to combine overflow and subtraction results to determine comparison results of both signed and
More informationThe Processor. Z. Jerry Shi Department of Computer Science and Engineering University of Connecticut. CSE3666: Introduction to Computer Architecture
The Processor Z. Jerry Shi Department of Computer Science and Engineering University of Connecticut CSE3666: Introduction to Computer Architecture Introduction CPU performance factors Instruction count
More informationECE369. Chapter 5 ECE369
Chapter 5 1 State Elements Unclocked vs. Clocked Clocks used in synchronous logic Clocks are needed in sequential logic to decide when an element that contains state should be updated. State element 1
More informationSIMIT 7. Component Type Editor (CTE) User manual. Siemens Industrial
SIMIT 7 Component Type Editor (CTE) Uer manual Siemen Indutrial Edition January 2013 Siemen offer imulation oftware to plan, imulate and optimize plant and machine. The imulation- and optimizationreult
More informationCSEN 601: Computer System Architecture Summer 2014
CSEN 601: Computer System Architecture Summer 2014 Practice Assignment 5 Solutions Exercise 5-1: (Midterm Spring 2013) a. What are the values of the control signals (except ALUOp) for each of the following
More informationCOMPUTER ORGANIZATION AND DESIGN. The Hardware/Software Interface. Chapter 4. The Processor: A Based on P&H
COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface Chapter 4 The Processor: A Based on P&H Introduction We will examine two MIPS implementations A simplified version A more realistic pipelined
More information(12) Patent Application Publication (10) Pub. No.: US 2011/ A1
(19) United State US 2011 0316690A1 (12) Patent Application Publication (10) Pub. No.: US 2011/0316690 A1 Siegman (43) Pub. Date: Dec. 29, 2011 (54) SYSTEMAND METHOD FOR IDENTIFYING ELECTRICAL EQUIPMENT
More informationAnalysis of slope stability
Engineering manual No. 8 Updated: 02/2016 Analyi of lope tability Program: Slope tability File: Demo_manual_08.gt In thi engineering manual, we are going to how you how to verify the lope tability for
More informationBuilding a Compact On-line MRF Recognizer for Large Character Set using Structured Dictionary Representation and Vector Quantization Technique
202 International Conference on Frontier in Handwriting Recognition Building a Compact On-line MRF Recognizer for Large Character Set uing Structured Dictionary Repreentation and Vector Quantization Technique
More informationCOMP303 - Computer Architecture Lecture 8. Designing a Single Cycle Datapath
COMP33 - Computer Architecture Lecture 8 Designing a Single Cycle Datapath The Big Picture The Five Classic Components of a Computer Processor Input Control Memory Datapath Output The Big Picture: The
More informationCO Computer Architecture and Programming Languages CAPL. Lecture 18 & 19
CO2-3224 Computer Architecture and Programming Languages CAPL Lecture 8 & 9 Dr. Kinga Lipskoch Fall 27 Single Cycle Disadvantages & Advantages Uses the clock cycle inefficiently the clock cycle must be
More informationPolygon Side Lengths NAME DATE TIME
Home Link 5- Polygon Side Length Find any miing coordinate. Plot and label the point on the coordinate grid. Draw the polygon by connecting the point. y a. Rectangle ABCD A: (, ) B: (-, ) The length of
More informationCS/COE0447: Computer Organization
CS/COE0447: Computer Organization and Assembly Language Datapath and Control Sangyeun Cho Dept. of Computer Science A simple MIPS We will design a simple MIPS processor that supports a small instruction
More informationCS/COE0447: Computer Organization
A simple MIPS CS/COE447: Computer Organization and Assembly Language Datapath and Control Sangyeun Cho Dept. of Computer Science We will design a simple MIPS processor that supports a small instruction
More informationLearning Outcomes. Spiral 2 2. Digital System Design DATAPATH COMPONENTS
2-2. 2-2.2 Learning Outcomes piral 2 2 Arithmetic Components and Their Efficient Implementations I know how to combine overflow and subtraction results to determine comparison results of both signed and
More informationCutting Stock by Iterated Matching. Andreas Fritsch, Oliver Vornberger. University of Osnabruck. D Osnabruck.
Cutting Stock by Iterated Matching Andrea Fritch, Oliver Vornberger Univerity of Onabruck Dept of Math/Computer Science D-4909 Onabruck andy@informatikuni-onabrueckde Abtract The combinatorial optimization
More informationCPE 335. Basic MIPS Architecture Part II
CPE 335 Computer Organization Basic MIPS Architecture Part II Dr. Iyad Jafar Adapted from Dr. Gheith Abandah slides http://www.abandah.com/gheith/courses/cpe335_s08/index.html CPE232 Basic MIPS Architecture
More informationChapter 5: The Processor: Datapath and Control
Chapter 5: The Processor: Datapath and Control Overview Logic Design Conventions Building a Datapath and Control Unit Different Implementations of MIPS instruction set A simple implementation of a processor
More informationOptimizing Synchronous Systems for Multi-Dimensional. Notre Dame, IN Ames, Iowa computation is an optimization problem (b) circuit
Optimizing Synchronou Sytem for ulti-imenional pplication Nelon L. Pao and Edwin H.-. Sha Liang-Fang hao ept. of omputer Science & Eng. ept. of Electrical & omputer Eng. Univerity of Notre ame Iowa State
More informationChapter 13 Non Sampling Errors
Chapter 13 Non Sampling Error It i a general aumption in the ampling theory that the true value of each unit in the population can be obtained and tabulated without any error. In practice, thi aumption
More informationELEC 5200/6200 Computer Architecture and Design Spring 2017 Lecture 4: Datapath and Control
ELEC 52/62 Computer Architecture and Design Spring 217 Lecture 4: Datapath and Control Ujjwal Guin, Assistant Professor Department of Electrical and Computer Engineering Auburn University, Auburn, AL 36849
More information