This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Effective Execution Time Approximation Method for Parallel Computing
Nov. 2012 (vol. 23 no. 11)
pp. 2024-2032
Junqing Sun, Marvell Semiconductor, Santa Clara
Gregory D. Peterson, University of Tennessee, Knoxville
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.
Index Terms:
Program processors,Random variables,Approximation methods,Computational modeling,Mathematical model,Distribution functions,Shape,heterogeneous computing,Performance modeling,extreme value,mean maximum,execution time
Citation:
Junqing Sun, Gregory D. Peterson, "An Effective Execution Time Approximation Method for Parallel Computing," IEEE Transactions on Parallel and Distributed Systems, vol. 23, no. 11, pp. 2024-2032, Nov. 2012, doi:10.1109/TPDS.2012.21
Usage of this product signifies your acceptance of the Terms of Use.