Assignment2 - COIS 4350H High Performance Computing Winter...

Info iconThis preview shows pages 1–5. Sign up to view the full content.

View Full Document Right Arrow Icon
COIS 4350H High Performance Computing Winter 2010 Assignment 2 Due date: Friday, February 26 (noon)
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Question 1 (10 points) If 35% of a program has to be performed sequentially, what is the speedup that can be achieved for the following, assuming that we are starting with a sequential program and that the problem size is fixed? a) 2 processors . + - . 10 35 1 0 352 . + . 10 35 0 325 . = . 1 675 1 481 2 Processors would lead to a speed up 1.481 times. b) 100 processors . + - . 10 35 1 0 35100 . + . 10 35 0 0065 . = . 10 3565 2 80 Therefore the maximum speed up of 100 processors is 2.8 times. c) an unlimited number of processors →∞ . + - . limx 10 35 1 0 35x →∞ . = . limx 10 35 2 85 The maximum speed up an unlimited amount of processors can achieve is 2.85 times. Question 2 (10 points) What is the maximum fraction of a program’s parallel execution time that can be spent in serial code if it is to achieve a scaled speedup of 7 on 8 processors?
Background image of page 2
+ - = 1f 1 f8 7 = f 149
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Question 3 (15 points) Assume that the execution times of six parallel programs are benchmarked on 1 to 8
Background image of page 4
Image of page 5
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/14/2010 for the course COMPUTER S COIS-3030 taught by Professor Hircock during the Spring '10 term at Trent University.

Page1 / 7

Assignment2 - COIS 4350H High Performance Computing Winter...

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online