- Mastering Concurrency in Python
- Quan Nguyen
- 106字
- 2021-06-10 19:23:58
Formula and interpretation
Before we get into the formula for Amdahl's Law and its implications, let's explore the concept of speedup, through some brief analysis. Let's assume that there are N workers working on a given job that is fully parallelizable—that is, the job can be perfectly divided into N equal sections. This means that N workers working together to complete the job will only take 1/N of the time it takes one worker to complete the same job.
However, most computer programs are not 100% parallelizable: some parts of a program might be inherently sequential, while others are broken up into parallel tasks.
推薦閱讀
- 構建移動網站與APP:HTML 5移動開發入門與實戰(跨平臺移動開發叢書)
- Rake Task Management Essentials
- OpenCV 3和Qt5計算機視覺應用開發
- Flux Architecture
- OpenCV 3 Blueprints
- Scala Functional Programming Patterns
- Machine Learning for OpenCV
- OpenCV Android開發實戰
- 超簡單:Photoshop+JavaScript+Python智能修圖與圖像自動化處理
- JavaScript Unit Testing
- Mastering Clojure
- Java網絡編程實用精解
- Game Programming using Qt 5 Beginner's Guide
- 嵌入式網絡編程
- ASP.NET開發技巧精講