Question

In: Computer Science

Consider three different processors P1, P2 and P3 executing the same instruction set with clock rates...

Consider three different processors P1, P2 and P3 executing the same instruction set with clock rates and CPI given in the following table: Processor Clock Rate CPI P1 2 GHz 1.5 P2 1.5 GHz 1.0 P3 3 GHz 2.5 c) We are trying to reduce the execution time by 30% but this leads an increase of 20% in the CPI. What clock rate should we have to get this time reduction? b) If the processors each execute a program in 10 seconds, find the number of cycles and the number of instructions

Solutions

Expert Solution

See the explanation for answer


Explanation:

b)

Execution Time = Instruction Count x CPI x Clock Cycle Time

It is given that for every processor , Execution Time = 10 sec

Also Clock Cycle Time = 1 / Clock Rate

For processor P1,

CPI = 1.5, Clock Cycle Time = 1 / Clock rate = 1 / 2 GHz = 0.5 x 10-9 sec

Execution Time = Instruction Count x CPI x Clock Cycle Time

10 sec = Instruction Count x 1.5 x 0.5 x 10-9 sec

Instruction Count = 13.33 x 109

Clock Cycles = Instruction Count × CPI = 13.33 x 109 x 1.5 = 19.995 x 109

For processor P2,

CPI = 1, Clock Cycle Time = 1 / Clock rate = 1 / 1.5 GHz = 0.66 x 10-9 sec

Execution Time = Instruction Count x CPI x Clock Cycle Time

10 sec = Instruction Count x 1 x 0.66 x 10-9 sec

Instruction Count = 15.15 x 109

Clock Cycles = Instruction Count x CPI = 15.15 x 109 x 1 = 15.15 x 109

For processor P3,

CPI = 2.5, Clock Cycle Time = 1 / Clock rate = 1 / 3 GHz = 0.33 x 10-9 sec

Execution Time = Instruction Count x CPI x Clock Cycle Time

10 sec = Instruction Count x 2.5 x 0.33 x 10-9 sec

Instruction Count = 12.12 x 109

Clock Cycles = Instruction Count x CPI = 12.12 x 109 x 2.5 = 30.3 x 109

c)

It given that Execution Time is reduced by 30% and CPI is increased by 20%

For processor P1,

Execution Time = Instruction Count x CPI x Clock Cycle Time

0.7 x 10 = 13.33 x 109 x 1.2 x 1.5 x Clock Cycle time

Clock Cycle Time = 0.416 x 10-9 sec =

Clock Rate = 1 / Clock Cycle Time = 1 / 0.416 x 10-9 sec = 2.4 GHz

For processor P2,

Execution Time = Instruction Count x CPI x Clock Cycle Time

0.7 x 10 = 15.15 x 109 x 1.2 x 1 x Clock Cycle time

Clock Cycle Time = 0.385 x 10-9 sec =

Clock Rate = 1 / Clock Cycle Time = 1 / 0.385 x 10-9 sec = 2.6 GHz

For processor P3,

Execution Time = Instruction Count x CPI x Clock Cycle Time

0.7 x 10 = 12.12 x 109 x 1.2 x 2.5 x Clock Cycle time

Clock Cycle Time = 0.1925 x 10-9 sec =

Clock Rate = 1 / Clock Cycle Time = 1 / 0.1925 x 10-9 sec = 5.2 GHz


Related Solutions

Consider three different processors P1, P2, and P3 executing the same instruction set. P1 has a...
Consider three different processors P1, P2, and P3 executing the same instruction set. P1 has a 3 GHz clock rate and a CPI of 1.5. P2 has a 2.5 GHz clock rate and a CPI of 1.0. P3 has a 4.0 GHz clock rate and has a CPI of 2.2. a. Find execution time for each processor for a program with 2 x 10 9 instructions. Which one is the fastest? b. If the processors each execute a program in...
Consider three different processors P1, P2, and P3, executing the same instruction set. P1 has a...
Consider three different processors P1, P2, and P3, executing the same instruction set. P1 has a clock cycle time of 300 picosecond and a CPI (clock cycles per instruction) of 1.5. P2 has a clock cycle time of 400 picosecond and a CPI of 1.0. P3 has a clock cycle time of 250 picosecond and a CPI of 2.0. P1 is running a program with 10 instructions. P2 is running a different program with 20 instructions. P3 is running a...
Consider three different processors P1, P2, and P3 executing the same instruction set. P1 has a...
Consider three different processors P1, P2, and P3 executing the same instruction set. P1 has a 3 GHz clock rate and a CPI of 1.5. P2 has a 2.5 GHz clock rate and a CPI of 1.0. P3 has a 4.0 GHz clock rate and has a CPI of 2.2. a. Which processor has the highest performance expressed in instructions per second? b. If the processors each execute a program in 10 seconds, find the number of cycles and the...
Suppose that there are three different populations we want to compare, say P1, P2, and P3....
Suppose that there are three different populations we want to compare, say P1, P2, and P3. Each of these populations is normal. A random sample from each population is taken, and the results are given below. P1 P2 P3 10 6 5 12 8 9 9 3 12 15 0 8 13 2 4 a) Find the sample means and sample variance for each sample. Use Statistical Software and record the results in your Word document. b) Combine all samples...
Suppose that there are three different populations we want to compare, say P1, P2 and P3....
Suppose that there are three different populations we want to compare, say P1, P2 and P3. Each of these populations are normal. A random sample from each population is taken and the results are given below. P1 P2 P3 10 6 5 12 8 9 9 3 12 15 0 8 13 2 4 a) Find the sample means and sample variance for each sample. Use Excel and record the results in your Word document. b) Combine all samples and...
11. Consider three processes P1, P2, and P3, and all them three are ready to run...
11. Consider three processes P1, P2, and P3, and all them three are ready to run at time = 0. Each process has two CPU bursts. When its first CPU burst is completed, each process requests a blocking I/O operation on a separate I/O device. When a process starts to receive service for I/O, the OS scheduler selects and dispatches another process available at the ready queue. The CPU scheduling policy is preemptive priority-based scheduling, where a process being running...
6. Consider the following set of processes P1, P2, P3, P4. Process Burst Time Arrival Time...
6. Consider the following set of processes P1, P2, P3, P4. Process Burst Time Arrival Time Priority P1 3 0 1 P2 5 1 2 P3 8 3 3 P4 4 4 2 a) Draw Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: first-come, first-served (FCFS), priority scheduling (larger number=high priority), and Round-Bobin (RR, quantum=2). b) Compute the average waiting time, turnaround time for the three algorithms. Turnaround time – amount of time to...
Consider two different implementations of the same instruction set architecture. The instructions can be divided into...
Consider two different implementations of the same instruction set architecture. The instructions can be divided into four classes according to their CPI (classes A, B, C, and D). P1 with a clock rate of 2.5 GHz and CPIs of 1, 2, 3, and 3, and P2 with a clock rate of 3 GHz and CPIs of 2, 2, 2, and 2. Given a program with a dynamic instruction count of 1.0E6 instructions divided into classes as follows: 10% class A,...
Consider following four processes arriving in the order of P1, P2, P3 and P4. Process   Arrival...
Consider following four processes arriving in the order of P1, P2, P3 and P4. Process   Arrival Time CPU burst Time P1             0.0     6 P2    0.0                              8 P3              0.0                                7 P4              0.0                                 3 What is the average waiting time for RR scheduling (time quantum = 5)? What is the average waiting time for SJF scheduling? What is the average waiting time for FCFS scheduling?
. Consider this hypothesis test: H0: p1 - p2 = < 0 Ha: p1 - p2...
. Consider this hypothesis test: H0: p1 - p2 = < 0 Ha: p1 - p2 > 0 Here p1 is the population proportion of “happy” of Population 1 and p2 is the population proportion of “happy” of Population 2. Use the statistics data from a simple random sample of each of the two populations to complete the following:​​​​​​ Population 1 Population 2 Sample Size (n) 1000 1000 Number of “yes” 600 280 a. Compute the test statistic z. b....
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT