.png){kind=icon}
返回
Estimating parallel performance
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jpdc.2013.01.011.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper we introduce our estimation method for parallel execution times, based on identifying separate parts of the work done by parallel programs. Our run time analysis works without any source code inspection. The time of parallel program execution is expressed in terms of the sequential work and the parallel penalty. We measure these values for different problem sizes and numbers of processors and estimate them for unknown values in both dimensions using statistical methods. This allows us to predict parallel execution time for unknown inputs and non-available processor numbers with high precision. Our prediction methods require orders of magnitude less data points than existing approaches. We verified our approach on parallel machines ranging from a multicore computer to a peta-scale supercomputer. Another useful application of our formalism is a new measure of parallel program quality. We analyse the values for parallel penalty for both growing input size and for increasing numbers of processing elements. From these data, conclusions on parallel performance and scalability are drawn. (C) 2013 Elsevier Inc. All rights reserved.
Keyword:
Parallel run time estimation
Scalability measure
期刊
IF:
4
论文数:
3.8K
被引数:
4.8K
机构
引用论文
A Scanning Electron Microscope Study of Etched Aluminum Foil for Electrolytic Capacitors电解电容器用腐蚀铝箔的扫描电子显微镜研究
PREAI
分享收藏Large-Scale Simulation of Flow and Transport in Reconstructed HPLC-Microchip Packings.png)
ANALYTICAL CHEMISTRY
ANALYTICAL CHEMISTRYIF6.7
PREAI
分享收藏
Epileptic focus induced in rat by intrahippocampal cholera toxin: Neuronal properties in vitroNeuroscience
NeuroscienceIF0
PREAI
分享收藏
查看更多内容