Csci 136 Computer Architecture II – CPU Performance Xiuzhen Cheng

Slides:



Advertisements
Similar presentations
CS1104: Computer Organisation School of Computing National University of Singapore.
Advertisements

TU/e Processor Design 5Z032 1 Processor Design 5Z032 The role of Performance Henk Corporaal Eindhoven University of Technology 2009.
Evaluating Performance
100 Performance ENGR 3410 – Computer Architecture Mark L. Chang Fall 2006.
Chapter 1 CSF 2009 Computer Performance. Defining Performance Which airplane has the best performance? Chapter 1 — Computer Abstractions and Technology.
CS 61C L27 RAID and Performance (1) A Carle, Summer 2006 © UCB inst.eecs.berkeley.edu/~cs61c/su06 CS61C : Machine Structures Lecture #27: RAID & Performance.
CS 61C L42 Performance I (1) Garcia, Spring 2004 © UCB Lecturer PSOE Dan Garcia inst.eecs.berkeley.edu/~cs61c CS61C : Machine.
CS61C L3 Performance (1) Staley, Fall 2005 © UCB Titleless TA Aaron Staley inst.eecs./~cs61c-tc inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures.
Chapter 4 Assessing and Understanding Performance Bo Cheng.
CIS629 Fall Lecture Performance Overview Execution time is the best measure of performance: simple, intuitive, straightforward. Two important.
inst.eecs.berkeley.edu/~cs61c UCB CS61C : Machine Structures Lecture 36 – Performance Every 6 months (Nov/June), the fastest supercomputers.
Cs 61C L23 performance.1 Patterson Spring 99 ©UCB CS61C Performance Lecture 23 April 21, 1999 Dave Patterson (http.cs.berkeley.edu/~patterson) www-inst.eecs.berkeley.edu/~cs61c/schedule.html.
CS 61C L27 RAID and Performance (1) A Carle, Summer 2005 © UCB inst.eecs.berkeley.edu/~cs61c/su05 CS61C : Machine Structures Lecture #27: RAID & Performance.
Computer ArchitectureFall 2007 © September 17, 2007 Karem Sakallah CS-447– Computer Architecture.
1  1998 Morgan Kaufmann Publishers and UCB Performance CEG3420 Computer Design Lecture 3.
Copyright © 1998 Wanda Kunkle Computer Organization 1 Chapter 2.1 Introduction.
Chapter 4 Assessing and Understanding Performance
CS61C L39 Performance (1) Garcia, Spring 2007 © UCB Fast CPU!  TRIPS is a UT Austin scaleable architecture with replicated tiles (like in a Bee’s eye).
CS61C L41 Performance I (1) Garcia, Fall 2004 © UCB Lecturer PSOE Dan Garcia inst.eecs.berkeley.edu/~cs61c CS61C : Machine.
CS61C L221 Performance © UC Regents 1 CS61C - Machine Structures Lecture 22 - Introduction to Performance November 17, 2000 David Patterson
CS430 – Computer Architecture Lecture - Introduction to Performance
CIS429/529 Winter 07 - Performance - 1 Performance Overview Execution time is the best measure of performance: simple, intuitive, straightforward. Two.
1 Chapter 4. 2 Measure, Report, and Summarize Make intelligent choices See through the marketing hype Key to understanding underlying organizational motivation.
ECE 4436ECE 5367 Introduction to Computer Architecture and Design Ji Chen Section : T TH 1:00PM – 2:30PM Prerequisites: ECE 4436.
1 Computer Performance: Metrics, Measurement, & Evaluation.
Lecture 2: Computer Performance
inst.eecs.berkeley.edu/~cs61c UCB CS61C : Machine Structures Lecture 38 – Performance Every 6 months (Nov/June), the fastest supercomputers.
CSCI-365 Computer Organization Lecture Note: Some slides and/or pictures in the following are adapted from: Computer Organization and Design, Patterson.
1 CHAPTER 2 THE ROLE OF PERFORMANCE. 2 Performance Measure, Report, and Summarize Make intelligent choices Why is some hardware better than others for.
CS61C L41 Performance II (1) Garcia © UCB Lecturer PSOE Dan Garcia inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures.
Performance Chapter 4 P&H. Introduction How does one measure report and summarise performance? Complexity of modern systems make it very more difficult.
B0111 Performance Anxiety ENGR xD52 Eric VanWyk Fall 2012.
10/19/2015Erkay Savas1 Performance Computer Architecture – CS401 Erkay Savas Sabanci University.
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.
Performance.
Computer Performance Computer Engineering Department.
1 CS465 Performance Revisited (Chapter 1) Be able to compare performance of simple system configurations and understand the performance implications of.
1 CS/COE0447 Computer Organization & Assembly Language CHAPTER 4 Assessing and Understanding Performance.
CEN 316 Computer Organization and Design Assessing and Understanding Performance Mansour AL Zuair.
EEL5708/Bölöni Lec 1.1 August 21, 2006 Lotzi Bölöni Fall 2006 EEL 5708 High Performance Computer Architecture Lecture 1 Introduction.
Morgan Kaufmann Publishers
CSE2021: Computer Organization Instructor: Dr. Amir Asif Department of Computer Science York University Handout # 2: Measuring Performance Topics: 1. Performance:
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.
September 10 Performance Read 3.1 through 3.4 for Wednesday Only 3 classes before 1 st Exam!
Lecture 5: 9/10/2002CS170 Fall CS170 Computer Organization and Architecture I Ayman Abdel-Hamid Department of Computer Science Old Dominion University.
Chapter 4. Measure, Report, and Summarize Make intelligent choices See through the marketing hype Understanding underlying organizational aspects Why.
Lec2.1 Computer Architecture Chapter 2 The Role of Performance.
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 ARCHITECTURE & OPERATIONS I Instructor: Yaohang Li.
IT 251 Computer Organization and Architecture Performance Chia-Chi Teng.
Computer Architecture CSE 3322 Web Site crystal.uta.edu/~jpatters/cse3322 Send to Pramod Kumar, with the names and s.
EEL-4713 Ann Gordon-Ross.1 EEL-4713 Computer Architecture Performance.
CSE 340 Computer Architecture Summer 2016 Understanding Performance.
Lecture 3. Performance Prof. Taeweon Suh Computer Science & Engineering Korea University COSE222, COMP212, CYDF210 Computer Architecture.
BITS Pilani, Pilani Campus Today’s Agenda Role of Performance.
Measuring Performance and Benchmarks Instructor: Dr. Mike Turi Department of Computer Science and Computer Engineering Pacific Lutheran University Lecture.
Lecture 2: Performance Evaluation
Performance Lecture notes from MKP, H. H. Lee and S. Yalamanchili.
September 2 Performance Read 3.1 through 3.4 for Tuesday
How do we evaluate computer architectures?
Computer Architecture & Operations I
Prof. Hsien-Hsin Sean Lee
Chapter 1 Computer Abstractions & Technology Performance Evaluation
Computer Performance He said, to speed things up we need to squeeze the clock.
Performance.
Computer Organization and Design Chapter 4
Presentation transcript:

Csci 136 Computer Architecture II – CPU Performance Xiuzhen Cheng

Announcement Quiz #2: Tuesday, March 1st Project #2 is due on March 10, Thursday night. Homework Assignment #5 is due on March 1 Homework Assignment #6 – No submission, No grading!

Performance Purchasing Perspective: given a collection of machines (or upgrade options), which has the best performance ? least cost ? best performance / cost ? Computer Designer Perspective: faced with design options, which has the best performance improvement ? least cost ? best performance / cost ? All require basis for comparison and metric for evaluation Solid metrics lead to solid progress!

Two Notions of “Performance” Plane Boeing 747 BAD/Sud Concorde Top Speed DC to Paris Passen- gers Throughput (pmph) 610 mph 6.5 hours , mph 3 hours132178,200 Which has higher performance? Time to deliver 1 passenger? Time to deliver 400 passengers? In a computer, time for 1 job called Response Time or Execution Time In a computer, jobs per day or in unit-time called Throughput or Bandwidth

Definitions Performance is in units of things per sec bigger is better If we are primarily concerned with response time performance(x) = 1 execution_time(x) " F(ast) is n times faster than S(low) " means… performance(F) execution_time(S) n = = performance(S) execution_time(F)

Example of Response Time v. Throughput Time of Concorde vs. Boeing 747? Concord is 6.5 hours / 3 hours = 2.2 times faster Throughput of Boeing vs. Concorde? Boeing 747: 286,700 pmph / 178,200 pmph = 1.6 times faster Boeing is 1.6 times (“60%”) faster in terms of throughput Concord is 2.2 times (“120%”) faster in terms of flying time (response time) We will focus primarily on execution time for a single job

Confusing Wording on Performance Will (try to) stick to “n times faster”; its less confusing than “m % faster” As faster means both increased performance and decreased execution time, to reduce confusion we will (and you should) use “improve performance” or “improve execution time”

What is Time? Straightforward definition of time: Total time to complete a task, including disk accesses, memory accesses, I/O activities, operating system overhead,... “real time”, “response time” or “elapsed time” Alternative: just time processor (CPU) is working only on your program (since multiple processes running at same time) “CPU execution time” or “CPU time” Often divided into system CPU time (in OS) and user CPU time (in user program)

How to Measure Time? User Time  seconds CPU Time: Computers constructed using a clock that runs at a constant rate and determines when events take place in the hardware These discrete time intervals called clock cycles (or informally clocks or cycles) Length of clock period: clock cycle time (e.g., 2 nanoseconds or 2 ns) and clock rate (e.g., 500 megahertz, or 500 MHz), which is the inverse of the clock period; use these!

Measuring Time using Clock Cycles (1/2) Or = Clock Cycles for a program Clock Rate CPU execution time for a program = Clock Cycles for a program x Clock Cycle Time

Measuring Time using Clock Cycles (2/2) One way to define clock cycles: Clock Cycles for program = Instructions for a program (called “Instruction Count”) x Average Clock cycles Per Instruction (abbreviated “CPI”) CPI is one way to compare two machines with same instruction set, since Instruction Count would be the same

Performance Calculation (1/2) CPU execution time for program = Clock Cycles for program x Clock Cycle Time Substituting for clock cycles: CPU execution time for program = (Instruction Count x CPI) x Clock Cycle Time = Instruction Count x CPI x Clock Cycle Time

Performance Calculation (2/2) CPU time = Instructions x Cycles x Seconds ProgramInstructionCycle CPU time = Instructions x Cycles x Seconds ProgramInstructionCycle CPU time = Instructions x Cycles x Seconds ProgramInstructionCycle CPU time = Seconds Program Product of all 3 terms: if missing a term, can’t predict time, the real measure of performance

How to Calculate the 3 Components? Clock Cycle Time: in specification of computer (Clock Rate in advertisements) Instruction Count: Count instructions in loop of small program Use simulator to count instructions Hardware counter in spec. register (Pentium II,III,4) CPI: Calculate: Execution Time / Clock cycle time Instruction Count Hardware counter in special register (PII,III,4)

Calculating CPI Another Way First calculate CPI for each individual instruction ( add, sub, and, etc.) Next calculate frequency of each individual instruction Finally multiply these two for each instruction and add them up to get final CPI (the weighted sum)

Example (RISC processor) OpFreq i CPI i Prod(% Time) ALU50%1.5(23%) Load20%5 1.0(45%) Store10%3.3(14%) Branch20%2.4(18%) 2.2 What if Branch instructions twice as fast? Instruction Mix(Where time spent)

What Programs Measure for Comparison? Ideally run typical programs with typical input before purchase, or before even build machine Called a “workload”; For example: Engineer uses compiler, spreadsheet Author uses word processor, drawing program, compression software In some situations it’s hard to do Don’t have access to machine to “benchmark” before purchase Don’t know workload in future

Benchmarks Obviously, apparent speed of processor depends on code used to test it Need industry standards so that different processors can be fairly compared Companies exist that create these benchmarks: “typical” code used to evaluate systems Need to be changed every 2 or 3 years since designers could (and do!) target for these standard benchmarks

Example Standardized Benchmarks (1/2) Standard Performance Evaluation Corporation (SPEC) SPEC CPU2000 CINT integer (gzip, gcc, crafty, perl,...) CFP floating-point (swim, mesa, art,...) All relative to base machine Sun 300MHz 256Mb-RAM Ultra5_10, which gets score of They measure System speed (SPECint2000) System throughput (SPECint_rate2000)

Example Standardized Benchmarks (2/2) SPEC Benchmarks distributed in source code Members of consortium select workload 30+ companies, 40+ universities Compiler, machine designers target benchmarks, so try to change every 3 years The last benchmark released was SPEC 2000 They are still finalizing SPEC 2004

Example PC Workload Benchmark PCs: Ziff-Davis Benchmark Suite “Business Winstone is a system-level, application-based benchmark that measures a PC's overall performance when running today's top-selling Windows-based 32-bit applications… it doesn't mimic what these packages do; it runs real applications through a series of scripted activities and uses the time a PC takes to complete those activities to produce its performance scores. Also tests for CDs, Content-creation, Audio, 3D graphics, battery life

Other PC benchmarking resources [H]ard|OCP ( - “is an online site where hardware-expert-gamers outline new features and run a number of tests (including overclock limits) on cutting-edge hardware (CPU, motherboard, videoboard, modified cases, etc).” 3DMark and PCMark ( - “are commonly used benchmarks to demonstrate the aggregate power of a system for common applications. 3DMark runs eye-candy pretty demos of games from most genres using the newest technology. PCMark tests operating system, multimedia, and office application performance (neat tests list at ).” SiSoft Sandra ( - “Tons of standard benchmarks and also information tools. Used with the above to generate bragging rights” Thanks to Robert van Spyk for these leads…

Performance Evaluation Good products created when have: Good benchmarks Good ways to summarize performance Given sales is a function of performance relative to competition, should invest in improving product as reported by performance summary? If benchmarks/summary inadequate, then choose between improving product for real programs vs. improving product to get more sales; Sales almost always wins!

“And in conclusion…” Latency v. Throughput Performance doesn’t depend on any single factor: need to know Instruction Count, Clocks Per Instruction (CPI) and Clock Rate to get valid estimations User Time: time user needs to wait for program to execute: depends heavily on how OS switches between tasks CPU Time: time spent executing a single program: depends solely on design of processor (datapath, pipelining effectiveness, caches, etc.) CPU time = Instructions x Cycles x Seconds ProgramInstructionCycle