2012 SC Companion: High Performance Computing, Networking Storage and Analysis 2012
DOI: 10.1109/sc.companion.2012.147
|View full text |Cite
|
Sign up to set email alerts
|

Program Scalability Analysis for HPC Cloud: Applying Amdahl's Law to NAS Benchmarks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
16
0

Year Published

2012
2012
2023
2023

Publication Types

Select...
3
3
1

Relationship

0
7

Authors

Journals

citations
Cited by 18 publications
(16 citation statements)
references
References 23 publications
0
16
0
Order By: Relevance
“…In Figure 7, the optimal granularity sizes are: 11, 22, and 33. The relationship between these sizes are given by the volatility power indices of the 45 cores at their peaks: 303, 409, and 818 [20]. At these optimal points, the synchronization overhead is near zero (note the Brachistochrone analogy).…”
Section: Single-node Multiple-core Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…In Figure 7, the optimal granularity sizes are: 11, 22, and 33. The relationship between these sizes are given by the volatility power indices of the 45 cores at their peaks: 303, 409, and 818 [20]. At these optimal points, the synchronization overhead is near zero (note the Brachistochrone analogy).…”
Section: Single-node Multiple-core Resultsmentioning
confidence: 99%
“…At these optimal points, the synchronization overhead is near zero (note the Brachistochrone analogy). Further quantitative scalability analysis becomes possible using the optimized performance and simpler time complexity models [20]. The MPI (Open MPI 1.10.0) on Centos 7 delivered consistently worse performance than the worst tuned Synergy performance (5.1GFLOPS).…”
Section: Single-node Multiple-core Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…On the surface, Amdahl's Law offers a pessimistic view of parallel processing, showing that speedup drops off drastically if even a tiny portion of the program is not parallelizable. [5] For this reason, John L. Gustafson revised Amdahl's law and created a scaled formula, [5] where…”
Section: Amdahl's and Gustafson's Lawsmentioning
confidence: 99%
“…Though the two laws are mathematically equivalent, [5] there is a difference in their applicability. Because Gustafson's Law includes t p (P ) rather than just t p (1) as Amdahl's Law does, it is possible with Gustafson's Law to quantify parallel and communication times in the same percentage.…”
Section: Amdahl's and Gustafson's Lawsmentioning
confidence: 99%