Performance Enhancement. Performance Enhancement Calculations: Amdahl's Law The performance enhancement possible due to a given design improvement is.

Slides:

Advertisements

Similar presentations

Computer Organization Lab 1 Soufiane berouel. Formulas to Remember CPU Time = CPU Clock Cycles x Clock Cycle Time CPU Clock Cycles = Instruction Count.

Advertisements

Performance Evaluation of Architectures Vittorio Zaccaria.

100 Performance ENGR 3410 – Computer Architecture Mark L. Chang Fall 2006.

Computer Organization and Architecture 18 th March, 2008.

CSCE 212 Chapter 4: Assessing and Understanding Performance Instructor: Jason D. Bakos.

CIS429.S00: Lec3 - 1 CPU Time Analysis Terminology IC = instruction count = number of instructions in the program CPI = cycles per instruction (varies.

ENGS 116 Lecture 21 Performance and Quantitative Principles Vincent H. Berk September 26 th, 2008 Reading for today: Chapter , Amdahl article.

CPU Performance Evaluation: Cycles Per Instruction (CPI)

CSCE 212 Quiz 4 – 2/16/11 *Assume computes take 1 clock cycle, loads and stores take 10 cycles and branches take 4 cycles and that they are running on.

EECC550 - Shaaban #1 Lec # 3 Spring Computer Performance Evaluation: Cycles Per Instruction (CPI) Most computers run synchronously utilizing.

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

Performance D. A. Patterson and J. L. Hennessey, Computer Organization & Design: The Hardware Software Interface, Morgan Kauffman, second edition 1998.

Computer Performance Evaluation: Cycles Per Instruction (CPI)

Multicycle Review Performance Examples. Single Cycle MIPS Implementation All instructions take the same amount of time Signals propagate along longest.

CIS429.S00: Lec2- 1 Performance Overview Execution time is the best measure of performance: simple, intuitive, straightforward. Two important quantitative.

EECC550 - Shaaban #1 Lec # 3 Winter CPU Performance Evaluation: Cycles Per Instruction (CPI) Most computers run synchronously utilizing.

Computer Architecture Lecture 2 Instruction Set Principles.

The Von Neumann Computer Model

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

Performance ICS 233 Computer Architecture and Assembly Language Dr. Aiman El-Maleh College of Computer Sciences and Engineering King Fahd University of.

1 Measuring Performance Chris Clack B261 Systems Architecture.

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

KEY COMPONENTS OF A COMPUTER SYSTEM ANDREW LOLAVAR.

Lecture 2: Computer Performance

Memory/Storage Architecture Lab Computer Architecture Performance.

Operation Frequency No. of Clock cycles ALU ops % 1 Loads 25% 2

B0111 Performance Anxiety ENGR xD52 Eric VanWyk Fall 2012.

PerformanceCS510 Computer ArchitecturesLecture Lecture 3 Benchmarks and Performance Metrics Lecture 3 Benchmarks and Performance Metrics.

1 Acknowledgements Class notes based upon Patterson & Hennessy: Book & Lecture Notes Patterson’s 1997 course notes (U.C. Berkeley CS 152, 1997) Tom Fountain.

Compiled by Maria Ramila Jimenez

CDA 3101 Discussion Section 09 CPU Performance. Question 1 Suppose you wish to run a program P with 7.5 * 10 9 instructions on a 5GHz machine with a CPI.

1. 2 Table 4.1 Key characteristics of six passenger aircraft: all figures are approximate; some relate to a specific model/configuration of the aircraft.

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

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 – Last Lecture Bottom line performance measure is time Performance A = 1/Execution Time A Comparing Performance N = Performance A / Performance.

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

Computer Architecture CPSC 350

CPU Performance using Different Parameters CS 250: Andrei D. Coronel, MS,CEH,PhD Cand.

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.

Review Introduction to Computer System, Fall (PPI, FDU)

Performance – Last Lecture Bottom line performance measure is time Performance A = 1/Execution Time A Comparing Performance N = Performance A / Performance.

Computer Engineering Rabie A. Ramadan Lecture 2. Table of Contents 2 Architecture Development and Styles Performance Measures Amdahl’s Law.

Performance 9 ways to fool the public Old Chapter 4 New Chapter 1.4.

Amdahl’s Law CPS 5401 Fall 2013 Shirley Moore

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.

Intro to Computer Org. Assessing Performance. What Is Performance? What do we mean when we talk about the “performance” of a CPU?

BITS Pilani, Pilani Campus Today’s Agenda Role of Performance.

Performance 9 ways to fool the public #1 – Reporting Results.

תרגול מס' 1: פרמטרים של הערכת ביצועים חוק אמדל

CpE 442 Introduction to Computer Architecture The Role of Performance

Two notions of performance

Performance Performance The CPU Performance Equation:

Defining Performance Which airplane has the best performance?

CSCE 212 Chapter 4: Assessing and Understanding Performance

Computer Architecture CSCE 350

Chapter 1 Fundamentals of Computer Design

CS2100 Computer Organisation

Performance COE 301 Computer Organization

Defining Performance Section /14/2018 9:52 PM.

CS170 Computer Organization and Architecture I

CMSC 611: Advanced Computer Architecture

Performance Cycle time of a computer CPU speed speed = 1 / cycle time

August 30, 2000 Prof. John Kubiatowicz

CMSC 611: Advanced Computer Architecture

Parameters that affect it How to improve it and by how much

Single Cycle MIPS Implementation

Presentation transcript:

Performance Enhancement

Performance Enhancement Calculations: Amdahl's Law The performance enhancement possible due to a given design improvement is limited by the amount that the improved feature is used Amdahl’s Law: Performance improvement or speedup due to enhancement E: Execution Time without E Performance with E Speedup(E) = = Execution Time with E Performance without E – Suppose that enhancement E accelerates a fraction F of the execution time by a factor S and the remainder of the time is unaffected then: Execution Time with E = ((1-F) + F/S) X Execution Time without E Hence speedup is given by: Execution Time without E 1 Speedup(E) = = ((1 - F) + F/S) X Execution Time without E (1 - F) + F/S

Pictorial Depiction of Amdahl’s Law Before: Execution Time without enhancement E: Unaffected, fraction: (1- F) After: Execution Time with enhancement E: Enhancement E accelerates fraction F of execution time by a factor of S Affected fraction: F Unaffected, fraction: (1- F) F/S Unchanged Execution Time without enhancement E 1 Speedup(E) = = Execution Time with enhancement E (1 - F) + F/S

Performance Enhancement Example For the RISC machine with the following instruction mix given earlier: Op FreqCyclesCPI(i)% Time ALU 50% % Load 20% % Store 10% % Branch 20% % If a CPU design enhancement improves the CPI of load instructions from 5 to 2, what is the resulting performance improvement from this enhancement: Fraction enhanced = F = 45% or.45 Unaffected fraction = 100% - 45% = 55% or.55 Factor of enhancement = 5/2 = 2.5 Using Amdahl’s Law: 1 1 Speedup(E) = = = 1.37 (1 - F) + F/S /2.5 CPI = 2.2

An Alternative Solution Using CPU Equation Op FreqCyclesCPI(i)% Time ALU 50% % Load 20% % Store 10% % Branch 20% % If a CPU design enhancement improves the CPI of load instructions from 5 to 2, what is the resulting performance improvement from this enhancement: Old CPI = 2.2 New CPI =.5 x x x x 2 = 1.6 Original Execution Time Instruction count x old CPI x clock cycle Speedup(E) = = New Execution Time Instruction count x new CPI x clock cycle old CPI 2.2 = = = 1.37 new CPI 1.6 Which is the same speedup obtained from Amdahl’s Law in the first solution. CPI = 2.2