Computer Systems Performance Analysis and Benchmarking (37-235)
|
|
|
- Paulina Reeves
- 5 years ago
- Views:
Transcription
1 Computer Systems Performance Analysis and Benchmarking (37-235) Analytic Modelling Simulation Measurements / Benchmarking Lecture/Assignments/Projects: Dipl. Inf. Ing. Christian Kurmann Textbook: Raj Jain, The Art of Computer Systems Performance Analysis, 1991 Wiley & Sons, New York Topic of Today: Popular Benchmarks Workload Selection Perf.Eval.&Benchmarking Stricker, Kurmann
2 Benchmarking and Benchmarks ;-) to benchmark v. trans. To subject (a system) to a series of tests in order to obtain prearranged results not available on competitive systems. S. Kelly-Bootle The Devil s DB Dictionnary Benchmarking: The process of performance comparison for two or more systems by measurement. Benchmarks: Workload used in the measurements Perf.Eval.&Benchmarking Stricker, Kurmann
3 Popular Benchmarks Sieve of Erathostenes: Brain dead way to find primes Depends on: Memory Systems Performance Implementation Array/Bitset Working Set in Memory Ackermann Function: Silly recursive Funktion Product of Infinite Log Shaving by Theoreticians. Notion of log* ~ const. but not quite constant. Inverse of x=log*(y) A(1,j)=2^j A(i,1)=A(i-1,2) A(i,j)=A(i-1,A(i,j-1)) see also: Cormen, Leiserson, Rivest: Algorithms Perf.Eval.&Benchmarking Stricker, Kurmann
4 Dhrystone Popular Benchmarks Reinhold Weicker at Siemens [1984] lots of procedure calls, integer perf. systems programming workload in C, Ada and Pascal Integer only: DIPS Whetstone British central computer agency [1975], 11 modules designed after 949 Algol programs. Fixed and floating point arithmetic: KWIPS compiler sensitive both will fit in caches Perf.Eval.&Benchmarking Stricker, Kurmann
5 LINPACK Popular Benchmarks Jack Dongarra (1983), Argonne Nat.Lab Subroutines to solve dense linear systems. Most time consumed in BLAS (Basic Linear Algebra Subroutines) MFLOPs Popular for: 100x100 system of equations 1000x1000 system of equations Represent: finite element analysis, simulation calls for high computation speed graphics processing Engineering/Scientific applic. perf Perf.Eval.&Benchmarking Stricker, Kurmann
6 Debit Credit Popular Benchmarks TPC-A Benchmark, August 1988 (Transaction Processing Performance Council) Perf.Eval.&Benchmarking Stricker, Kurmann
7 Popular Benchmarks SPEC Suite 1992, 1995, Programs submitted by scientists and engineers. GCC Espresso Spice 2g6 Doduc Electronic Design Automation Electronic Design Automation Monte Carlo Simulation Nuke NASA7 Matrix OPs submitted by NASA LI Do 9 queens on 8x8 board in LISP Eqntott Matrix300 Fpppp Tomcatv Boolean Eqn to Truth Table LINPACK 300x300 doubles Quantum Chemistry integral on double floats FORTRAN Vectorized Mesh Generator Perf.Eval.&Benchmarking Stricker, Kurmann
8 Popular Benchmarks CPU and FPU Two copies run on each processor Compared to Reference System a VAX 11/780 Release 1.0 ~ 1 MIPS Ratio of each benchmarks Spec Througput considering the number of processors #cpu@ratio. Geometric Mean leads to SPECmark. New trend: Industry standard benchmarks Perf.Eval.&Benchmarking Stricker, Kurmann
9 Workload Selection (More an Art than a Science) Very important part of every performance evaluation project. Service Exercised: System under Test (SUT) = Service Provider e.g. CPU, PC Component under Study (CUS) e.g. ALU, CPU The system determines selection of workload & metric not the component. Banking system services transaction per second not instructions per second CPU vice versa Perf.Eval.&Benchmarking Stricker, Kurmann
10 Hierarchical View of a System Hierarchy of interfaces at which requests on a time sharing system are serviced: 1. ALU: most frequent instruction 2. CPU: instruction mix, kernels 3. OS: synthetic programs with IO 4. Application: frequency of transactions Determine the SUT level! Perf.Eval.&Benchmarking Stricker, Kurmann
11 Example Network Choice of Workload depends on layer at which networks are compared Perf.Eval.&Benchmarking Stricker, Kurmann
12 Example Backup System Levels in a magnetic tape backup system: Backup System Tape Data System Tape Drives Read/Write Subsystem Read/Write Heads What are the services, factors, metrics and workloads on the different levels? Perf.Eval.&Benchmarking Stricker, Kurmann
13 Example Backup System Perf.Eval.&Benchmarking Stricker, Kurmann
14 Level of Detail: Level of detail in recording (and thus reproducing) the requests for a service: Most frequent request Frequency of request types Time-stamped sequence of requests (Trace) Average resource demand Distribution of resource demands Workload descriptions executable WL: trace of user commands non-executable WL: modeling, simulation Perf.Eval.&Benchmarking Stricker, Kurmann
15 Representativeness: Test WL should be representative of the real application. Three aspects that have to match: Arrival Rate: same or proportional Resource Demands: total demand Resource Usage Profile: e.g. important in multiprogramming environment Timeliness: WL should follow changes in usage pattern. demands and user behaviour change workloads have to change Example: SPEC 89,92,95, Problem: caches get bigger and bigger Perf.Eval.&Benchmarking Stricker, Kurmann
16 Other Considerations: Loading Level best case: full capacity typical case: real world worst case: beyond capacity Impact of External Components e.g. I/O in CPU benchmark Repeatability reproduction of results is mandatory when average, standard deviation Perf.Eval.&Benchmarking Stricker, Kurmann
CMSC 611: Advanced Computer Architecture
CMSC 611: Advanced Computer Architecture Performance Some material adapted from Mohamed Younis, UMBC CMSC 611 Spr 2003 course slides Some material adapted from Hennessy & Patterson / 2003 Elsevier Science
Lecture 3 Notes Topic: Benchmarks
Lecture 3 Notes Topic: Benchmarks What do you want in a benchmark? o benchmarks must be representative of actual workloads o first few computers were benchmarked based on how fast they could add/multiply
Lecture - 4. Measurement. Dr. Soner Onder CS 4431 Michigan Technological University 9/29/2009 1
Lecture - 4 Measurement Dr. Soner Onder CS 4431 Michigan Technological University 9/29/2009 1 Acknowledgements David Patterson Dr. Roger Kieckhafer 9/29/2009 2 Computer Architecture is Design and Analysis
Types of Workloads. Raj Jain Washington University in Saint Louis Saint Louis, MO These slides are available on-line at:
Types of Workloads Raj Jain Washington University in Saint Louis Saint Louis, MO 63130 Jain@cse.wustl.edu These slides are available on-line at: 4-1 Overview Terminology Test Workloads for Computer Systems
Measure, Report, and Summarize Make intelligent choices See through the marketing hype Key to understanding effects of underlying architecture
Chapter 2 Note: The slides being presented represent a mix. Some are created by Mark Franklin, Washington University in St. Louis, Dept. of CSE. Many are taken from the Patterson & Hennessy book, Computer
Computer Performance Evaluation: Cycles Per Instruction (CPI)
Computer Performance Evaluation: Cycles Per Instruction (CPI) Most computers run synchronously utilizing a CPU clock running at a constant clock rate: where: Clock rate = 1 / clock cycle A computer machine
Computer Systems Performance Analysis and Benchmarking (37-235)
Computer Systems Performance Analysis and Benchmarking (37-235) Analytic Modeling Simulation Measurements / Benchmarking Lecture by: Prof. Thomas Stricker Assignments/Projects: Christian Kurmann Textbook:
CpE 442 Introduction to Computer Architecture. The Role of Performance
CpE 442 Introduction to Computer Architecture The Role of Performance Instructor: H. H. Ammar CpE442 Lec2.1 Overview of Today s Lecture: The Role of Performance Review from Last Lecture Definition and
Reporting Performance Results
Reporting Performance Results The guiding principle of reporting performance measurements should be reproducibility - another experimenter would need to duplicate the results. However: A system s software
Performance evaluation and. INF5100 Autumn 2007 Jarle Søberg
Performance evaluation and benchmarking of DBMSs INF5100 Autumn 2007 Jarle Søberg Overview What is performance evaluation and benchmarking? Theory Examples Domain-specific benchmarks and benchmarking DBMSs
CMSC 611: Advanced Computer Architecture
CMSC 611: Advanced Computer Architecture Cost, Performance & Benchmarking Some material adapted from Mohamed Younis, UMBC CMSC 611 Spr 2003 course slides Some material adapted from David Culler, UC Berkeley
Performance evaluation and benchmarking of DBMSs. INF5100 Autumn 2009 Jarle Søberg
Performance evaluation and benchmarking of DBMSs INF5100 Autumn 2009 Jarle Søberg Overview What is performance evaluation and benchmarking? Theory Examples Domain-specific benchmarks and benchmarking DBMSs
Chapter 14 Performance and Processor Design
Chapter 14 Performance and Processor Design Outline 14.1 Introduction 14.2 Important Trends Affecting Performance Issues 14.3 Why Performance Monitoring and Evaluation are Needed 14.4 Performance Measures
Virtual memory why? Virtual memory parameters Compared to first-level cache Parameter First-level cache Virtual memory. Virtual memory concepts
Lecture 16 Virtual memory why? Virtual memory: Virtual memory concepts (5.10) Protection (5.11) The memory hierarchy of Alpha 21064 (5.13) Virtual address space proc 0? s space proc 1 Physical memory Virtual
Dell Guide to Server Benchmarks
Contents Introduction: Choosing a Benchmark 1 Important System Benchmark Quick Reference Chart by Application 3 4 TPC C 4 TPC H 5 TPC App 6 MMB3 7 SPEC CPU 8 SPECweb 9 SPECjbb 10 SPEC SFS 3.0 11 SPECjAppServer
Alpha AXP Workstation Family Performance Brief - OpenVMS
DEC 3000 Model 500 AXP Workstation DEC 3000 Model 400 AXP Workstation INSIDE Digital Equipment Corporation November 20, 1992 Second Edition EB-N0102-51 Benchmark results: SPEC LINPACK Dhrystone X11perf
Lecture 3: Evaluating Computer Architectures. How to design something:
Lecture 3: Evaluating Computer Architectures Announcements - (none) Last Time constraints imposed by technology Computer elements Circuits and timing Today Performance analysis Amdahl s Law Performance
ECE C61 Computer Architecture Lecture 2 performance. Prof. Alok N. Choudhary.
ECE C61 Computer Architecture Lecture 2 performance Prof Alok N Choudhary choudhar@ecenorthwesternedu 2-1 Today s s Lecture Performance Concepts Response Time Throughput Performance Evaluation Benchmarks
Computer Architecture
Computer Architecture Architecture The art and science of designing and constructing buildings A style and method of design and construction Design, the way components fit together Computer Architecture
Performance of computer systems
Performance of computer systems Many different factors among which: Technology Raw speed of the circuits (clock, switching time) Process technology (how many transistors on a chip) Organization What type
Page 1. Program Performance Metrics. Program Performance Metrics. Amdahl s Law. 1 seq seq 1
Program Performance Metrics The parallel run time (Tpar) is the time from the moment when computation starts to the moment when the last processor finished his execution The speedup (S) is defined as the
Performance, Cost and Amdahl s s Law. Arquitectura de Computadoras
Performance, Cost and Amdahl s s Law Arquitectura de Computadoras Arturo Díaz D PérezP Centro de Investigación n y de Estudios Avanzados del IPN adiaz@cinvestav.mx Arquitectura de Computadoras Performance-
MEASURING COMPUTER TIME. A computer faster than another? Necessity of evaluation computer performance
Necessity of evaluation computer performance MEASURING COMPUTER PERFORMANCE For comparing different computer performances User: Interested in reducing the execution time (response time) of a task. Computer
Benchmarking CPU Performance
Benchmarking CPU Performance Many benchmarks available MHz (cycle speed of processor) MIPS (million instructions per second) Peak FLOPS Whetstone Stresses unoptimized scalar performance, since it is designed
Which is the best? Measuring & Improving Performance (if planes were computers...) An architecture example
1 Which is the best? 2 Lecture 05 Performance Metrics and Benchmarking 3 Measuring & Improving Performance (if planes were computers...) Plane People Range (miles) Speed (mph) Avg. Cost (millions) Passenger*Miles
Dynamic Control Hazard Avoidance
Dynamic Control Hazard Avoidance Consider Effects of Increasing the ILP Control dependencies rapidly become the limiting factor they tend to not get optimized by the compiler more instructions/sec ==>
The Von Neumann Computer Model
The Von Neumann Computer Model Partitioning of the computing engine into components: Central Processing Unit (CPU): Control Unit (instruction decode, sequencing of operations), Datapath (registers, arithmetic
Performance COE 403. Computer Architecture Prof. Muhamed Mudawar. Computer Engineering Department King Fahd University of Petroleum and Minerals
Performance COE 403 Computer Architecture Prof. Muhamed Mudawar Computer Engineering Department King Fahd University of Petroleum and Minerals What is Performance? How do we measure the performance of
Ch. 7: Benchmarks and Performance Tests
Ch. 7: Benchmarks and Performance Tests Kenneth Mitchell School of Computing & Engineering, University of Missouri-Kansas City, Kansas City, MO 64110 Kenneth Mitchell, CS & EE dept., SCE, UMKC p. 1/3 Introduction
CSE4201 Instruction Level Parallelism. Branch Prediction
CSE4201 Instruction Level Parallelism Branch Prediction Prof. Mokhtar Aboelaze York University Based on Slides by Prof. L. Bhuyan (UCR) Prof. M. Shaaban (RIT) 1 Introduction With dynamic scheduling that
Engineering 9859 CoE Fundamentals Computer Architecture
Engineering 9859 CoE Fundamentals Computer Architecture Introduction Dennis Peters 1 Fall 2007 1 Based on notes from Dr. R. Venkatesan Course Details Classes Monday, Wednesday, Friday 9 10 EN-4033 Course
Designing for Performance. Patrick Happ Raul Feitosa
Designing for Performance Patrick Happ Raul Feitosa Objective In this section we examine the most common approach to assessing processor and computer system performance W. Stallings Designing for Performance
The character of the instruction scheduling problem
The character of the instruction scheduling problem Darko Stefanović Department of Computer Science University of Massachusetts March 997 Abstract Here I present some measurements that serve to characterize
Benchmarking CPU Performance. Benchmarking CPU Performance
Cluster Computing Benchmarking CPU Performance Many benchmarks available MHz (cycle speed of processor) MIPS (million instructions per second) Peak FLOPS Whetstone Stresses unoptimized scalar performance,
Chapter-5 Memory Hierarchy Design
Chapter-5 Memory Hierarchy Design Unlimited amount of fast memory - Economical solution is memory hierarchy - Locality - Cost performance Principle of locality - most programs do not access all code or
Instructor Information
CS 203A Advanced Computer Architecture Lecture 1 1 Instructor Information Rajiv Gupta Office: Engg.II Room 408 E-mail: gupta@cs.ucr.edu Tel: (951) 827-2558 Office Times: T, Th 1-2 pm 2 1 Course Syllabus
Assessing and Understanding Performance
Assessing and Understanding Performance This set of slides is based on Chapter 4, Assessing and Understanding Performance, of the book Computer Organization and Design by Patterson and Hennessy. Here are
Performance measurement. SMD149 - Operating Systems - Performance and processor design. Introduction. Important trends affecting performance issues
Performance measurement SMD149 - Operating Systems - Performance and processor design Roland Parviainen November 28, 2005 Performance measurement Motivation Techniques Common metrics Processor architectural
SPEC as a Performance
l l SPEC as a Performance Evaluation Measure Ran Giladi Ben-Gurion University of the Negev Niv Ahituv Tel-Aviv University P otential computer system users or buyers usually employ a computer performance
Measuring Performance. Speed-up, Amdahl s Law, Gustafson s Law, efficiency, benchmarks
Measuring Performance Speed-up, Amdahl s Law, Gustafson s Law, efficiency, benchmarks Why Measure Performance? Performance tells you how you are doing and whether things can be improved appreciably When
Dynamic Hardware Prediction. Basic Branch Prediction Buffers. N-bit Branch Prediction Buffers
Dynamic Hardware Prediction Importance of control dependences Branches and jumps are frequent Limiting factor as ILP increases (Amdahl s law) Schemes to attack control dependences Static Basic (stall the
Instruction Level Parallelism
Instruction Level Parallelism Software View of Computer Architecture COMP2 Godfrey van der Linden 200-0-0 Introduction Definition of Instruction Level Parallelism(ILP) Pipelining Hazards & Solutions Dynamic
Cache Performance! ! Memory system and processor performance:! ! Improving memory hierarchy performance:! CPU time = IC x CPI x Clock time
Cache Performance!! Memory system and processor performance:! CPU time = IC x CPI x Clock time CPU performance eqn. CPI = CPI ld/st x IC ld/st IC + CPI others x IC others IC CPI ld/st = Pipeline time +
This Unit. CIS 501 Computer Architecture. As You Get Settled. Readings. Metrics Latency and throughput. Reporting performance
This Unit CIS 501 Computer Architecture Metrics Latency and throughput Reporting performance Benchmarking and averaging Unit 2: Performance Performance analysis & pitfalls Slides developed by Milo Martin
Cluster Computing Paul A. Farrell 9/15/2011. Dept of Computer Science Kent State University 1. Benchmarking CPU Performance
Many benchmarks available MHz (cycle speed of processor) MIPS (million instructions per second) Peak FLOPS Whetstone Stresses unoptimized scalar performance, since it is designed to defeat any effort to
Computer Architecture. What is it?
Computer Architecture Venkatesh Akella EEC 270 Winter 2005 What is it? EEC270 Computer Architecture Basically a story of unprecedented improvement $1K buys you a machine that was 1-5 million dollars a
Chapter 17 Assessing Computer Performance
Chapter 17 Assessing Computer Performance Which of the world s computers is the fastest? This apparently silly question has been the fodder for many news reports, especially in the computer engineering
CMSC 411 Computer Systems Architecture Lecture 13 Instruction Level Parallelism 6 (Limits to ILP & Threading)
CMSC 411 Computer Systems Architecture Lecture 13 Instruction Level Parallelism 6 (Limits to ILP & Threading) Limits to ILP Conflicting studies of amount of ILP Benchmarks» vectorized Fortran FP vs. integer
Cache Performance! ! Memory system and processor performance:! ! Improving memory hierarchy performance:! CPU time = IC x CPI x Clock time
Cache Performance!! Memory system and processor performance:! CPU time = IC x CPI x Clock time CPU performance eqn. CPI = CPI ld/st x IC ld/st IC + CPI others x IC others IC CPI ld/st = Pipeline time +
Performance evaluation. Performance evaluation. CS/COE0447: Computer Organization. It s an everyday process
Performance evaluation It s an everyday process CS/COE0447: Computer Organization and Assembly Language Chapter 4 Sangyeun Cho Dept. of Computer Science When you buy food Same quantity, then you look at
A Performance Evaluation and Benchmarking Tool
A Performance Evaluation and Benchmarking Tool A Thesis Submitted in Partial Fulfillment of the Requirements for the Degree of Master of Technology by Atul Kumar to the Department of Computer Science &
CS252 S05. Outline. Dynamic Branch Prediction. Static Branch Prediction. Dynamic Branch Prediction. Dynamic Branch Prediction
Outline CMSC Computer Systems Architecture Lecture 9 Instruction Level Parallelism (Static & Dynamic Branch ion) ILP Compiler techniques to increase ILP Loop Unrolling Static Branch ion Dynamic Branch
UCB CS61C : Machine Structures
inst.eecs.berkeley.edu/~cs61c UCB CS61C : Machine Structures Lecture 36 Performance 2010-04-23 Lecturer SOE Dan Garcia How fast is your computer? Every 6 months (Nov/June), the fastest supercomputers in
Lecture 19: Memory Hierarchy Five Ways to Reduce Miss Penalty (Second Level Cache) Admin
Lecture 19: Memory Hierarchy Five Ways to Reduce Miss Penalty (Second Level Cache) Professor Alvin R. Lebeck Computer Science 220 Fall 1999 Exam Average 76 90-100 4 80-89 3 70-79 3 60-69 5 < 60 1 Admin
The Role of Performance
Orange Coast College Business Division Computer Science Department CS 116- Computer Architecture The Role of Performance What is performance? A set of metrics that allow us to compare two different hardware
Chapter 1. Instructor: Josep Torrellas CS433. Copyright Josep Torrellas 1999, 2001, 2002,
Chapter 1 Instructor: Josep Torrellas CS433 Copyright Josep Torrellas 1999, 2001, 2002, 2013 1 Course Goals Introduce you to design principles, analysis techniques and design options in computer architecture
How to Write Fast Numerical Code Spring 2011 Lecture 7. Instructor: Markus Püschel TA: Georg Ofenbeck
How to Write Fast Numerical Code Spring 2011 Lecture 7 Instructor: Markus Püschel TA: Georg Ofenbeck Last Time: Locality Temporal and Spatial memory memory Last Time: Reuse FFT: O(log(n)) reuse MMM: O(n)
Memory Hierarchy 3 Cs and 6 Ways to Reduce Misses
Memory Hierarchy 3 Cs and 6 Ways to Reduce Misses Soner Onder Michigan Technological University Randy Katz & David A. Patterson University of California, Berkeley Four Questions for Memory Hierarchy Designers
Overview of Today s Lecture: Cost & Price, Performance { 1+ Administrative Matters Finish Lecture1 Cost and Price Add/Drop - See me after class
Overview of Today s Lecture: Cost & Price, Performance EE176-SJSU Computer Architecture and Organization Lecture 2 Administrative Matters Finish Lecture1 Cost and Price Add/Drop - See me after class EE176
Performance, Power, Die Yield. CS301 Prof Szajda
Performance, Power, Die Yield CS301 Prof Szajda Administrative HW #1 assigned w Due Wednesday, 9/3 at 5:00 pm Performance Metrics (How do we compare two machines?) What to Measure? Which airplane has the
HOT CHIPS II 1990 Symposium on High Performance Chips The SPARC Lightning Processor. Lightning Project A Superscalar+ SPARC Microprocessor
I'Ḷ } HOT CHIPS II 1990 Symposium on High Performance Chips The SPARC Lightning Processor Lightning Project A Superscalar+ SPARC Microprocessor Based on Metaflow architecture from Metaflow Technologies,
Hardware Speculation Support
Hardware Speculation Support Conditional instructions Most common form is conditional move BNEZ R1, L ;if MOV R2, R3 ;then CMOVZ R2,R3, R1 L: ;else Other variants conditional loads and stores nullification
CSE 141 Computer Architecture Summer Session Lecture 2 Performance, ALU. Pramod V. Argade
CSE 141 Computer Architecture Summer Session 1 24 Lecture 2 Performance, ALU Pramod V. Argade CSE141: Introduction to Computer Architecture Instructor: TA: Pramod V. Argade (p2argade@cs.ucsd.edu) Office
CPE300: Digital System Architecture and Design
CPE300: Digital System Architecture and Design Fall 2011 MW 17:30-18:45 CBC C316 Number Representation 09212011 http://www.egr.unlv.edu/~b1morris/cpe300/ 2 Outline Recap Logic Circuits for Register Transfer
Java Performance Analysis for Scientific Computing
Java Performance Analysis for Scientific Computing Roldan Pozo Leader, Mathematical Software Group National Institute of Standards and Technology USA UKHEC: Java for High End Computing Nov. 20th, 2000
Quantifying Performance EEC 170 Fall 2005 Chapter 4
Quantifying Performance EEC 70 Fall 2005 Chapter 4 Performance Measure, Report, and Summarize Make intelligent choices See through the marketing hype Key to understanding underlying organizational motivation
Administrivia. CMSC 411 Computer Systems Architecture Lecture 14 Instruction Level Parallelism (cont.) Control Dependencies
Administrivia CMSC 411 Computer Systems Architecture Lecture 14 Instruction Level Parallelism (cont.) HW #3, on memory hierarchy, due Tuesday Continue reading Chapter 3 of H&P Alan Sussman als@cs.umd.edu
CS3350B Computer Architecture CPU Performance and Profiling
CS3350B Computer Architecture CPU Performance and Profiling Marc Moreno Maza http://www.csd.uwo.ca/~moreno/cs3350_moreno/index.html Department of Computer Science University of Western Ontario, Canada
Appendix C. Authors: John Hennessy & David Patterson. Copyright 2011, Elsevier Inc. All rights Reserved. 1
Appendix C Authors: John Hennessy & David Patterson Copyright 2011, Elsevier Inc. All rights Reserved. 1 Figure C.2 The pipeline can be thought of as a series of data paths shifted in time. This shows
ECE 486/586. Computer Architecture. Lecture # 3
ECE 486/586 Computer Architecture Lecture # 3 Spring 2014 Portland State University Lecture Topics Measuring, Reporting and Summarizing Performance Execution Time and Throughput Benchmarks Comparing and
Improving Cache Performance. Dr. Yitzhak Birk Electrical Engineering Department, Technion
Improving Cache Performance Dr. Yitzhak Birk Electrical Engineering Department, Technion 1 Cache Performance CPU time = (CPU execution clock cycles + Memory stall clock cycles) x clock cycle time Memory
Introduction to Scientific Computing Languages
1 / 1 Introduction to Scientific Computing Languages Prof. Paolo Bientinesi pauldj@aices.rwth-aachen.de Languages for Scientific Computing 2 / 1 What is a programming language? Languages for Scientific
Lecture 7 Instruction Level Parallelism (5) EEC 171 Parallel Architectures John Owens UC Davis
Lecture 7 Instruction Level Parallelism (5) EEC 171 Parallel Architectures John Owens UC Davis Credits John Owens / UC Davis 2007 2009. Thanks to many sources for slide material: Computer Organization
Lecture 10: Floating Point, Digital Design
Lecture 10: Floating Point, Digital Design Today s topics: FP arithmetic Intro to Boolean functions 1 Examples Final representation: (-1) S x (1 + Fraction) x 2 (Exponent Bias) Represent -0.75 ten in single
Fundamentals of Quantitative Design and Analysis
Fundamentals of Quantitative Design and Analysis Dr. Jiang Li Adapted from the slides provided by the authors Computer Technology Performance improvements: Improvements in semiconductor technology Feature
IBM. IBM ^ pseries, IBM RS/6000 and IBM NUMA-Q Performance Report
IBM IBM ^ pseries, IBM RS/6000 and IBM NUMA-Q Performance Report October 7, Table of Contents PERFORMANCE of IBM WEB SERVER SYSTEMS... 3 Section - and LINPACK PERFORMANCE... RS/6000 SP s... 4 Section a
Introduction to Scientific Computing Languages
1 / 17 Introduction to Scientific Computing Languages Prof. Paolo Bientinesi pauldj@aices.rwth-aachen.de Languages for Scientific Computing 2 / 17 What is a programming language? Languages for Scientific
Combining Branch Predictors
Combining Branch Predictors Scott McFarling June 1993 d i g i t a l Western Research Laboratory 250 University Avenue Palo Alto, California 94301 USA Abstract One of the key factors determining computer
Course web site: teaching/courses/car. Piazza discussion forum:
Announcements Course web site: http://www.inf.ed.ac.uk/ teaching/courses/car Lecture slides Tutorial problems Courseworks Piazza discussion forum: http://piazza.com/ed.ac.uk/spring2018/car Tutorials start
Review Tomasulo. Lecture 17: ILP and Dynamic Execution #2: Branch Prediction, Multiple Issue. Tomasulo Algorithm and Branch Prediction
CS252 Graduate Computer Architecture Lecture 17: ILP and Dynamic Execution #2: Branch Prediction, Multiple Issue March 23, 01 Prof. David A. Patterson Computer Science 252 Spring 01 Review Tomasulo Reservations
CSE 141 Computer Architecture Summer Session I, Lecture 3 Performance and Single Cycle CPU Part 1. Pramod V. Argade
CSE 141 Computer Architecture Summer Session I, 2005 Lecture 3 Performance and Single Cycle CPU Part 1 Pramod V. Argade CSE141: Introduction to Computer Architecture Instructor: Pramod V. Argade (p2argade@cs.ucsd.edu)
The bottom line: Performance. Measuring and Discussing Computer System Performance. Our definition of Performance. How to measure Execution Time?
The bottom line: Performance Car to Bay Area Speed Passengers Throughput (pmph) Ferrari 3.1 hours 160 mph 2 320 Measuring and Discussing Computer System Performance Greyhound 7.7 hours 65 mph 60 3900 or
Algorithms and Data Structures, or
Algorithms and Data Structures, or... Classical Algorithms of the 50s, 60s and 70s Mary Cryan A&DS Lecture 1 1 Mary Cryan Our focus Emphasis is Algorithms ( Data Structures less important). Most of the
Lecture 10: Floating Point, Digital Design
Lecture 10: Floating Point, Digital Design Today s topics: FP arithmetic Intro to Boolean functions 1 Examples Final representation: (-1) S x (1 + Fraction) x 2 (Exponent Bias) Represent -0.75 ten in single
Center for Scalable Application Development Software (CScADS): Automatic Performance Tuning Workshop
Center for Scalable Application Development Software (CScADS): Automatic Performance Tuning Workshop http://cscads.rice.edu/ Discussion and Feedback CScADS Autotuning 07 Top Priority Questions for Discussion
CS422 Computer Architecture
CS422 Computer Architecture Spring 2004 Lecture 17, 26 Feb 2004 Bhaskaran Raman Department of CSE IIT Kanpur http://web.cse.iitk.ac.in/~cs422/index.html Speculation Wish to move instructions across branches
Matrix Multiplication
Matrix Multiplication CPS343 Parallel and High Performance Computing Spring 2013 CPS343 (Parallel and HPC) Matrix Multiplication Spring 2013 1 / 32 Outline 1 Matrix operations Importance Dense and sparse
i960 Microprocessor Performance Brief October 1998 Order Number:
Performance Brief October 1998 Order Number: 272950-003 Information in this document is provided in connection with Intel products. No license, express or implied, by estoppel or otherwise, to any intellectual
Spring 2009 Prof. Hyesoon Kim
Spring 2009 Prof. Hyesoon Kim Benchmarking is critical to make a design decision and measuring performance Performance evaluations: Design decisions Earlier time : analytical based evaluations From 90
CMSC 313 Lecture 27. System Performance CPU Performance Disk Performance. Announcement: Don t use oscillator in DigSim3
System Performance CPU Performance Disk Performance CMSC 313 Lecture 27 Announcement: Don t use oscillator in DigSim3 UMBC, CMSC313, Richard Chang Bottlenecks The performance of a process
EEMBC FPMARK THE EMBEDDED INDUSTRY S FIRST STANDARDIZED FLOATING-POINT BENCHMARK SUITE
EEMBC FPMARK THE EMBEDDED INDUSTRY S FIRST STANDARDIZED FLOATING-POINT BENCHMARK SUITE Supporting Both Single- and Double-Precision Floating-Point Performance Quick Background: Industry-Standard Benchmarks
CISC 662 Graduate Computer Architecture Lecture 18 - Cache Performance. Why More on Memory Hierarchy?
CISC 662 Graduate Computer Architecture Lecture 18 - Cache Performance Michela Taufer Powerpoint Lecture Notes from John Hennessy and David Patterson s: Computer Architecture, 4th edition ---- Additional
Lecture 9: Case Study MIPS R4000 and Introduction to Advanced Pipelining Professor Randy H. Katz Computer Science 252 Spring 1996
Lecture 9: Case Study MIPS R4000 and Introduction to Advanced Pipelining Professor Randy H. Katz Computer Science 252 Spring 1996 RHK.SP96 1 Review: Evaluating Branch Alternatives Two part solution: Determine
Integrated Device Technology RISController and CPU Performance Report September 1997
Integrated Device Technology, Inc. Integrated Device Technology RISController and CPU Performance Report September 1997 September 1, 1997 2975 Stender Way, Santa Clara, California 95054 Telephone: (800)
The Impact of Write Back on Cache Performance
The Impact of Write Back on Cache Performance Daniel Kroening and Silvia M. Mueller Computer Science Department Universitaet des Saarlandes, 66123 Saarbruecken, Germany email: kroening@handshake.de, smueller@cs.uni-sb.de,
Workload Characterization Techniques
Workload Characterization Techniques Raj Jain Washington University in Saint Louis Saint Louis, MO 63130 Jain@cse.wustl.edu These slides are available on-line at: http://www.cse.wustl.edu/~jain/cse567-08/
NOW Handout Page # Why More on Memory Hierarchy? CISC 662 Graduate Computer Architecture Lecture 18 - Cache Performance
CISC 66 Graduate Computer Architecture Lecture 8 - Cache Performance Michela Taufer Performance Why More on Memory Hierarchy?,,, Processor Memory Processor-Memory Performance Gap Growing Powerpoint Lecture
Performance. CS 3410 Computer System Organization & Programming. [K. Bala, A. Bracy, E. Sirer, and H. Weatherspoon]
![Performance. CS 3410 Computer System Organization & Programming. [K. Bala, A. Bracy, E. Sirer, and H. Weatherspoon]](/thumbs/93/113797768.jpg "Performance. CS 3410 Computer System Organization & Programming. [K. Bala, A. Bracy, E. Sirer, and H. Weatherspoon]")
Performance CS 3410 Computer System Organization & Programming [K. Bala, A. Bracy, E. Sirer, and H. Weatherspoon] Performance Complex question How fast is the processor? How fast your application runs?
Quantitative study of data caches on a multistreamed architecture. Abstract
Quantitative study of data caches on a multistreamed architecture Mario Nemirovsky University of California, Santa Barbara mario@ece.ucsb.edu Abstract Wayne Yamamoto Sun Microsystems, Inc. wayne.yamamoto@sun.com
How to Write Fast Numerical Code Spring 2012 Lecture 9. Instructor: Markus Püschel TAs: Georg Ofenbeck & Daniele Spampinato
How to Write Fast Numerical Code Spring 2012 Lecture 9 Instructor: Markus Püschel TAs: Georg Ofenbeck & Daniele Spampinato Today Linear algebra software: history, LAPACK and BLAS Blocking (BLAS 3): key