High Performance Parallel Computing: Difference between revisions
mNo edit summary |
No edit summary |
||
| (3 intermediate revisions by the same user not shown) | |||
| Line 4: | Line 4: | ||
* ''weak scaling'' - maximizing work performed per unit time | * ''weak scaling'' - maximizing work performed per unit time | ||
* ''strong scaling'' - minimizing time-to-solution | * ''strong scaling'' - minimizing time-to-solution | ||
==Measures of parallel algorithms== | ==Measures of parallel algorithms== | ||
* Cost: proccount * exectime | * Cost: proccount * exectime | ||
| Line 20: | Line 17: | ||
==Papers== | ==Papers== | ||
* [http://www.cs.utexas.edu/users/dburger/teaching/cs395t-s08/papers/5_hill.pdf Amdahl's Law in the Multicore Era] by MD Hill | * [http://www.cs.utexas.edu/users/dburger/teaching/cs395t-s08/papers/5_hill.pdf Amdahl's Law in the Multicore Era] by MD Hill | ||
* [[Lock-free algorithms]] page | |||