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

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

Cache Performance 1 Computer Organization II © CS:APP & McQuain Cache Memory and Performance Many of the following slides are taken with.

Quiz 4 Solution. n Frequency = 2.5GHz, CLK = 0.4ns n CPI = 0.4, 30% loads and stores, n L1 hit =0, n L1-ICACHE : 2% miss rate, 32-byte blocks n L1-DCACHE.

Cache Here we focus on cache improvements to support at least 1 instruction fetch and at least 1 data access per cycle – With a superscalar, we might need.

Performance Evaluation of Architectures Vittorio Zaccaria.

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

Chapter 1 CSF 2009 Computer Performance. Defining Performance Which airplane has the best performance? Chapter 1 — Computer Abstractions and Technology.

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.

9/16/2004Comp 120 Fall September 16 Assignment 4 due date pushed back to 23 rd, better start anywayAssignment 4 due date pushed back to 23 rd, better.

Assessing and Understanding Performance B. Ramamurthy Chapter 4.

Computer Architecture Lecture 2 Instruction Set Principles.

Review for Midterm 2 CPSC 321 Computer Architecture Andreas Klappenecker.

Fall 2001CS 4471 Chapter 2: Performance CS 447 Jason Bakos.

Lecture 32: Chapter 5 Today’s topic –Cache performance assessment –Associative caches Reminder –HW8 due next Friday 11/21/2014 –HW9 due Wednesday 12/03/2014.

Princess Sumaya Univ. Computer Engineering Dept. د. بســام كحـالــه Dr. Bassam Kahhaleh.

CPU Performance Assessment As-Bahiya Abu-Samra *Moore’s Law *Clock Speed *Instruction Execution Rate - MIPS - MFLOPS *SPEC Speed Metric *Amdahl’s.

Chapter 1 Section 1.4 Dr. Iyad F. Jafar Evaluating 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.

CDA 3101 Fall 2013 Introduction to Computer Organization Computer Performance 28 August 2013.

CS1104 – Computer Organization PART 2: Computer Architecture Lecture 12 Overview and Concluding Remarks.

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

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.

Computer Organization and Architecture Tutorial 1 Kenneth Lee.

Computer Performance Computer Engineering Department.

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

Computer Architecture Ch5-1 Ping-Liang Lai ( 賴秉樑 ) Lecture 5 Review of Memory Hierarchy (Appendix C in textbook) Computer Architecture 計算機結構.

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

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

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.

Software School, Fudan University 2015 The Role of Performance To tell which system is faster.

Computer Organization CS224 Fall 2012 Lessons 41 & 42.

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

Lec2.1 Computer Architecture Chapter 2 The Role of Performance.

EGRE 426 Computer Organization and Design Chapter 4.

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.

Introduction Computer Organization Spring 1436/37H (2015/16G) Dr. Mohammed Sinky Computer Architecture

Computer Architecture CSE 3322 Web Site crystal.uta.edu/~jpatters/cse3322 Send to Pramod Kumar, with the names and s.

B0111 Performance Anxiety ENGR xD52 Eric VanWyk Fall 2012.

10/25/2005Comp 120 Fall October 25 Review for 2 nd Exam on Tuesday 27 October MUL not MULI Ask Questions!

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

Performance. Moore's Law Moore's Law Related Curves.

Software School, Fudan University 2016 Introduction to Computer System (2) 1.

Measuring Performance II and Logic Design

Lecture 2: Performance Evaluation

Address – 32 bits WRITE Write Cache Write Main Byte Offset Tag Index Valid Tag Data 16K entries 16.

CS161 – Design and Architecture of Computer Systems

Cache Memory and Performance

How do we evaluate computer architectures?

CS 286 Computer Architecture & Organization

Lecture: Pipelining Basics

CSCE 212 Chapter 4: Assessing and Understanding Performance

Chapter 1 Fundamentals of Computer Design

Lecture: Pipelining Basics

ECE 445 – Computer Organization

Lecture 14: Reducing Cache Misses

CS170 Computer Organization and Architecture I

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

Pipeline Performance.

Part IV Data Path and Control

October 29 Review for 2nd Exam Ask Questions! 4/26/2019

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

Chapter 2: Performance CS 447 Jason Bakos Fall 2001 CS 447.

Single Cycle MIPS Implementation

Computer Organization and Design Chapter 4

Presentation transcript:

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

Mid Term Exam 2015/11/13 09:30 Z2208A 2 hours. Evaluation Chapter 5 Cache Lab

Performance and Its Factors CPU execution time = CPU clock cycles X Clock cycle time CPU execution time = CPU clock cycles / Clock rate CPU clock cycles = Instructions for a program X Average clock cycles per instruction CPU time = Instruction count X CPI X Clock cycle time = Instruction count X CPI / Clock rate CPU time= Seconds= Instructions x Cycles x Seconds Program Program Instruction Cycle CPU time= Seconds= Instructions x Cycles x Seconds Program Program Instruction Cycle

CPI: Average Cycles per Instruction CPI = (CPU Time * Clock Rate) / Instruction Count = Clock Cycles / Instruction Count CPI =  CPI  F where F = I i = 1 n i i i i Instruction Count CPI = ideal CPI + Memory_Stalls/Inst + Other_Stalls/Inst Memory_Stalls/Inst = Instruction Miss Rate x Instruction Miss Penalty + Loads/Inst x Load Miss Rate x Load Miss Penalty + Stores/Inst x Store Miss Rate x Store Miss Penalty

Other Metrics MIPS (million instructions per second) = Instruction count / (execution time x 10 6 ) = Instruction count * clock rate / (Instruction count * CPI * 10 6 ) = Clock rate / (CPI * 10 6 )

Amdahl's Law

Data flow Discuss the optimization of the combine 1 ~ 7 in the textbook. Tell the point in each step. For combine5,6,7, explain how they work with data-flow graph, draw the graphs your own and explain how they works and why with your own word (Do not copy from the textbook, show your own understanding after reading). Besides, explain the relationship between this three optimization.