書名: 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.
推薦閱讀
- Dynamics 365 for Finance and Operations Development Cookbook(Fourth Edition)
- Redis Applied Design Patterns
- LabVIEW入門與實戰開發100例
- Vue.js 3.0源碼解析(微課視頻版)
- Hadoop+Spark大數據分析實戰
- Practical Game Design
- PhpStorm Cookbook
- The Complete Coding Interview Guide in Java
- C語言程序設計實驗指導 (第2版)
- Unity 2D Game Development Cookbook
- Solutions Architect's Handbook
- iOS開發項目化入門教程
- Python Web自動化測試設計與實現
- Flink核心技術:源碼剖析與特性開發
- 零基礎PHP從入門到精通