CS170 Computer Organization and Architecture I

Slides:



Advertisements
Similar presentations
Instruction Sets: Characteristics and Functions Addressing Modes
Advertisements

Lecture 13: 10/8/2002CS170 Fall CS170 Computer Organization and Architecture I Ayman Abdel-Hamid Department of Computer Science Old Dominion University.
Lecture 20: 11/12/2002CS170 Fall CS170 Computer Organization and Architecture I Ayman Abdel-Hamid Department of Computer Science Old Dominion University.
ECE 4100/6100 Advanced Computer Architecture Lecture 3 Performance Prof. Hsien-Hsin Sean Lee School of Electrical and Computer Engineering Georgia Institute.
Lecture 7: 9/17/2002CS170 Fall CS170 Computer Organization and Architecture I Ayman Abdel-Hamid Department of Computer Science Old Dominion University.
Rung-Bin Lin Chapter 1: Fundamental of Computer Design1-1 Chapter 1. Fundamentals of Computer Design Introduction –Performance Improvement due to (1).
4-1 Chapter 4 - The Instruction Set Architecture Computer Architecture and Organization by M. Murdocca and V. Heuring © 2007 M. Murdocca and V. Heuring.
1 A Simple but Realistic Assembly Language for a Course in Computer Organization Eric Larson Moon Ok Kim Seattle University October 25, 2008.
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.
Lecture 2: 8/29/2002CS170 Fall CS170 Computer Organization and Architecture I Ayman Abdel-Hamid Department of Computer Science Old Dominion University.
Lecture 15: 10/24/2002CS170 Fall CS170 Computer Organization and Architecture I Ayman Abdel-Hamid Department of Computer Science Old Dominion University.
The Central Processing Unit (CPU) and the Machine Cycle.
Computer Organization and Architecture Tutorial 1 Kenneth Lee.
Lecture 9: 9/24/2002CS170 Fall CS170 Computer Organization and Architecture I Ayman Abdel-Hamid Department of Computer Science Old Dominion University.
From lecture slides for Computer Organization and Architecture: Designing for Performance, Eighth Edition, Prentice Hall, 2010 CS 211: Computer Architecture.
Computer Architecture
Lecture 8: 9/19/2002CS170 Fall CS170 Computer Organization and Architecture I Ayman Abdel-Hamid Department of Computer Science Old Dominion University.
Lecture 8: 9/19/2002CS149D Fall CS149D Elements of Computer Science Ayman Abdel-Hamid Department of Computer Science Old Dominion University Lecture.
Lecture 1: 8/27/2002CS170 Fall CS170 Computer Organization and Architecture I Ayman Abdel-Hamid Department of Computer Science Old Dominion University.
Cost and Performance.
Lecture 7: 9/17/2002CS149D Fall CS149D Elements of Computer Science Ayman Abdel-Hamid Department of Computer Science Old Dominion University Lecture.
Computer Architecture Souad MEDDEB
Lecture 11: 10/1/2002CS170 Fall CS170 Computer Organization and Architecture I Ayman Abdel-Hamid Department of Computer Science Old Dominion University.
Lecture 4: 9/5/2002CS170 Fall CS170 Computer Organization and Architecture I Ayman Abdel-Hamid Department of Computer Science Old Dominion University.
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.
1  1998 Morgan Kaufmann Publishers Where we are headed Performance issues (Chapter 2) vocabulary and motivation A specific instruction set architecture.
1/17/2016CPEG323-08F\Topic4a1 Topic IV - Cont’d Performance Measurement Introduction to Computer Systems Engineering (CPEG 323)
September 10 Performance Read 3.1 through 3.4 for Wednesday Only 3 classes before 1 st Exam!
Lecture 5: 9/10/2002CS170 Fall CS170 Computer Organization and Architecture I Ayman Abdel-Hamid Department of Computer Science Old Dominion University.
1  2004 Morgan Kaufmann Publishers Locality A principle that makes having a memory hierarchy a good idea If an item is referenced, temporal locality:
Lecture 24: 12/3/2002CS170 Fall CS170 Computer Organization and Architecture I Ayman Abdel-Hamid Department of Computer Science Old Dominion University.
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.
Jan. 5, 2000Systems Architecture II1 Machine Organization (CS 570) Lecture 2: Performance Evaluation and Benchmarking * Jeremy R. Johnson Wed. Oct. 4,
Lecture 16: 10/29/2002CS170 Fall CS170 Computer Organization and Architecture I Ayman Abdel-Hamid Department of Computer Science Old Dominion University.
May 22, 2000Systems Architecture I1 Systems Architecture I (CS ) Lecture 14: A Simple Implementation of MIPS * Jeremy R. Johnson Mon. May 17, 2000.
CHAPTER 2 Instruction Set Architecture 3/21/
BITS Pilani, Pilani Campus Today’s Agenda Role of Performance.
Lecture 17: 10/31/2002CS170 Fall CS170 Computer Organization and Architecture I Ayman Abdel-Hamid Department of Computer Science Old Dominion University.
June 20, 2001Systems Architecture II1 Systems Architecture II (CS ) Lecture 1: Performance Evaluation and Benchmarking * Jeremy R. Johnson Wed.
Computer Organization Exam Review CS345 David Monismith.
4- Performance Analysis of Parallel Programs
September 2 Performance Read 3.1 through 3.4 for Tuesday
ECE 4100/6100 Advanced Computer Architecture Lecture 1 Performance
Execution time Execution Time (processor-related) = IC x CPI x T
Defining Performance Which airplane has the best performance?
Computer Architecture & Operations I
Instruction Set Architecture
Chapter 1 Fundamentals of Computer Design
Computer Architecture
CS170 Computer Organization and Architecture I
CS149D Elements of Computer Science
CS-350 Term Project Charles Abzug, Ph.D.
CS170 Computer Organization and Architecture I
CS170 Computer Organization and Architecture I
CS149D Elements of Computer Science
CMSC 611: Advanced Computer Architecture
Morgan Kaufmann Publishers The Processor
Systems Architecture I
MARIE: An Introduction to a Simple Computer
Morgan Kaufmann Publishers Computer Performance
COMS 361 Computer Organization
CS149D Elements of Computer Science
CMSC 611: Advanced Computer Architecture
CS148 Introduction to Programming II
October 29 Review for 2nd Exam Ask Questions! 4/26/2019
January 25 Did you get mail from Chun-Fa about assignment grades?
CS148 Introduction to Programming II
CS148 Introduction to Programming II
Presentation transcript:

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

Outline Problem 2.15 Rates of Improvement Influences on Performance Summary of performance tests A look ahead (chapter 3) Lecture 10: 9/26/2002 CS170 Fall 2002

Rates of Improvement F = (1 + R)N F improvement factor R rate of improvement per duration (e.g., per year) N number of durations (e.g., number of years) For DRAMs, the component density increases 60% per year. What is the improvement factor in 3 years? R = 0.60 N = 3 F = (1+R)N = (1+0.6)3 = 4.096 Lecture 10: 9/26/2002 CS170 Fall 2002

Influences on Performance Execution time = IC * CPI * Cycle time = IC * [CPU cycles per instruction + Memory cycles per instruction ] * cycle time = IC * [CPU cycles per instruction + (References per instruction * cycles per reference) ] * Cycle time Instruction Set Architecture Compiler Technology CPU Implementation Cache and Memory Hierarchy From “Cache and Memory Hierarchy Design”, S.A. Przybylski Morgan Kaufman Publishers, Inc. 1990 Lecture 10: 9/26/2002 CS170 Fall 2002

Performance Tests Kernels Synthetic Benchmarks Small pieces of real programs, subroutines or inner loops. Examples Livermore (series of 21 small loop fragments) loops and Linpack (portion of a linear algebra subroutine package). Very popular for benchmarking scientific applications. Can overstate performance of real applications Synthetic Benchmarks Whetstone and Dhrystone Small and Simple benchmarks Small and simple codes embodying a single well known algortihm. An example is a Quicksort code. They are too simple and too restricted in operations to test performance. Mixtures of real programs SPEC Lecture 10: 9/26/2002 CS170 Fall 2002

A Look Ahead Chapter 3 Overview of computer organization Fetch/Execute cycle Computer operations addressing modes Instruction set design principles Overview of MIPS architecture Stored program concept Learn a subset of MIPS assembly language Show how MIPS instructions are represented in machine language Contrast MIPS architecture with other (I80X89 and PowerPC architectures Lecture 10: 9/26/2002 CS170 Fall 2002