
Explanation of Solution
Number of processors | Arithmetic instructions | L/S instructions | Branch instructions | Execution Time (Seconds) | Speedup |
1 | 9.6 | 1 | |||
2 | 7.04 | 1.36 | |||
4 | 3.84 | 1.83 | |||
8 | 2.24 | 1.71 |
The arithmetic instructions are parallelized to run over multiple cores as follows
Substitute, “
Thus, the number of arithmetic instructions with 2 processors is
Substitute, “
Thus, the number of arithmetic instructions with 4 processors is
Substitute, “
Thus, the number of arithmetic instructions with 8 processors is
The L/S instructions are parallelized to run over multiple cores as follows
Substitute, “
Thus, the number of L/S instructions with 2 processors is
Substitute, “
Thus, the number of L/S instructions with 4 processors is
Substitute, “
Thus, the number of L/S instructions with 8 processors is
The total execution time of the program can be calculated using the following formula
Substitute, “1” for “CPI of arithmetic instructions”, “12” for “CPI of L/S instructions”, “5” for “CPI of branch instructions”,, “
Thus, the total execution time of the program with 1 processor is “9.6seconds”.
Substitute, “1” for “CPI of arithmetic instructions”, “12” for “CPI of L/S instructions”, “5” for “CPI of branch instructions”,, “
Thus, the total execution time of the program with 2 processors is “7.04seconds”.
Substitute, “1” for “CPI of arithmetic instructions”, “12” for “CPI of L/S instructions”, “5” for “CPI of branch instructions”,, “
Thus, the total execution time of the program with 4 processors is “3.84seconds”.
Substitute, “1” for “CPI of arithmetic instructions”, “12” for “CPI of L/S instructions”, “5” for “CPI of branch instructions”,, “
Thus, the total execution time of the program with 8 processors is “2.24seconds”.
The relative speedup of the processor can be calculated using the following formula
Substitute, “9.6” for “execution time of required processor” and “7.04” for “execution time of current processor”
Therefore, the relative speedup of 2 processors with a single processor is “1.36”.
Substitute, “9.6” for “execution time of required processor” and “3.84” for “execution time of current processor”
Therefore, the relative speedup of 4 processors with a single processor is “2.5”.
Substitute, “9.6” for “execution time of required processor” and “2.24” for “execution time of current processor”
Therefore, the relative speedup of 8 processors with a single processor is “4.28”.
Want to see more full solutions like this?
Chapter 1 Solutions
Computer Organization and Design MIPS Edition, Fifth Edition: The Hardware/Software Interface (The Morgan Kaufmann Series in Computer Architecture and Design)
- Please solve and show all steps. I need to see the Packet Tracer file. Create two subnetworks representing Computer Engineering (CE) and Computer Science (CS) programs. CE subnetwork can use IPs from 169.168.2.0/16 CS subnetwork can use IPs from 170.168.2.0/16 Use the packet tracer program to build your network and make the required configuration to send and receive files between the two programs.arrow_forwardNo AI please. Thank you!arrow_forwardWe have a sequential circuit below. Please come up w/ the truth table & Next State equations for this circuit. Clk Truth Table: Next State Equations: Q₁(next)= Q₂(next)= Q:(next)= Qo(next) - D₁ Q D2 Q2 D₁ Q₁ Do Qo Q₂' Q₁' Qo' Current State Next State Q3 Q2 Q1 QQ(next) Q₂(next) Q₁(next) Q(next) 0 00 0 0 0 0 1 0 0 1 0 0 0 1 1 0 1 0 0 1 0 0 1 1 0 1 1 1 0 0 1 0 0 1 0 1 1 0 01010101 1 1 1 0 0 1 1 0 1 1 1 1 0 1 1 1 1 Now create the FSM (show all possible states) for the circuit from the previous problem. FSM:arrow_forward
- Based on this decoder, please process the output: E E 1 E 0 1 0 EA₂A1A0 = 1010 C7C6C5C4C3C2C1C0 = EA2A1A0 = 1011 C7C6C5C4C3C2C1C₁ = EA₂A1A0 C7C6C5C4C3C2C1C0 = = 0110 E 1 0 E E 1 A₁ A₁ E E 1 0 1 1 0 C, C6 C5 C4 C3 C₂ C₁ Coarrow_forwardThank you. No AI plsarrow_forwardBased on this encoder, please process the output: D₁ D6D5 D₁ D₁ D₂ D₁Do 3210 3 210 Encoder Encoder 1 0 1 0 1 0 S S Encoder Selector Selector Any D7D6D5D4D3D2D1Do AnyA2A1A0 D7D6D5D4D3D2D1D0 AnyA2A1A0 D7D6D5D4D3D2D1D0 AnyA2A1A0 D7D6D5D4D3D2D1D0 AnyA2A1A0 A₂ = 10100011 = =00001011 = 00000001 "I = 00000000 = Α1 A0arrow_forward
- Computer Networking: A Top-Down Approach (7th Edi...Computer EngineeringISBN:9780133594140Author:James Kurose, Keith RossPublisher:PEARSONComputer Organization and Design MIPS Edition, Fi...Computer EngineeringISBN:9780124077263Author:David A. Patterson, John L. HennessyPublisher:Elsevier ScienceNetwork+ Guide to Networks (MindTap Course List)Computer EngineeringISBN:9781337569330Author:Jill West, Tamara Dean, Jean AndrewsPublisher:Cengage Learning
- Concepts of Database ManagementComputer EngineeringISBN:9781337093422Author:Joy L. Starks, Philip J. Pratt, Mary Z. LastPublisher:Cengage LearningPrelude to ProgrammingComputer EngineeringISBN:9780133750423Author:VENIT, StewartPublisher:Pearson EducationSc Business Data Communications and Networking, T...Computer EngineeringISBN:9781119368830Author:FITZGERALDPublisher:WILEY





