You have a program that spends 54 minutes on one core computation using a brute force algorithm.
Fantastic news! We've Found the answer you've been seeking!
Question:
You have a program that spends 54 minutes on one core computation using a brute force 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- What is the speedup, accounting for both computation and data structure time?
2-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.?
Related Book For
The Architecture of Computer Hardware, Systems Software and Networking An Information Technology App
ISBN: 978-1118322635
5th edition
Authors: Irv Englander
Posted Date: