순천향대학교 정보기술공학부 이 상 정 1 4. Accessing and Understanding Performance.

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.
1  1998 Morgan Kaufmann Publishers Chapter 2 Performance Text in blue is by N. Guydosh Updated 1/25/04*
100 Performance ENGR 3410 – Computer Architecture Mark L. Chang Fall 2006.
Computer Organization and Architecture (AT70.01) Comp. Sc. and Inf. Mgmt. Asian Institute of Technology Instructor: Dr. Sumanta Guha Slide Sources: Patterson.
1 Introduction Rapidly changing field: –vacuum tube -> transistor -> IC -> VLSI (see section 1.4) –doubling every 1.5 years: memory capacity processor.
Chapter 4 Assessing and Understanding Performance Bo Cheng.
1 CSE SUNY New Paltz Chapter 2 Performance and Its Measurement.
Chapter 4 Assessing and Understanding Performance
Performance D. A. Patterson and J. L. Hennessey, Computer Organization & Design: The Hardware Software Interface, Morgan Kauffman, second edition 1998.
Computer ArchitectureFall 2007 © September 17, 2007 Karem Sakallah CS-447– Computer Architecture.
1 Chapter 4. 2 Measure, Report, and Summarize Make intelligent choices See through the marketing hype Key to understanding underlying organizational motivation.
1  2004 Morgan Kaufmann Publishers Chapter 4. 2  2004 Morgan Kaufmann Publishers.
1  1998 Morgan Kaufmann Publishers and UCB Performance CEG3420 Computer Design Lecture 3.
Computer ArchitectureFall 2007 © September 19, 2007 Karem Sakallah CS-447– Computer Architecture.
Chapter 4 Assessing and Understanding Performance
Fall 2001CS 4471 Chapter 2: Performance CS 447 Jason Bakos.
1 Chapter 4. 2 Measure, Report, and Summarize Make intelligent choices See through the marketing hype Key to understanding underlying organizational motivation.
1 ECE3055 Computer Architecture and Operating Systems Lecture 2 Performance Prof. Hsien-Hsin Sean Lee School of Electrical and Computer Engineering Georgia.
06/27/2005 Performances of Computer Systems Presentation C CSE : Introduction to Computer Architecture Gojko Babić.
Computer Organization and Design Performance Montek Singh Mon, April 4, 2011 Lecture 13.
1 Computer Performance: Metrics, Measurement, & Evaluation.
Computer Organization and Design Performance Montek Singh Mon, Aug 26, 2013 Lecture 2 1.
컴퓨터 구조 : P & H 3 장 : 컴퓨터 연산 컴퓨터 구조 : P & H Bits are just bits (no inherent meaning) — conventions define relationship between bits and.
1 Embedded Systems Computer Architecture. Embedded Systems2 Memory Hierarchy Registers Cache RAM Disk L2 Cache Speed (faster) Cost (cheaper per-byte)
1 CHAPTER 2 THE ROLE OF PERFORMANCE. 2 Performance Measure, Report, and Summarize Make intelligent choices Why is some hardware better than others for.
1 CPS4150 Chapter 4 Assessing and Understanding Performance.
Performance.  Measure, Report, and Summarize  Make intelligent choices  See through the marketing hype  Key to understanding underlying organizational.
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.
Performance.
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.
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.
1 COMS 361 Computer Organization Title: Performance Date: 10/02/2004 Lecture Number: 3.
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!
Performance – Last Lecture Bottom line performance measure is time Performance A = 1/Execution Time A Comparing Performance N = Performance A / Performance.
4. Performance 4.1 Introduction 4.2 CPU Performance and Its Factors
1  1998 Morgan Kaufmann Publishers Lectures for 2nd Edition Note: these lectures are often supplemented with other materials and also problems from the.
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.
CMSC 611: Advanced Computer Architecture Performance & Benchmarks Some material adapted from Mohamed Younis, UMBC CMSC 611 Spr 2003 course slides Some.
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.
COD Ch. 1 Introduction + The Role of Performance.
June 20, 2001Systems Architecture II1 Systems Architecture II (CS ) Lecture 1: Performance Evaluation and Benchmarking * Jeremy R. Johnson Wed.
BITS Pilani, Pilani Campus Today’s Agenda Role of Performance.
CPEN Digital System Design Assessing and Understanding CPU Performance © Logic and Computer Design Fundamentals, 4 rd Ed., Mano Prentice Hall © Computer.
Computer Organization
Performance Lecture notes from MKP, H. H. Lee and S. Yalamanchili.
September 2 Performance Read 3.1 through 3.4 for Tuesday
Defining Performance Which airplane has the best performance?
Prof. Hsien-Hsin Sean Lee
CSCE 212 Chapter 4: Assessing and Understanding Performance
CS2100 Computer Organisation
Computer Performance He said, to speed things up we need to squeeze the clock.
Performances of Computer Systems
January 25 Did you get mail from Chun-Fa about assignment grades?
Computer Performance Read Chapter 4
Performance.
Computer Organization and Design Chapter 4
CS2100 Computer Organisation
Presentation transcript:

순천향대학교 정보기술공학부 이 상 정 1 4. Accessing and Understanding Performance

Computer Architecture 4. Assessing and Understanding Performance 순천향대학교 정보기술공학부 이 상 정 2  Measure, Report, and Summarize  Make intelligent choices  See through the marketing hype  Key to understanding underlying organizational motivation Why is some hardware better than others for different programs? What factors of system performance are hardware related? (e.g., Do we need a new machine, or a new operating system?) How does the machine's instruction set affect performance? Performance

Computer Architecture 4. Assessing and Understanding Performance 순천향대학교 정보기술공학부 이 상 정 3 Which of these airplanes has the best performance? AirplanePassengersRange (mi)Speed (mph) Boeing Boeing BAC/Sud Concorde Douglas DC  How much faster is the Concorde compared to the 747?  How much bigger is the 747 than the Douglas DC-8?

Computer Architecture 4. Assessing and Understanding Performance 순천향대학교 정보기술공학부 이 상 정 4  Response Time (latency) — How long does it take for my job to run? — How long does it take to execute a job? — How long must I wait for the database query?  Throughput — How many jobs can the machine run at once? — What is the average execution rate? — How much work is getting done?  If we upgrade a machine with a new processor what do we increase?  If we add a new machine to the lab what do we increase? Computer Performance: TIME, TIME, TIME

Computer Architecture 4. Assessing and Understanding Performance 순천향대학교 정보기술공학부 이 상 정 5  Elapsed Time counts everything (disk and memory accesses, I/O, etc.) a useful number, but often not good for comparison purposes  CPU time doesn't count I/O or time spent running other programs can be broken up into system time, and user time  Our focus: user CPU time time spent executing the lines of code that are "in" our program Execution Time

Computer Architecture 4. Assessing and Understanding Performance 순천향대학교 정보기술공학부 이 상 정 6  For some program running on machine X, Performance X = 1 / Execution time X  "X is n times faster than Y" Performance X / Performance Y = n  Problem: machine A runs a program in 20 seconds machine B runs the same program in 25 seconds Book's Definition of Performance

Computer Architecture 4. Assessing and Understanding Performance 순천향대학교 정보기술공학부 이 상 정 7 Clock Cycles  Instead of reporting execution time in seconds, we often use cycles  Clock “ticks” indicate when to start activities (one abstraction):  cycle time = time between ticks = seconds per cycle  clock rate (frequency) = cycles per second (1 Hz. = 1 cycle/sec) A 4 Ghz. clock has a cycle time time

Computer Architecture 4. Assessing and Understanding Performance 순천향대학교 정보기술공학부 이 상 정 8 So, to improve performance (everything else being equal) you can either (increase or decrease?) ________ the # of required cycles for a program, or ________ the clock cycle time or, said another way, ________ the clock rate. How to Improve Performance

Computer Architecture 4. Assessing and Understanding Performance 순천향대학교 정보기술공학부 이 상 정 9  Could assume that number of cycles equals number of instructions This assumption is incorrect, different instructions take different amounts of time on different machines. Why? hint: remember that these are machine instructions, not lines of C code time 1st instruction2nd instruction3rd instruction 4th 5th6th... How many cycles are required for a program?

Computer Architecture 4. Assessing and Understanding Performance 순천향대학교 정보기술공학부 이 상 정 10  Multiplication takes more time than addition  Floating point operations take longer than integer ones  Accessing memory takes more time than accessing registers  Important point: changing the cycle time often changes the number of cycles required for various instructions (more later) time Different numbers of cycles for different instructions

Computer Architecture 4. Assessing and Understanding Performance 순천향대학교 정보기술공학부 이 상 정 11  Our favorite program runs in 10 seconds on computer A, which has a 4 GHz. clock. We are trying to help a computer designer build a new machine B, that will run this program in 6 seconds. The designer can use new (or perhaps more expensive) technology to substantially increase the clock rate, but has informed us that this increase will affect the rest of the CPU design, causing machine B to require 1.2 times as many clock cycles as machine A for the same program. What clock rate should we tell the designer to target?"  Don't Panic, can easily work this out from basic principles Example

Computer Architecture 4. Assessing and Understanding Performance 순천향대학교 정보기술공학부 이 상 정 12  A given program will require some number of instructions (machine instructions) some number of cycles some number of seconds  We have a vocabulary that relates these quantities: cycle time (seconds per cycle) clock rate (cycles per second) CPI (cycles per instruction) a floating point intensive application might have a higher CPI MIPS (millions of instructions per second) this would be higher for a program using simple instructions Now that we understand cycles

Computer Architecture 4. Assessing and Understanding Performance 순천향대학교 정보기술공학부 이 상 정 13 Performance  Performance is determined by execution time  Do any of the other variables equal performance? # of cycles to execute program? # of instructions in program? # of cycles per second? average # of cycles per instruction? average # of instructions per second?  Common pitfall: thinking one of the variables is indicative of performance when it really isn’t.

Computer Architecture 4. Assessing and Understanding Performance 순천향대학교 정보기술공학부 이 상 정 14  Suppose we have two implementations of the same instruction set architecture (ISA). For some program, Machine A has a clock cycle time of 250 ps and a CPI of 2.0 Machine B has a clock cycle time of 500 ps and a CPI of 1.2 What machine is faster for this program, and by how much?  If two machines have the same ISA which of our quantities (e.g., clock rate, CPI, execution time, # of instructions, MIPS) will always be identical? CPI Example

Computer Architecture 4. Assessing and Understanding Performance 순천향대학교 정보기술공학부 이 상 정 15  A compiler designer is trying to decide between two code sequences for a particular machine. Based on the hardware implementation, there are three different classes of instructions: Class A, Class B, and Class C, and they require one, two, and three cycles (respectively). The first code sequence has 5 instructions: 2 of A, 1 of B, and 2 of C The second sequence has 6 instructions: 4 of A, 1 of B, and 1 of C. Which sequence will be faster? How much? What is the CPI for each sequence? # of Instructions Example

Computer Architecture 4. Assessing and Understanding Performance 순천향대학교 정보기술공학부 이 상 정 16  Two different compilers are being tested for a 4 GHz. machine with three different classes of instructions: Class A, Class B, and Class C, which require one, two, and three cycles (respectively). Both compilers are used to produce code for a large piece of software. The first compiler's code uses 5 million Class A instructions, 1 million Class B instructions, and 1 million Class C instructions. The second compiler's code uses 10 million Class A instructions, 1 million Class B instructions, and 1 million Class C instructions.  Which sequence will be faster according to MIPS?  Which sequence will be faster according to execution time? MIPS example

Computer Architecture 4. Assessing and Understanding Performance 순천향대학교 정보기술공학부 이 상 정 17  Performance best determined by running a real application Use programs typical of expected workload Or, typical of expected class of applications e.g., compilers/editors, scientific applications, graphics, etc.  Small benchmarks nice for architects and designers easy to standardize can be abused  SPEC (System Performance Evaluation Cooperative) companies have agreed on a set of real program and inputs valuable indicator of performance (and compiler technology) can still be abused Benchmarks

Computer Architecture 4. Assessing and Understanding Performance 순천향대학교 정보기술공학부 이 상 정 18 Benchmark Games  An embarrassed Intel Corp. acknowledged Friday that a bug in a software program known as a compiler had led the company to overstate the speed of its microprocessor chips on an industry benchmark by 10 percent. However, industry analysts said the coding error…was a sad commentary on a common industry practice of “cheating” on standardized performance tests…The error was pointed out to Intel two days ago by a competitor, Motorola …came in a test known as SPECint92…Intel acknowledged that it had “optimized” its compiler to improve its test scores. The company had also said that it did not like the practice but felt to compelled to make the optimizations because its competitors were doing the same thing…At the heart of Intel’s problem is the practice of “tuning” compiler programs to recognize certain computing problems in the test and then substituting special handwritten pieces of code… Saturday, January 6, 1996 New York Times

Computer Architecture 4. Assessing and Understanding Performance 순천향대학교 정보기술공학부 이 상 정 19 SPEC ‘89  Compiler “enhancements” and performance

Computer Architecture 4. Assessing and Understanding Performance 순천향대학교 정보기술공학부 이 상 정 20 SPEC CPU2000

Computer Architecture 4. Assessing and Understanding Performance 순천향대학교 정보기술공학부 이 상 정 21 SPEC 2000 Does doubling the clock rate double the performance? Can a machine with a slower clock rate have better performance?

Computer Architecture 4. Assessing and Understanding Performance 순천향대학교 정보기술공학부 이 상 정 22 Experiment  Phone a major computer retailer and tell them you are having trouble deciding between two different computers, specifically you are confused about the processors strengths and weaknesses (e.g., Pentium 4 at 2Ghz vs. Celeron M at 1.4 Ghz )  What kind of response are you likely to get?  What kind of response could you give a friend with the same question?

Computer Architecture 4. Assessing and Understanding Performance 순천향대학교 정보기술공학부 이 상 정 23 정량적인 컴퓨터 설계의 원칙  Make the Common Case Fast 컴퓨터 설계 시 자주 사용하는 경우를 더 빨리 처리될 수 있도록 설계하여 성능을 향상  어떤 것이 자주 발생하는 경우이며, 이러한 것들을 보다 빠르게 처리함 으로써 얼마나 성능개선을 얻을 것인가를 결정해야 함  Amdahl 의 법칙이 이와같은 원칙을 정량화하기 위해 사용

Computer Architecture 4. Assessing and Understanding Performance 순천향대학교 정보기술공학부 이 상 정 24 Amdahl's Law  Speedup due to enhancement E: ExTime w/o E Performance w/ E Speedup(E) = = ExTime w/ E Performance w/o E  성능개선 (enhancement) E 가 task 의 fraction F 를 factor S 만큼 개선시 키고, task 의 나머지는 영향을 받지 않는다고 가정

Computer Architecture 4. Assessing and Understanding Performance 순천향대학교 정보기술공학부 이 상 정 25 Amdahl's Law ExTime new = ExTime old x (1 - Fraction enhanced ) + Fraction enhanced Speedup overall = ExTime old ExTime new Speedup enhanced = 1 (1 - Fraction enhanced ) + Fraction enhanced Speedup enhanced

Computer Architecture 4. Assessing and Understanding Performance 순천향대학교 정보기술공학부 이 상 정 26 Amdahl’s Law 예 1  Floating point instructions 의 성능이 2 배 개선  10% of actual instructions 가 FP Speedup overall = =1.053 ExTime new = ExTime old x ( /2) = 0.95 x ExTime old

Computer Architecture 4. Assessing and Understanding Performance 순천향대학교 정보기술공학부 이 상 정 27 Amdahl’s Law 예 2  Floating point SQRT 20% of execution time  Floating point instructions 50% of execution time  Proposal A add hardware to make SQRT 10 times faster  Proposal B add hardware to make all floating point 2 times as fast  Comparison of speedups SpeedupSQRT = (( ) + 0.2/10 )-1 = 1.22 SpeedupFP = (( ) + 0.5/2 )-1 = 1.33  FP enhancement is more effective speedup value is larger

Computer Architecture 4. Assessing and Understanding Performance 순천향대학교 정보기술공학부 이 상 정 28 The CPU Performance Equation CPU time= Seconds = Instructions x Cycles x Seconds Program Program Instruction Cycle CPU time= Seconds = Instructions x Cycles x Seconds Program Program Instruction Cycle Inst Count CPI Clock Rate Program X Compiler X (X) Inst. Set. X X Organization X X Technology X

Computer Architecture 4. Assessing and Understanding Performance 순천향대학교 정보기술공학부 이 상 정 29  Performance is specific to a particular program/s Total execution time is a consistent summary of performance  For a given architecture performance increases come from: increases in clock rate (without adverse CPI affects) improvements in processor organization that lower CPI compiler enhancements that lower CPI and/or instruction count Algorithm/Language choices that affect instruction count  Pitfall: expecting improvement in one aspect of a machine’s performance to affect the total performance Remember