.png){kind=icon}
.png){kind=icon}
Return
An Effective Execution Time Approximation Method for Parallel Computing
.png){kind=icon}
PRE
AI
DOI：10.1109/TPDS.2012.21.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In performance modeling of parallel synchronous iterative applications, the longest individual execution time among parallel processors determines the iteration time and often must be estimated for performance analysis. This involves the mean maximum calculation which has been a challenge in computer modeling for a long time. For large systems, numerical methods are not suitable because of heavy computation requirements and inaccuracy caused by rounding. On the other hand, previous approximation methods face challenges of accuracy and generality, especially for heterogeneous computing environments. This paper presents an interesting property of extreme values to enable Effective Mean Maximum Approximation (EMMA). Compared to previous mean maximum execution time approximation methods, this method is more accurate and general to different computational environments.
Keywords:
Performance modeling
extreme value
mean maximum
execution time
heterogeneous computing
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
5.2K
Citations:
1.1W