COSC 6385 Computer Architecture. Fundamentals

Size: px

Start display at page:

Download "COSC 6385 Computer Architecture. Fundamentals"

Kathleen Beasley
6 years ago
Views:

1 COSC 6385 Computer Architecture Fudametals Edgar Gabriel Sprig 208 Measurig performace (I) Respose time: how log does it take to execute a certai applicatio/a certai amout of work Give two platforms X ad Y, X is times faster tha Y for a certai applicatio if Y X Performace of X is times higher tha performace of Y if Y X Perf Perf Y X Perf Perf X Y () (2)

2 Measurig performace (II) Timig how log a applicatio takes Wall clock time/elapsed time: time to complete a task as see by the user. Might iclude operatig system overhead or potetially iterferig other applicatios. CPU time: does ot iclude time slices itroduced by exteral sources (e.g. ruig other applicatios). CPU time ca be further divided ito User CPU time: CPU time spet i the program System CPU time: CPU time spet i the OS performig tasks requested by the program. Measurig performace E.g. usig the UNIX time commad Elapsed time User CPU time System CPU time 2

3 Speedup overall Amdahl s Law Describes the performace gais by acig oe part of the overall system (code, computer) org Perf Speedup (3) Perforg Amdahl s Law depeds o two factors: Fractio of the executio time affected by acemet The improvemet gaied by the acemet for this fractio org (( Fractio Fractio ) Speedup ) (4) Speedup overall org Fractio ( Fractio ) Speedup (5) 6 Speedup Amdahl s Law (III) overall Fractio ( Fractio ) Speedup Fractio aced: 20% Fractio aced: 40% Fractio aced: 60% Fractio aced: 80% Speedup aced 3

4 Amdahl s Law (IV) Speedup accordig to Amdahl's Law 2 0 Speedup overall Speedup aced: 2 Speedup aced: 4 Speedup aced: Fractio aced Amdahl s Law - example Assume a ew web-server with a CPU beig 0 times faster o computatio tha the previous web-server. I/O performace is ot improved compared to the old machie. The web-server speds 40% of its time i computatio ad 60% i I/O. How much faster is the ew machie overall? Fractio 0.4 Speedup 0 usig formula (5) Speedup overall ( Fractio Fractio ) Speedup 0.4 ( 0.4)

5 Amdahl s Law example (II) Example: Cosider a graphics card 50% of its total executio time is spet i floatig poit operatios 20% of its total executio time is spet i floatig poit square root operatios (FPSQR). Optio : improve the FPSQR operatio by a factor of 0. Optio 2: improve all floatig poit operatios by a factor of.6 Speedup FPSQR 0.2 ( 0.2) ( ) 0 SpeedupFP 0.5 ( 0.5) ( ) Optio 2 slightly faster CPU Performace Equatio Micro-processors are based o a clock ruig at a costat rate Clock cycle time: CC t legth of the discrete time evet i s Equivalet measure: Rate CPUr CCtime Expressed i MHz, GHz CPU time of a program ca the be expressed as or CPU CPU time time o cycles o CPU cycles r CC time (6) (7) 5

6 CPU Performace equatio (II) CPI: Average umber of clock cycles per istructio IC: umber of istructios o CPI IC cycles Sice the CPI is ofte kow (average), the CPU time is (8) CPU IC CPI time CC time Expadig formula (6) leads to CPU time istructios ocycles program istructio time o cycles (9) (0) CPU performace equatio (III) Accordig to (7) CPU performace is depedig o Clock cycle time Hardware techology CPI Orgaizatio ad istructio set architecture Istructio cout ISA ad compiler techology Note: o the last slide we used the average CPI over all istructios occurrig i a applicatio Differet istructios ca have strogly varyig CPI s o cycles CPU time i IC CPI i i ICi CPIi CC i time () (2) 6

7 CPU performace equatio (IV) The average CPI for a applicatio ca the be calculated as CPI i ICi CPIi IC total i ICi IC total CPI i (3) ICi IC total : Fractio of occurrece of that istructio i a program Example (I) (Page 54 i the 6 th Editio) Cosider a graphics card, with FP operatios (icludig FPSQR): frequecy 25%, average CPI 4.0 FPSQR operatios oly: frequecy 2%, average CPI 20 all other istructios: average CPI Desig optio : decrease CPI of FPSQR to 2 Desig optio 2: decrease CPI of all FP operatios to 2.5 Usig formula (3): CPI org ICi IC i CPI CPI total CPI (20 2) org i (4*0.25) ( *0.75) ICi CPI2 CPIi (2.5*0.25) ( *0.75).625 IC i total 7

8 Example (II) Slightly modified compared to the previous sectio: cosider a graphics card, with FP operatios (excludig FPSQR): frequecy 25%, average CPI 4.0 FPSQR operatios: frequecy 2%, average CPI 20 all other istructios: average CPI.33 Desig optio : decrease CPI of FPSQR to 2 Desig optio 2: decrease CPI of all FP operatios to 2.5 Usig formula (3): ICi CPIorg CPIi (4*0.25) (20*0.02) (.33*0.73) i ICtotal ICi CPI CPIi (4*0.25) (2*0.02) (.33*0.73) i ICtotal ICi CPI2 CPIi (2.5*0.25) (20*0.02) (.33*0.73).9959 IC i total Choosig the right programs to test a system Most systems host a wide variety of differet applicatios Profiles of certai systems give by their purpose/fuctio Web server: high I/O requiremets hardly ay floatig poit operatios A system used for weather forecastig simulatios Very high floatig poit performace required Lots of mai memory Number of processors have to match the problem size calculated i order to deliver at least real-time results 8

9 Choosig the right programs to test a system (II) Real applicatio: use the target applicatio for the machie i order to evaluate its performace Best solutio if applicatio available Modified applicatios: real applicatio has bee modified i order to measure a certai feature. E.g. remove I/O parts of a applicatio i order to focus o the CPU performace Applicatio kerels: focus o the most time-cosumig parts of a applicatio E.g. extract the matrix-vector multiply of a applicatio, sice this uses 80% of the user CPU time. Choosig the right programs to test a system (III) Toy bechmarks: very small code segmets which produce a predictable result E.g. sieve of Eratosthees, quicksort Sythetic bechmarks: try to match the average frequecy of operatios ad operads for a certai program Code does ot do ay useful work 9

10 SPEC Bechmarks Slide based o a talk ad courtesy of Matthias Mueller, RWTH Aache What is SPEC? The Stadard Performace Evaluatio Corporatio (SPEC) is a o-profit corporatio formed to establish, maitai ad edorse a stadardized set of relevat bechmarks that ca be applied to the ewest geeratio of high-performace computers. SPEC develops suites of bechmarks ad also reviews ad publishes submitted results from our member orgaizatios ad other bechmark licesees. For more details see Slide based o a talk ad courtesy of Matthias Mueller, RWTH Aache 0

11 SPEC groups Ope Systems Group (desktop systems, high-ed workstatios ad servers) CPU (CPU bechmarks) JAVA (java cliet ad server side bechmarks) MAIL (mail server bechmarks) SFS (file server bechmarks) WEB (web server bechmarks) High Performace Group (HPC systems) OMP (OpeMP bechmark) HPC (HPC applicatio bechmark) MPI (MPI applicatio bechmark) Graphics Performace Groups (Graphics) Apc (Graphics applicatio bechmarks) Opc (OpeGL performace bechmarks) Slide based o a talk ad courtesy of Matthias Mueller, RWTH Aache Why do we eed bechmarks? Idetify problems: measure machie properties evolutio: verify that we make progress Coverage: help vedors to have represetative codes Icrease competitio by trasparecy Drive future developmet Relevace: help customers to choose the right computer Slide based o a talk ad courtesy of Matthias Mueller, RWTH Aache

12 SPEC-Bechmarks All SPEC bechmarks are publicly available ad well kow/uderstood Compiler ca itroduce special optimizatios for these bechmarks, which might be irrelevat for other, real-world applicatios. user has to provide the precise list of compile-flags user has to provide performace of base (o-optimized) ru Compiler ca use statistical iformatios collected durig the first executio i order to optimize further rus (Cache hit rates, usage of registers) Bechmarks desiged such that exteral iflueces are kept at a miumum (e.g. iput/output) Slide based o a talk ad courtesy of Matthias Mueller, RWTH Aache SPEC CPU idepedet programs SPECspeed suites always ru oe copy of each bechmark. SPECrate suites ru multiple cocurret copies of each bechmark (The tester selects how may). 0 Iteger bechmarks: 5 writte i C, 4 i C++, i Fortra 4 Floatig Poit: 6 i Fortra, 5 i C++, 3 i C Additioal iformatio is available for each bechmark: Author of the bechmark Detailled descriptio Documetatio regardig Iput ad Output Potetial problems ad refereces. 2

13 SPEC CPU 207 Iteger bechmarks SPEC CPU 207 Floatig Poit Bechmarks 3

14 Example for a CINT bechmark 4

15 Performace metrics SPECspeed Iteger Metrics: SPECspeed207_it_base (Required Base metric) SPECspeed207_it_peak (Optioal Peak metric) SPECspeed Floatig Poit Metrics: SPECspeed207_fp_base (Required Base metric) SPECspeed207_fp_peak (Optioal Peak metric) SPECrate Iteger Metrics: SPECrate207_it_base (Required Base metric) SPECrate207_it_peak (Optioal Peak metric) SPECrate Floatig Poit Metrics: SPECrate207_fp_base (Required Base metric) SPECrate207_fp_peak (Optioal Peak metric) Base metrics: all modules of a give suite must be compiled with same argumets Peak metrics: differet optios for each bechmark are allowed Performace metrics (II) All results are relative to a referece system The fial results is computed by usig the geometric mea values Speed: Rate: SPEC SPEC i ref it/ fp ( *00) i i t ru t t i ref it/ fp ( *.6* N) i i t ru with: : umber of bechmarks i a suite t i ref / t i ru : executio time for bechmark i o the referece/test system N: Number of simultaeous tasks Slide based o a talk ad courtesy of Matthias Mueller, RWTH Aache 5

Reportig results SPEC produces a miimal set of represetative umbers: + Reducies complexity to uderstad correlatios + Easies compariso of differet systems - Loss of iformatio Results have to be

16 Reportig results SPEC produces a miimal set of represetative umbers: + Reducies complexity to uderstad correlatios + Easies compariso of differet systems - Loss of iformatio Results have to be compliat to the SPEC bechmakrig rules i order to be approved as a official SPEC report All compoets have to available at least 3 moth after the publicatio (icludig a rutime eviromet for C/C++/Fortra applicatios) Usage of SPEC tools for compilig ad reportig Each idividual bechmark has to be executed at least three times Verificatio of the bechmark output A maximum of four optimizatio flags are allowed for the base ru (icludig preprocessor ad lik directives) Disclosure report cotaiig all relevat data has to be available 6

17 7

COSC 6385 Computer Architecture. Performance Measurement

COSC 6385 Computer Architecture. Performance Measurement COSC 6385 Computer Archtecture Performace Measuremet Edgar Gabrel Sprg 204 Measurg performace (I) Respose tme: how log does t take to execute a certa applcato/a certa amout of work Gve two platforms X