9/16/2004Comp 120 Fall 20041 September 16 Assignment 4 due date pushed back to 23 rd, better start anywayAssignment 4 due date pushed back to 23 rd, better.

Slides:



Advertisements
Similar presentations
CDA 3101 Fall 2010 Discussion Section 08 CPU Performance
Advertisements

Computer Organization Lab 1 Soufiane berouel. Formulas to Remember CPU Time = CPU Clock Cycles x Clock Cycle Time CPU Clock Cycles = Instruction Count.
ISA Issues; Performance Considerations. Testing / System Verilog: ECE385.
Performance of Cache Memory
Performance What differences do we see in performance? Almost all computers operate correctly (within reason) Most computers implement useful operations.
Performance Evaluation of Architectures Vittorio Zaccaria.
TU/e Processor Design 5Z032 1 Processor Design 5Z032 The role of Performance Henk Corporaal Eindhoven University of Technology 2009.
100 Performance ENGR 3410 – Computer Architecture Mark L. Chang Fall 2006.
Computer Organization and Architecture 18 th March, 2008.
CSCE 212 Chapter 4: Assessing and Understanding Performance Instructor: Jason D. Bakos.
CIS429.S00: Lec3 - 1 CPU Time Analysis Terminology IC = instruction count = number of instructions in the program CPI = cycles per instruction (varies.
ENGS 116 Lecture 21 Performance and Quantitative Principles Vincent H. Berk September 26 th, 2008 Reading for today: Chapter , Amdahl article.
Chapter 4 Assessing and Understanding Performance Bo Cheng.
Performance D. A. Patterson and J. L. Hennessey, Computer Organization & Design: The Hardware Software Interface, Morgan Kauffman, second edition 1998.
Computer Performance Evaluation: Cycles Per Instruction (CPI)
Computer Architecture Lecture 2 Instruction Set Principles.
Chapter 4 Assessing and Understanding Performance
Fall 2001CS 4471 Chapter 2: Performance CS 447 Jason Bakos.
1 Lecture 10: FP, Performance Metrics Today’s topics:  IEEE 754 representations  FP arithmetic  Evaluating a system Reminder: assignment 4 due in a.
1 Chapter 4. 2 Measure, Report, and Summarize Make intelligent choices See through the marketing hype Key to understanding underlying organizational motivation.
1 Measuring Performance Chris Clack B261 Systems Architecture.
Computer Organization and Design Performance Montek Singh Mon, April 4, 2011 Lecture 13.
Lecture 2: Computer Performance
1 Embedded Systems Computer Architecture. Embedded Systems2 Memory Hierarchy Registers Cache RAM Disk L2 Cache Speed (faster) Cost (cheaper per-byte)
B0111 Performance Anxiety ENGR xD52 Eric VanWyk Fall 2012.
CDA 3101 Fall 2013 Introduction to Computer Organization Computer Performance 28 August 2013.
1 CS/EE 362 Hardware Fundamentals Lecture 9 (Chapter 2: Hennessy and Patterson) Winter Quarter 1998 Chris Myers.
1 Acknowledgements Class notes based upon Patterson & Hennessy: Book & Lecture Notes Patterson’s 1997 course notes (U.C. Berkeley CS 152, 1997) Tom Fountain.
Computer Organization and Architecture Tutorial 1 Kenneth Lee.
1 CS/COE0447 Computer Organization & Assembly Language CHAPTER 4 Assessing and Understanding Performance.
Performance – Last Lecture Bottom line performance measure is time Performance A = 1/Execution Time A Comparing Performance N = Performance A / Performance.
Performance Lecture notes from MKP, H. H. Lee and S. Yalamanchili.
CEN 316 Computer Organization and Design Assessing and Understanding Performance Mansour AL Zuair.
Computer Organization and Architecture Instructions: Language of the Machine Hennessy Patterson 2/E chapter 3. Notes are available with photocopier 24.
1 System Clock and Clock Synchronization.. System Clock Background Although modern computers are quite fast and getting faster all the time, they still.
CS /02 Semester II Help Session IIA Performance Measures Colin Tan S
1  1998 Morgan Kaufmann Publishers How to measure, report, and summarize performance (suorituskyky, tehokkuus)? What factors determine the performance.
Performance Performance
TEST 1 – Tuesday March 3 Lectures 1 - 8, Ch 1,2 HW Due Feb 24 –1.4.1 p.60 –1.4.4 p.60 –1.4.6 p.60 –1.5.2 p –1.5.4 p.61 –1.5.5 p.61.
1 Lecture 2: Performance, MIPS ISA Today’s topics:  Performance equations  MIPS instructions Reminder: canvas and class webpage:
September 10 Performance Read 3.1 through 3.4 for Wednesday Only 3 classes before 1 st Exam!
Performance – Last Lecture Bottom line performance measure is time Performance A = 1/Execution Time A Comparing Performance N = Performance A / Performance.
Chapter 4. Measure, Report, and Summarize Make intelligent choices See through the marketing hype Understanding underlying organizational aspects Why.
L12 – Performance 1 Comp 411 Computer Performance He said, to speed things up we need to squeeze the clock Study
EGRE 426 Computer Organization and Design Chapter 4.
Computer Engineering Rabie A. Ramadan Lecture 2. Table of Contents 2 Architecture Development and Styles Performance Measures Amdahl’s Law.
Performance 9 ways to fool the public Old Chapter 4 New Chapter 1.4.
Performance Computer Organization II 1 Computer Science Dept Va Tech January 2009 © McQuain & Ribbens Defining Performance Which airplane has.
Computer Architecture CSE 3322 Web Site crystal.uta.edu/~jpatters/cse3322 Send to Pramod Kumar, with the names and s.
B0111 Performance Anxiety ENGR xD52 Eric VanWyk Fall 2012.
10/25/2005Comp 120 Fall October 25 Review for 2 nd Exam on Tuesday 27 October MUL not MULI Ask Questions!
CSE 340 Computer Architecture Summer 2016 Understanding Performance.
Lecture 3. Performance Prof. Taeweon Suh Computer Science & Engineering Korea University COSE222, COMP212, CYDF210 Computer Architecture.
Performance 9 ways to fool the public #1 – Reporting Results.
Performance. Moore's Law Moore's Law Related Curves.
Lecture 3: MIPS Instruction Set
September 2 Performance Read 3.1 through 3.4 for Tuesday
How do we evaluate computer architectures?
CS 286 Computer Architecture & Organization
Defining Performance Which airplane has the best performance?
CSCE 212 Chapter 4: Assessing and Understanding Performance
CS2100 Computer Organisation
September 24 Test 1 review More programming
September 17 Test 1 pre(re)view Fang-Yi will demonstrate Spim
Lecture 3: MIPS Instruction Set
October 29 Review for 2nd Exam Ask Questions! 4/26/2019
January 25 Did you get mail from Chun-Fa about assignment grades?
Chapter 2: Performance CS 447 Jason Bakos Fall 2001 CS 447.
Computer Organization and Design Chapter 4
CS2100 Computer Organisation
Presentation transcript:

9/16/2004Comp 120 Fall September 16 Assignment 4 due date pushed back to 23 rd, better start anywayAssignment 4 due date pushed back to 23 rd, better start anyway Questions?Questions? Test 1 reviewTest 1 review

9/16/2004Comp 120 Fall Question 1 [10] Assume that multiply instructions take 12 cycles and account for 10% of the instructions in a typical program and that the other 90% of the instructions require an average of 4 cycles for each instruction. What percentage of time does the CPU spend doing multiplication? 12 * 0.1 / (12* *0.9) = 25%

9/16/2004Comp 120 Fall Question 2 [10] Consider a byte-addressable memory and an architecture that manipulates 2-byte words. What is the maximum number of words of memory available if the architecture has addresses that are 16 bits long? 2^16 bytes / (2 bytes/word) = 2^15 words = 32k

9/16/2004Comp 120 Fall Question 3 [10] You MP3 player has 128 Mbytes of memory. A typical MP3 music file requires 128 kbits per second. How many minutes of music can you store? 128 * 2^20 bytes * 2^3 bits/byte / (2^17 bits/sec * 60 sec/min) = 2^13/60 = 136 minutes 2^27 bytes * 2^3 bits/byte / (2^17 bits/sec * 2^6 sec/min) = 128 minutes

9/16/2004Comp 120 Fall Question 4 [10] How many instructions that are 16 bits long fit in 32k bytes of memory? 32k / 2 = 16k

9/16/2004Comp 120 Fall Question 5 [10] Two machines have the same clock rate. What can you say about their performance relative to one another? Nothing. They might have different ISA’s or different CPI’s.

9/16/2004Comp 120 Fall Question 6 [10] A certain program executes 200 million instructions. On a 300MHz Pentium II it takes 3 seconds to run. What is the MIPS rating of the processor on this program? What is the average CPI? On a 500MHz Pentium III the program takes 1 second. What is the MIPS rating for this processor? What is the CPI? MIPS = 200/3 = 66.7, CPI = 300*3/200 = 4.5 MIPS = 200/1 = 200, CPI = 500*1/200 = 2.5

9/16/2004Comp 120 Fall Question 7 [10] Consider the characteristics of two machines M1 and M2. M1 has a clock rate of 500Mhz. M2 has a clock rate of 600MHz. There are 4 classes of instructions (A-D) in the instruction set. In a set of benchmark programs, the frequency of each class of instructions is shown in the table. What is the average CPI for each machine? M1 = 0.4* * * *5 = 2.8 M2 = 0.4* * * *4 = 2.45 Instruction ClassFrequencyM1 CPIM2 CPI A40%22 B25%32 C 33 D10%54

9/16/2004Comp 120 Fall Question 8 [10] How much faster is M2 than M1? (2.8 / 500) / (2.45 / 600) = % faster.

9/16/2004Comp 120 Fall Question 9 [10] In a certain set of benchmark programs about every 4th instruction is a load instruction that fetches data from main memory. The time required for a load is 50ns. The CPI for all other instructions is 4. Assuming the ISA’s are the same, how much faster will the benchmarks run with a 1GHz clock than with a 500MHz clock? For 4 instructions the time is 50ns + 3*4/R, so the speedup is (50ns + 24ns) / (50ns + 12ns) = 1.19 or about 19%.

9/16/2004Comp 120 Fall Question 10 [10] State Amdahl’s Law with an equation. Timproved = (Tunaffected + Taffected/improvement)

9/16/2004Comp 120 Fall Question 11 [15] You are going to enhance a machine, and there are two possible improvements: either make multiply instructions run 4 times faster than before, or make memory access instructions run 2 times faster than before. You repeatedly run a program that takes 100 seconds to execute. Of this time, 20% is used for multiplication, 50% for memory access instructions, and 30% for other tasks. What will be the speedup if you improve only multiplication? What will be the speedup if you improve only memory access? What will be the speedup if both improvements are made? Speedup if we improve only multiplication = 100 / ( /4) = 100/85 = 1.18 Speedup if we only improve memory access = 100 / ( /2 + 20) = 100/75 = 1.33 Speedup if both improvements are made = 100 / ( /2 + 20/4) = 100/60 =1.67

9/16/2004Comp 120 Fall Question 12 In a machine with 32 registers and instructions that specify 3 registers (like MIPS R-format). How many bits of the instruction are required to specify the registers? 15 bits (5 bits for each register)

9/16/2004Comp 120 Fall Question 13 Which of the following instructions that will NOT copy the value of $t2 into $t1. a.and $t1,$t2,$t2 b.add $t1,$t2,$t2 c.or $t1,$t2,$t2 d.or $t1,$t2,$zero NO

9/16/2004Comp 120 Fall Question 14 A certain program executes a variable number of floating-point operations and a fixed number of other operations. When the number of floating-point operations is 600x10 6 the program requires 4 seconds to run. When the number of FP operations is 1100x10 6 the program requires 7 seconds to run. What is the CPI for floating-point operations on this 500MHz computer? You’ve got enough information here to set up 2 equations in 2 unknowns and to solve for both the time per floating-point operation AND the total time spent in the other operations. But you don’t need to do all that since all I ask for in effect is the time per floating point operation. Since the other time is constant we can subtract the two times and the two FP operation counts (essentially subtracting the two equations eliminating the constant term) and we see that 500 million FP operations take 3 seconds. So 3 seconds divided by 500 million FP operation times 500 million cycles per second gives 3 cycles per FP operation.