Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Problem 1 (40 points): Consider the following two processors. P1 has a clock rate of 4 GHz, average CPI of 0.9, and requires the execution

image text in transcribed

Problem 1 (40 points): Consider the following two processors. P1 has a clock rate of 4 GHz, average CPI of 0.9, and requires the execution of 5.0E9 instructions. P2 has a clock rate of 3 GHz, an average CPI of 0.75, and requires the execution of 1.0E9 instructions. a. One usual fallacy is to consider the computer with the largest clock rate as having the highest performance. Check if this is true for P1 and P2. b. Another fallacy is to consider that the processor executing the largest number of instructions will need a larger CPU time. Considering that processor P1 is executing a sequence of 1.089 instructions and that the CPI of processors P1 and P2 do not change, determine the number of instructions that P2 can execute in the same time that P1 needs to execute 1.0E9 instructions. A common fallacy is to use MIPS (millions of instructions per second) to compare the performance of two different processors and consider that the processor with the largest MIPS has the largest performance. Check if this is true for P1 and P2. d. Another common performance figure is MFLOPS (millions of floating-point operations per second), defined as: c. MFLOPS = No.FP operations/(execution time x 1E6) Assume that 40% of the instructions executed on both P1 and P2 are floating-point instructions. Find the MFLOPS figures for the processors. Problem 2 (20 points): A program P running on a single-processor system takes time T to complete. Let us assume that 40% of the program's code is associated with data management housekeeping (according to Amdahl) and, therefore, can only execute sequentially on a single processor. Let us further assume that the rest of the program (60%) is embarrassingly parallel in that it can easily be divided into smaller tasks executing concurrently across multiple processors (without any interdependencies or communications among the tasks) a. Calculate T2, T4, T8, which are the times to execute program P on a two-, four-, eight-processor system, respectively. b. Calculate Too on a system with an infinite number of processors. Calculate the speedup of the program on this system, where speedup is defined as To What does this correspond to

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Systems Analysis And Synthesis Bridging Computer Science And Information Technology

Authors: Barry Dwyer

1st Edition

0128054492, 9780128054499

More Books

Students also viewed these Databases questions