- Mastering Concurrency in Python
- Quan Nguyen
- 143字
- 2021-06-10 19:23:58
The formula for Amdahl's Law
Now, let B denote the fraction of the program that is strictly serial, and consider the following:
- B * T(1) is the time it takes to execute the parts of the program that are inherently sequential.
- T(1) - B * T(1) = (1 - B) * T(1) is the time it takes to execute the parts of the program that are parallelizable, with one processor:
- Then, (1 - B) * T(1) / N is the time it takes to execute these parts with N processors
- So, B * T(1) + (1 - B) * T(1) / N is the total time it takes to execute the whole program with N processors.
Coming back to the formula for the speedup quantity, we have the following:

This formula is actually a form of Amdahl's Law, used to estimate the speedup in a parallel program.
推薦閱讀
- DevOps with Kubernetes
- 信息可視化的藝術(shù):信息可視化在英國
- Ext JS Data-driven Application Design
- Oracle從入門到精通(第5版)
- 零基礎(chǔ)入門學(xué)習(xí)Python(第2版)
- 速學(xué)Python:程序設(shè)計(jì)從入門到進(jìn)階
- 移動(dòng)互聯(lián)網(wǎng)軟件開發(fā)實(shí)驗(yàn)指導(dǎo)
- JBoss:Developer's Guide
- C陷阱與缺陷
- Machine Learning for Developers
- 超好玩的Scratch 3.5少兒編程
- 微信小程序開發(fā)邊做邊學(xué)(微課視頻版)
- AngularJS Web Application Development Cookbook
- 精通Rust(第2版)
- 流程讓管理更高效:流程管理全套方案制作、設(shè)計(jì)與優(yōu)化