Size of this preview: 600 × 600 pixels. Other resolutions: 240 × 240 pixels | 480 × 480 pixels | 768 × 768 pixels | 1,024 × 1,024 pixels | 2,001 × 2,001 pixels.
Original file (2,001 × 2,001 pixels, file size: 310 KB, MIME type: image/png)
Summary
edit
Amdahl's Law SpeedUp when the number of processors (N) approaches infinity: SpeedUp = 1/(1-p). The f(x)=x line separates the speedup estimates for programs solving fixed workloads and open workloads.
The lower-right region contains all speedup estimates for programs solving fixed workloads.
The upper-right region contains all speedup estimates for programs with variable workloads.
Licensing
edit
I, the copyright holder of this work, hereby publish it under the following license:
   | This work is licensed under the Creative Commons Attribution-ShareAlike 4.0 License. |
File history
Click on a date/time to view the file as it appeared at that time.
| Date/Time | Thumbnail | Dimensions | User | Comment | |
|---|---|---|---|---|---|
| current | 00:02, 17 September 2024 | | 2,001 × 2,001 (310 KB) | Jys673 (talk | contribs) | Amdahl's Law SpeedUp when the number of processors (N) approaches infinity: SpeedUp = 1/(1-p). The f(x)=x line separates the speedup estimates for programs solving fixed workloads and open workloads. The lower-right region contains all speedup estimates for programs solving fixed workloads. The upper-right region contains all speedup estimates for programs with variable workloads. |
You cannot overwrite this file.
File usage
The following page uses this file:
