Example (1) Two computer systems have been tested using three benchmarks. Using the normalized ratio formula and the following tables below, find which.

Slides:

Advertisements

Similar presentations

Analyzing Parallel Performance Intel Software College Introduction to Parallel Programming – Part 6.

Advertisements

Performance Measurement n Assignment? n Timing #include double When() { struct timeval tp; gettimeofday(&tp, NULL); return((double)tp.tv_sec + (double)tp.tv_usec.

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

Distributed Systems CS

Performance Evaluation of Architectures Vittorio Zaccaria.

Potential for parallel computers/parallel programming

11Sahalu JunaiduICS 573: High Performance Computing5.1 Analytical Modeling of Parallel Programs Sources of Overhead in Parallel Programs Performance Metrics.

Computer Organization and Architecture 18 th March, 2008.

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.

1 Lecture 4 Analytical Modeling of Parallel Programs Parallel Computing Fall 2008.

CS 584. Logic The art of thinking and reasoning in strict accordance with the limitations and incapacities of the human misunderstanding. The basis of.

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

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Parallel Programming with MPI and OpenMP Michael J. Quinn.

Performance Metrics Parallel Computing - Theory and Practice (2/e) Section 3.6 Michael J. Quinn mcGraw-Hill, Inc., 1994.

GEOS-CHEM: Platforms and Resolution 4x5 is under control, many platform options exist. 2x2.5 is a factor of 5-6 slower than 4x5, but useful. global 1x1.

CS 584 Lecture 11 l Assignment? l Paper Schedule –10 Students –5 Days –Look at the schedule and me your preference. Quickly.

Lecture 5 Today’s Topics and Learning Objectives Quinn Chapter 7 Predict performance of parallel programs Understand barriers to higher performance.

Steve Lantz Computing and Information Science Parallel Performance Week 7 Lecture Notes.

1 Measuring Performance Chris Clack B261 Systems Architecture.

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

Computer Science 320 Measuring Speedup. What Is Running Time? T(N, K) says that the running time T is a function of the problem size N and the number.

Slides Prepared from the CI-Tutor Courses at NCSA By S. Masoud Sadjadi School of Computing and Information Sciences Florida.

Chapter 4 Performance. Times User CPU time – Time that the CPU is executing the program System CPU time – time the CPU is executing OS routines for the.

“elbowing out” Processors used Speedup Efficiency timeexecution Parallel Processors timeexecution Sequential Efficiency   

INTEL CONFIDENTIAL Predicting Parallel Performance Introduction to Parallel Programming – Part 10.

Flynn’s Taxonomy SISD: Although instruction execution may be pipelined, computers in this category can decode only a single instruction in unit time SIMD:

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

Lecturer: Simon Winberg Lecture 18 Amdahl’s Law (+- 25 min)

Lecture 9 TTH 03:30AM-04:45PM Dr. Jianjun Hu CSCE569 Parallel Computing University of South Carolina Department of.

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.

From lecture slides for Computer Organization and Architecture: Designing for Performance, Eighth Edition, Prentice Hall, 2010 CS 211: Computer Architecture.

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.

Parallel Programming with MPI and OpenMP

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

Copyright Hesham El-Rewini1 Speedup S = Speed(new) / Speed(old) S = Work/time(new) / Work/time(old) S = time(old) / time(new) S = time(before improvement)

Advanced Computer Networks Lecture 1 - Parallelization 1.

Scaling Conway’s Game of Life. Why do parallelism? Speedup – solve a problem faster. Accuracy – solve a problem better. Scaling – solve a bigger problem.

Amdahl’s Law CPS 5401 Fall 2013 Shirley Moore

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.

LECTURE #1 INTRODUCTON TO PARALLEL COMPUTING. 1.What is parallel computing? 2.Why we need parallel computing? 3.Why parallel computing is more difficult?

Distributed and Parallel Processing George Wells.

Computer Organization CS345 David Monismith Based upon notes by Dr. Bill Siever and from the Patterson and Hennessy Text.

Supercomputing in Plain English Tuning Blue Waters Undergraduate Petascale Education Program May 29 – June

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

Potential for parallel computers/parallel programming

Software Architecture in Practice

4- Performance Analysis of Parallel Programs

Introduction to Parallelism.

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.

Quiz Questions Parallel Programming Parallel Computing Potential

PERFORMANCE MEASURES. COMPUTATIONAL MODELS Equal Duration Model:  It is assumed that a given task can be divided into n equal subtasks, each of which.

Sec 4.5: Slope Formula.

Potential for parallel computers/parallel programming

Potential for parallel computers/parallel programming

The University of Adelaide, School of Computer Science

Potential for parallel computers/parallel programming

Quiz Questions Parallel Programming Parallel Computing Potential

Quiz Questions Parallel Programming Parallel Computing Potential

Quiz Questions Parallel Programming Parallel Computing Potential

Potential for parallel computers/parallel programming

Performance Measurement and Analysis

Homework Due Friday.

Presentation transcript:

Example (1) Two computer systems have been tested using three benchmarks. Using the normalized ratio formula and the following tables below, find which computer system gives better performance than the other. Execution time on the benchmarks (n sec) Computer System AComputer System B Tsut Tsut Tsut Reference execution time (n sec) Tref Tref Tref 3 2.2

Example (Cont.)

Example (2) If the execution time of a program on a single processor is 2.4 ns and the execution time of the same program on a 4 parallel processors is 1.96 ns. Find the Speedup and the fraction f of code infinitely parallelizable with no scheduling overhead using Amdahl’s law.

Example (Cont.)