1 Introduction Background: CS 3810 or equivalent, based on Hennessy and Patterson’s Computer Organization and Design Text for CS/EE 5810/6810: Hennessy.

Slides:

Advertisements

Similar presentations

1 Lecture 2: Metrics to Evaluate Performance Topics: Benchmark suites, Performance equation, Summarizing performance with AM, GM, HM Video 1: Using AM.

Advertisements

11 Measuring performance Kosarev Nikolay MIPT Feb, 2010.

Performance Analysis of Multiprocessor Architectures

Lecture 7: 9/17/2002CS170 Fall CS170 Computer Organization and Architecture I Ayman Abdel-Hamid Department of Computer Science Old Dominion University.

Lecture 2c: Benchmarks. Benchmarking Benchmark is a program that is run on a computer to measure its performance and compare it with other machines Best.

1 Introduction Background: CS 3810 or equivalent, based on Hennessy and Patterson’s Computer Organization and Design Text for CS/EE 6810: Hennessy and.

1 Lecture 2: System Metrics and Pipelining Today’s topics: (Sections 1.5 – 1.10)  Power/Energy examples  Performance summaries  Measuring cost and dependability.

CIS629 Fall Lecture Performance Overview Execution time is the best measure of performance: simple, intuitive, straightforward. Two important.

1 Lecture 2: System Metrics and Pipelining Today’s topics: (Sections 1.6, 1.7, 1.9, A.1)  Quantitative principles of computer design  Measuring cost.

1 Lecture 2: System Metrics and Pipelining Today’s topics: (Sections 1.6, 1.7, 1.9, A.1)  Performance summaries  Quantitative principles of computer.

Computer ArchitectureFall 2007 © September 17, 2007 Karem Sakallah CS-447– Computer Architecture.

1 Lecture 11: Digital Design Today’s topics:  Evaluating a system  Intro to boolean functions.

1 Introduction Background: CS 3810 or equivalent, based on Hennessy and Patterson’s Computer Organization and Design Text for CS/EE 6810: Hennessy and.

Chapter 4 Assessing and Understanding Performance

Slide 1 Motivations and Introduction Phenomenal growth in computer industry/technology: X2/18mo in 20yr.  multi-GFLOPs processors, largely due to –Micro-electronics.

1 Lecture 1: CS/ECE 3810 Introduction Today’s topics:  logistics  why computer organization is important  modern trends.

1 Introduction Background: CS 3810 or equivalent, based on Hennessy and Patterson’s Computer Organization and Design Text for CS/EE 6810: Hennessy and.

1 Lecture 10: FP, Performance Metrics Today’s topics:  IEEE 754 representations  FP arithmetic  Evaluating a system Reminder: assignment 4 due in a.

1 Lecture 2: Measuring Performance/Cost/Power Today’s topics: (Sections 1.6, 1.4, 1.7, 1.8)  Quantitative principles of computer design  Measuring cost.

CIS429/529 Winter 07 - Performance - 1 Performance Overview Execution time is the best measure of performance: simple, intuitive, straightforward. Two.

Rung-Bin Lin Chapter 1: Fundamental of Computer Design1-1 Chapter 1. Fundamentals of Computer Design Introduction –Performance Improvement due to (1).

Introduction to Computer Architecture SCHOOL OF ELECTRICAL AND COMPUTER ENGINEERING SUMMER 2015 RAMYAR SAEEDI.

1 Lecture 2: Metrics to Evaluate Systems Topics: Power and technology trends wrap-up, benchmark suites, performance equation, summarizing performance with.

CMSC 611: Advanced Computer Architecture Benchmarking Some material adapted from Mohamed Younis, UMBC CMSC 611 Spr 2003 course slides Some material adapted.

Lecture 2: Technology Trends and Performance Evaluation Performance definition, benchmark, summarizing performance, Amdahl’s law, and CPI.

BİL 221 Bilgisayar Yapısı Lab. – 1: Benchmarking.

Memory/Storage Architecture Lab Computer Architecture Performance.

Recap Technology trends Cost/performance Measuring and Reporting Performance What does it mean to say “computer X is faster than computer Y”? E.g. Machine.

Ch1. Fundamentals of Computer Design 2. Performance ECE562/468 Advanced Computer Architecture Prof. Honggang Wang ECE Department University of Massachusetts.

1 Cpt_S 260: Lecture 1: Introduction This week’s topics:  logistics  information technology trends (new applications)  why computer architecture? 

1 Recap (from Previous Lecture). 2 Computer Architecture Computer Architecture involves 3 inter- related components – Instruction set architecture (ISA):

1 CS/EE 6810: Computer Architecture Class format:  Most lectures on YouTube *BEFORE* class  Use class time for discussions, clarifications, problem-solving,

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.

Advanced Computer Architecture Fundamental of Computer Design Instruction Set Principles and Examples Pipelining:Basic and Intermediate Concepts Memory.

From lecture slides for Computer Organization and Architecture: Designing for Performance, Eighth Edition, Prentice Hall, 2010 CS 211: Computer Architecture.

1 CS/COE0447 Computer Organization & Assembly Language CHAPTER 4 Assessing and Understanding Performance.

1 Seoul National University Performance. 2 Performance Example Seoul National University Sonata Boeing 727 Speed 100 km/h 1000km/h Seoul to Pusan 10 hours.

Performance Lecture notes from MKP, H. H. Lee and S. Yalamanchili.

CEN 316 Computer Organization and Design Assessing and Understanding Performance Mansour AL Zuair.

CPE 432 Computer Design Introduction Dr. Gheith Abandah.

CMSC 611: Advanced Computer Architecture Benchmarking Some material adapted from Mohamed Younis, UMBC CMSC 611 Spr 2003 course slides Some material adapted.

Computer Organization (1) تنظيم الحاسبات (1)

1 Lecture 2: Performance, MIPS ISA Today’s topics:  Performance equations  MIPS instructions Reminder: canvas and class webpage:

4. Performance 4.1 Introduction 4.2 CPU Performance and Its Factors

1 Lecture: Metrics to Evaluate Performance Topics: Benchmark suites, Performance equation, Summarizing performance with AM, GM, HM  Video 1: Using AM.

1 Lecture 2: Metrics to Evaluate Systems Topics: Metrics: power, reliability, cost, benchmark suites, performance equation, summarizing performance with.

CMSC 611: Advanced Computer Architecture Performance & Benchmarks Some material adapted from Mohamed Younis, UMBC CMSC 611 Spr 2003 course slides Some.

Jan. 5, 2000Systems Architecture II1 Machine Organization (CS 570) Lecture 2: Performance Evaluation and Benchmarking * Jeremy R. Johnson Wed. Oct. 4,

CPE432: Computer Design Course Introduction Dr. Gheith Abandah د. غيث علي عبندة.

CS203 – Advanced Computer Architecture Performance Evaluation.

VU-Advanced Computer Architecture Lecture 1-Introduction 1 Advanced Computer Architecture CS 704 Advanced Computer Architecture Lecture 1.

1 Lecture: Benchmarks, Pipelining Intro Topics: Performance equations wrap-up, Intro to pipelining.

June 20, 2001Systems Architecture II1 Systems Architecture II (CS ) Lecture 1: Performance Evaluation and Benchmarking * Jeremy R. Johnson Wed.

ENG3380 Computer Organization

CS203 – Advanced Computer Architecture

Lecture 2: Performance Today’s topics:

Lecture 2: Performance Evaluation

4- Performance Analysis of Parallel Programs

CMSC 611 Advanced Computer Arch.

T Computer Architecture, Autumn 2005

Advanced Operating Systems – Fall 2009

CS/EE 6810: Computer Architecture

ENG3380 Computer Organization

CMSC 611 Advanced Computer Arch.

Computer Evolution and Performance

Performance of computer systems

CS 704 Advanced Computer Architecture

Lecture 1 Class Overview

Presentation transcript:

1 Introduction Background: CS 3810 or equivalent, based on Hennessy and Patterson’s Computer Organization and Design Text for CS/EE 5810/6810: Hennessy and Patterson’s Computer Architecture, A Quantitative Approach, 3 rd Edition Topics  Measuring performance/cost/power  Designing instruction sets  Instruction level parallelism, dynamic and static  Memory hierarchy  Multiprocessors  Storage systems and networks

2 Organizational Issues Office hours, MEB 3124, by appointment TA: Naveen Muralimanohar, naveen, office hrs: TBA Special accommodations, add/drop policies (see class webpage ) Please sign up for the class mailing list (cs6810) Grades:  Two midterms, 25% each  Homework assignments, 50%, you may skip one  No tolerance for cheating

3 Lecture 1: Measuring Performance How do we conclude that System-A is “better” than System-B? Topics: (Sections 1.1, 1.2, 1.5, 1.6)  Metrics for different market segments  Benchmarks to measure performance  Quantitative principles of computer design

4 Microprocessor Performance 15x performance growth can be attributed to architectural innovations

5 Evolution of Computing Mainframes (1960s)  Minicomputers (1970s)  Desktop PCs (1980s)  Handheld devices (1990s) Today, there are three major microprocessor market segments: desktop, servers, embedded  Different applications  Different requirements  Different architectures

6 Characteristics of Each Segment Desktop: Need high performance (graphics performance?) and low price Servers: Need high throughput, availability (revenue losses of $14K-$6.5M per hour of downtime), scalability Embedded: Need low power, low cost, low memory (almost don’t care for performance, except real-time constraints) FeatureDesktopServerEmbedded System price$ $10,000$10,000 - $10,000,000$10 - $100,000 Processor price$100 - $1000$200 - $2000$ $200 Design issuesPrice-perf, graphicsThruput, availability, scalability Price, power, app-specific performance

7 Benchmark Suites Standard Performance Evaluation Corporation (SPEC)  CPU2000 (integer and floating-point applications for desktops and servers) stresses CPU and memory, little I/O  SPECviewperf and SPECapc for graphics applications  SPECSFS for file systems, SPECWeb for web servers (to stress disk and network I/O) Transaction Processing Council suites measure throughputs for database transactions Five EEMBC benchmark classes for embedded apps: automotive/industrial, consumer, networking, office automation, telecommunications

8 Summarizing Performance Consider 25 programs from a benchmark set – how do we capture the behavior of all 25 programs with a single number? P1 P2 P3 Sys-A Sys-B Sys-C  Total (average) execution time  Total (average) weighted execution time  Average of normalized execution times  Geometric mean of normalized execution times

9 Normalized Execution Times Advantage of GM: no reference machine required Disadvantage of GM: does not represent any “real entity” and may not accurately predict performance Disadvantage of AM of normalized: need weights (which may change over time) Advantage: can represent a real workload

10 GM Example Computer-A Computer-B Computer-C P1 1 sec 10 secs 20 secs P secs 100 secs 20 secs Conclusion with GMs: (i) A=B (ii) C is ~1.6 times faster For (i) to be true, P1 must occur 100 times for every occurrence of P2 With the above assumption, (ii) is no longer true Hence, GM can lead to inconsistencies

11 Title Bullet