Hacker News new | past | comments | ask | show | jobs | submit login

> Writing amazing programs taking full advantage of the core count increase is simply impossible (see Amdahl's law)

I don't see this as true at all, using Wikipedias example -

"a program needs 20 hours to complete using a single thread, but a one-hour portion of the program cannot be parallelized, therefore only the remaining 19 hours execution time can be parallelized, then regardless of how many threads the minimum execution time is always more than 1 hour"

Just increase "19 hours" to "400 hours" execution time, it's possible to increase output as far as you want.

If you're mind set can't get past the "one hour" matters sure or change your mind set to the "19 hours" part of the calculation is what matters.

I don't fully get Gustafson's Law, but maybe it touches on this.




>Just increase "19 hours" to "400 hours" execution time, it's possible to increase output as far as you want.

Yeah, sure. Just give up on the thing you wanted to do and instead do something entirely different that is more parallelizable. That'll keep your CPU utilization high, but it won't actually accomplish your goal (presuming you were using software for some purpose other than maximizing CPU utilization).




Join us for AI Startup School this June 16-17 in San Francisco!

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: