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.

Slides:

Advertisements

Similar presentations

Instruction Level Parallelism and Superscalar Processors

Advertisements

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

CDA 3101 Fall 2010 Discussion Section 08 CPU Performance

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

Instruction-Level Parallel Processors {Objective: executing two or more instructions in parallel} 4.1 Evolution and overview of ILP-processors 4.2 Dependencies.

RISC and Pipelining Prof. Sin-Min Lee Department of Computer Science.

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.

Lecture: Pipelining Basics

Understanding Performance Metrics of Processors Bina Ramamurthy Chapter 1.

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.

CSCE 212 Quiz 8 – 3/23/11 1.What type of element is the ALU (combinational or state) and what does it mean for an element to be that type? 2.What is the.

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.

CSCE 212 Quiz 2 – 2/2/11 1.What is the purpose of the jal instruction? 2.What are the two conditional branching (if, goto; not the slt instruction) instructions.

CSCE 212 Quiz 9 – 3/30/11 1.What is the clock cycle time based on for single-cycle and for pipelining? 2.What two actions can be done to resolve data hazards?

Computer Architecture Lecture 2 Instruction Set Principles.

CSCE 212 Quiz 9a – 4/1/11 For the following questions, assume the clock cycle times given above and the following set of instructions: lw $5, -16($5) sw.

Lecture: Pipelining Basics

Lecture 24: CPU Design Today’s topic –Multi-Cycle ALU –Introduction to Pipelining 1.

Chapter One Introduction to Pipelined Processors.

Higher Computing Computer Systems S. McCrossan 1 Higher Grade Computing Studies 3. Computer Performance Measures of Processor Speed When comparing one.

Different CPUs CLICK THE SPINNING COMPUTER TO MOVE ON.

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

What have mr aldred’s dirty clothes got to do with the cpu

The Central Processing Unit

B0111 Performance Anxiety ENGR xD52 Eric VanWyk Fall 2012.

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.

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

1 CENG 450 Computer Systems and Architecture Cache Review Amirali Baniasadi

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

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

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.

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

3/12/2013Computer Engg, IIT(BHU)1 CONCEPTS-1. Pipelining Pipelining is used to increase the speed of processing It uses temporal parallelism In pipelining,

COMPUTER ARCHITECTURE & OPERATIONS I Instructor: Yaohang Li.

What am I Looking For? o Must o Be able to describe the: fetch-execute cycle; CPU-Cache-Memory cycle; Dual processor o Should o Be able to describe how.

Computer systems Quiz. The CPU What does CPU stand for?(1) Which 3 step cycle does the CPU follow?(1) In order to run, name 3 things that the CPU needs?(3)

Additional Examples CSE420/598, Fall 2008.

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

Pipelining 7/12/2013.

GCSE OCR Computing A451 The CPU Computing hardware 1.

Compilers can have a profound impact on the performance of an application on given a processor. This problem will explore the impact compilers have on.

Chapter 2.1 CPU.

Defining Performance Which airplane has the best performance?

Lecture 16: Basic Pipelining

Lecture: Pipelining Basics

CSCE 212 Chapter 4: Assessing and Understanding Performance

Computer Architecture CSCE 350

Chapter 1 Fundamentals of Computer Design

CS2100 Computer Organisation

Lecture: Pipelining Basics

Figure 8.1 Architecture of a Simple Computer System.

Lecture 16: Basic Pipelining

You have a system that contains a special processor for doing floating-point operations. You have determined that 50% of your computations can use the.

CSCI 232 © 2005 JW Ryder.

Figure 8.1 Architecture of a Simple Computer System.

CPU Key Revision Points.

Solutions Chapter 1.

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

Objectives Describe how common characteristics of CPUs affect their performance: clock speed, cache size, number of cores Explain the purpose and give.

Learning Objectives To be able to describe the purpose of the CPU

Lecture: Pipelining Basics

Single Cycle MIPS Implementation

CS2100 Computer Organisation

Presentation transcript:

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 a 2 GHz processor. *Show all work. 1.What would be the execution time of Program 1? 2.Which program would run faster and how much faster would it run? 3.What is the speed-up of Program 1 if you were able to reduce the number of compute instructions by one half? # Instr.ComputeLoadStoreBranch Program Program

CSCE 212 Quiz 4 Answers 1.What would be the execution time of Program 1? # clock cycles = (1000*1)+(400*10)+(100*10)+(50*4) = 6200 Execution time = 6200 / 2 x 10 9 = 3.1 x sec

CSCE 212 Quiz 4 Answers 2.Which program would run faster and how much faster would it run? Program 1 = 3.1 x sec Program 2 = 2.5 x sec Program 2 is 3.1/2.5 or 1.24 times faster.

CSCE 212 Quiz 4 Answers 3.What is the speed-up of Program 1 if you were able to reduce the number of compute instructions by one half? Program 1 before = 3.1 x sec Program 1 after = 2.85 x sec Speed up is 3.1/2.85 or ~1.09 times faster.