- 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.
推薦閱讀
- LaTeX Cookbook
- R語言游戲數據分析與挖掘
- Python網絡爬蟲從入門到實踐(第2版)
- Mastering OpenCV 4
- Oracle BAM 11gR1 Handbook
- Python數據可視化之Matplotlib與Pyecharts實戰
- The Complete Coding Interview Guide in Java
- 新一代SDN:VMware NSX 網絡原理與實踐
- Python 3 數據分析與機器學習實戰
- Flink技術內幕:架構設計與實現原理
- 多媒體技術及應用
- Apache Solr PHP Integration
- IBM RUP參考與認證指南
- 關系數據庫與SQL Server 2012(第3版)
- SOA Patterns with BizTalk Server 2013 and Microsoft Azure(Second Edition)