Solve part F f. Compare the actual speedup factor provided by Machine C over Machine B with thetheoretical speedup factor determined by Amdahl's law assuming that none of the code isinherently serial. All of it is parallelizable, with no scheduling overhead. c. Now assume that the program can be executed in 4 parallel tasks or threads with roughlyequal number of instructions executed in each task. In another words, as the program isparallelized to run over multiple cores, the number of instructions per processor is dividedby the number of cores. Execution is on a quadcore system with each core (processor)having the same performance as the single processor originally used for Machine B.Coordination and synchronization between the parts adds an extra 50,000 instructionexecutions to each task. Assume the same instruction mix as for Machine B for each task,but increase the CPI for memory reference with cache miss to 10 cycles due to contentionfor memory.Fill out the table below for Machine C.MachineBInstruction TypeLogic and ArithmeticBranchLoad Store with cache hitMemory reference with cache miSSLogic and ArithmeticLoad/Store with cache hitMemory reference with cache miss118Instruction Mix (9)1060

Name: Solve part F f. Compare the actual speedup factor provided by Machine
Uploaded: 2024-03-20T06:51:23.000Z
Channel: Bartleby
Description: Solve part F f. Compare the actual speedup factor provided by Machine C over Machine B with thetheoretical speedup factor determined by Amdahl's law assuming that none of the code isinherently serial. All of it is parallelizable, with no scheduling o