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.

Slides:



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

CDA 3101 Fall 2010 Discussion Section 08 CPU Performance
Vector: Data Layout Vector: x[n] P processors Assume n = r * p
Computer Organization Lab 1 Soufiane berouel. Formulas to Remember CPU Time = CPU Clock Cycles x Clock Cycle Time CPU Clock Cycles = Instruction Count.
Study Guide. a) Has a whole number part & a fraction part b) The answer to a division problem c) For example, 2 1/2 d) Both A and C.
Pipeline and Vector Processing (Chapter2 and Appendix A)
Performance Analysis of Multiprocessor Architectures
Computer Performance CS350 Term Project-Spring 2001 Elizabeth Cramer Bryan Driskell Yassaman Shayesteh.
Computer Organization and Architecture 18 th March, 2008.
Example (1) Two computer systems have been tested using three benchmarks. Using the normalized ratio formula and the following tables below, find which.
CSCE 212 Chapter 4: Assessing and Understanding Performance Instructor: Jason D. Bakos.
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.
Recap.
Copyright 2008 Koren ECE666/Koren Sample Mid-term 2.1 Israel Koren Spring 2008 UNIVERSITY OF MASSACHUSETTS Dept. of Electrical & Computer Engineering Digital.
Computer Architecture Lecture 2 Instruction Set Principles.
Amdahl's Law.
CMSC 611: Advanced Computer Architecture Performance Some material adapted from Mohamed Younis, UMBC CMSC 611 Spr 2003 course slides Some material adapted.
Modeling Breaking Waves Zoe Boekelheide Scientific Computing April 30, 2003.
CPU Performance Assessment As-Bahiya Abu-Samra *Moore’s Law *Clock Speed *Instruction Execution Rate - MIPS - MFLOPS *SPEC Speed Metric *Amdahl’s.
CMSC 611: Advanced Computer Architecture Benchmarking Some material adapted from Mohamed Younis, UMBC CMSC 611 Spr 2003 course slides Some material adapted.
People Fractions. Problem 1 of 20 Answer 1 = 10 Problem 2 of 20 Answer 2 = 5.
INTRODUCTION Jehan-François Pâris An evolving field Computer architectures keep changing –Building faster computers Supercomputers and.
10-1 Chapter 10 - Advanced Computer Architecture Computer Architecture and Organization by M. Murdocca and V. Heuring © 2007 M. Murdocca and V. Heuring.
computer
Compiled by Maria Ramila Jimenez
1 Number Systems Lecture 10 Digital Design and Computer Architecture Harris & Harris Morgan Kaufmann / Elsevier, 2007.
Scaling Area Under a Curve. Why do parallelism? Speedup – solve a problem faster. Accuracy – solve a problem better. Scaling – solve a bigger problem.
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.
Performance Lecture notes from MKP, H. H. Lee and S. Yalamanchili.
Introducing: common denominator least common denominator like fractions unlike fractions. HOW TO COMPARE FRACTIONS.
CPU Performance using Different Parameters CS 250: Andrei D. Coronel, MS,CEH,PhD Cand.
CS /02 Semester II Help Session IIA Performance Measures Colin Tan S
 Example 1: -2(3)  If there is only one negative it will be a negative answer.  -2(3) = -6.
Computers and Numbers. Types of Numbers Computers store two different types of numbers: Whole Numbers AKA Integers (mathematics) AKA Fixed Point Numbers.
Performance – Last Lecture Bottom line performance measure is time Performance A = 1/Execution Time A Comparing Performance N = Performance A / Performance.
Introducing: common denominator least common denominator like fractions unlike fractions. HOW TO COMPARE FRACTIONS.
Scaling Conway’s Game of Life. Why do parallelism? Speedup – solve a problem faster. Accuracy – solve a problem better. Scaling – solve a bigger problem.
Representation of Data (Part II) Computer Studies Notes: chapter 19 Ma King Man.
Speedup Speedup is defined as Speedup = Time taken for a given computation by a non-pipelined functional unit Time taken for the same computation by a.
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 Science 320 Measuring Sizeup. Speedup vs Sizeup If we add more processors, we should be able to solve a problem of a given size faster If we.
VB.NET and Excel VB.NET allows you to write code to manipulate Excel. You can create, open, and save Excel files. You can read data from Excel. You can.
Additional Examples CSE420/598, Fall 2008.
Performance. Moore's Law Moore's Law Related Curves.
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.
Software Architecture in Practice
4- Performance Analysis of Parallel Programs
15.1 – Introduction to physical-Query-plan operators
CSCI206 - Computer Organization & Programming
Defining Performance Which airplane has the best performance?
CSCE 212 Chapter 4: Assessing and Understanding Performance
Chapter 1 Fundamentals of Computer Design
CS2100 Computer Organisation
Defining Performance Section /14/2018 9:52 PM.
Day 4.
Answer Grid – Comparing Fractions - Higher
Equivalent ratios.
CMSC 611: Advanced Computer Architecture
סדר דין פלילי – חקיקה ומהות ההליך הפלילי
Essential Questions What is a denominator? What is a numerator?

Angle Relationships Objective: Identify and use special angle pairs. Identify perpendicular lines.
CMSC 611: Advanced Computer Architecture
The University of Adelaide, School of Computer Science
You must show all steps of your working out.
Question 1.
Modified at -
CS2100 Computer Organisation
Presentation transcript:

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 floating-point processor. The speedup of the floating pointing-point processor is 15. a) Overall speedup achieved by using the floating-point processor. F = 0.5 S = 15 Overall speedup = b) Overall speedup achieved if you modify the compiler so that 75% of the computations can use the floating-point processor. F = 0.75 S = 15 Overall speedup =

c) What fraction of the computations should be able to use the floating–point processor in order to achieve an overall speedup of 2.25? F = ? S = 15 or 60%

You have a system that contains a special processor for doing floating-point operations. You have determined that 60% of your computations can use the floating-point processor. When a program uses the floating-point processor, the speedup of the floating-point processor is 40% faster than when it doesn’t use it. Overall speedup by using the floating-point processor. F = 0.6 S = 1.4 Overall speedup = In order to improve the speedup you are considering two options: Option 1: Modifying the compiler so that 70% of the computations can use the floating-point processor. Cost of this option is $50K. Option 2: Modifying the floating-point processor . The speedup of the floating-point processor is 100% faster than when it doesn’t use it. Assume in this case that 50% of the computations can use the floating–point processor. Cost of this option is $60K. Which option would you recommend? Justify your answer quantitatively.

F = 0.7 S = 1.4 Overall speedup = Option 1 F = 0.5 S = 2 Overall speedup = Option 2 Therefore, Option 1 is better because it has a smaller Cost/Speedup ratio.