Question: You have a program that spends 54 minutes on one core computation using a bruteforce algorithm. You are considering replacing that with a smarter algorithm
You have a program that spends 54 minutes on one core computation using a bruteforce algorithm. You are considering replacing that with a smarter algorithm that will reduce the core computation time to 6 minutes, but you'll add 34 minutes of data structure traversal time.
1.1 Speedup (10 Points) What is the speedup, accounting for both computation and data structure time?
1.2 Amdahl's Law (15 Points) If the core computation time of the original program is 95% of the total execution time, compute the overall speedup using Amdahl's law. Identify the fraction enhanced and fraction unenhanced
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
