A program takes 20 seconds to run on 1 processor and 5 seconds to run on 4 processors. Estimate Tseq. What is the maximum speedup?
See
Tseq = Time taken by any process to complete sequentially on a single processor
Tseq = N * P
where N is no .of instruction and P is clock period
and here as nothing specifically given so time given in 20sec to execute on a single processor so i think that
Tseq= 20sec
Speed Up - Means how much new system is fast as compared to old system
So
Speed Up = time taken by single processor / time taken to run on a N proceesor system
Here n =4 as new system is 4 processor system
So speed Up= 20/5 = 4
Thank You '
Please if you find anything wrong first comment it and let me know before rating it otheriwse it you like please rate it .
A program takes 20 seconds to run on 1 processor and 5 seconds to run on...
A program executes 10 billion instructions. It executes on an Intel processor that has an average CPI of 1.5 and a clock frequency of 2 GHz. How many seconds does the program take to execute? What is the cycle time of this Intel processor? Assume that an AMD processor takes 6 seconds to execute the program. What is the speedup provided by the Intel processor, relative to the AMD processor
Consider the speedup gained by a multicore processor over a single processor. Use Amdahl’s law to calculate the speedup for the hypothetical scenarios below. Assume the total execution time of the program is 10 seconds. Assume N is the number of parallel processors. Assume 1-f and f are the execution time (fraction) involving code that is sequential and parallelized, respectively. Show your work and explain the size of the speedup (e.g., none, small, large, etc.). N=1, f=1. N=2, f=0.5 N=3,...
You must justify with calculations each of the following questions: System A has 2 processors, program X takes 10 sec. to execute, in one of the processors. Program Y takes 10 sec. in parallel running to the other processor. System B has only one processor that can run only one program at a time. Program X takes 6 seconds to run on this processor. Program Y takes 6 seconds to run on that processor. Which system would you choose if...
Assume for arithmetic, load/store, and branch instructions, a processor has CPls of 3, 15, and 7, respectively. Also assume that on a single processor a program requires the execution of 3.12E9 arithmetic instructions, 1.75E9 load/store instructions, and 512Million branch instructions. Assume that each processor has a 2.5GHz clock frequency. Assume that, as the program is parallelized to run over multiple cores, the number of arithmetic and load/store instructions per processor divided by 0.8xp ( where p is the number of...
Suppose a program (or a program task) takes 1 billion instructions to execute on a processor running at 2 GHz. Suppose also that 50% of the instructions execute in 3 clock cycles, 30% execute in 4 clock cycles, and 20% execute in 5 clock cycles. What is the execution time for the program or task?
Assume that a processor has the following CPIs, arithmetic ops(1), load/store(12), branch instructions(5). Consider a program that requires 10^6 arithmetic ops, .5 ∗ 10^6 load/stores and .3 ∗ 10^6 branch instructions. Each processors has a clock frequency of 2Ghz. Assume that the program is parallelized to run over multiple cores, the number of arithmetic and load/store instructions is divided by .6*p, where p is the number of processors. The number of branch instructions remains the same in each processor. (2*5=10)...
A program with a quadratic run time takes t seconds to run, when given an input size n. If the same algorithm is given input of size 2n, then the program will take approximately how many seconds? a. 2t b. t c. 4t d. 6t
A non-pipelined processor has a clock rate of 1 GHz and an average instruction takes 9 cycles to execute. The manufacturer has decided to design a pipelined version of this processor. For this purpose, the instruction cycle has been divided into five stages with the following latencies: Stage 1 – 2.0 ns,Stage 2 – 1.5 ns, Stage 3 – 1.0 ns, Stage 4 – 2.6 ns, Stage 5 – 1.9 ns. Each stage will require an extra 0.4 ns for...
A program (or a program task) takes 150 million instructions to execute on a processor running at 2.7 GHz. Suppose that 50% of the instructions execute in 3 clock cycles, 30% execute in 4 clock cycles, and 20% execute in 5 clock cycles. What is the execution time for the program or task? Suppose the processor in the previous question part is redesigned so that all instructions that initially executed in 5 cycles and all instructions executed in 4 cycles...
A processor is designed such that the clock of the processor runs at 1 GHz. The following table gives the instruction frequencies for the benchmark and how many cycles each instruction takes. Instruction Type Frequency Cycles Load & Stores 25% 10 cycles Arithmetic Instructions 65% 6 cycles Branch instructions 10% 4 cycles (a) Calculate the CPI for the above benchmark. (b) Suppose the amount of registers are doubled, such that clock cycle time increases by 40%. What is the new...