DocumentCode
688174
Title
On the Reproducibility of MPI Reduction Operations
Author
Balaji, Pavan ; Kimpe, Dries
Author_Institution
Math. & Comput. Sci. Div., Argonne Nat. Lab., Argonne, IL, USA
fYear
2013
fDate
13-15 Nov. 2013
Firstpage
407
Lastpage
414
Abstract
Many scientific applications go through a thorough validation and verification ("V&V\´") process to demonstrate that the computer simulation does, in fact, mirror what can be analyzed through physical experimentation. Given the complexity of and the time required for the V&V process, applications that have been validated and verified are typically conservative with respect to changes that might impact the reproducibility of their results. In the extreme case, some applications require bit wise reproducibility for their simulations. Thus, any change made to the application, the hardware, or the software on the system needs to preserve the bit wise reproducibility of the application. Such a constraint, however, can drastically affect the performance efficiency of the system in many ways. In this paper, we analyze the impact of such bit wise reproducibility on the performance efficiency of MPI reduction operations.
Keywords
application program interfaces; message passing; MPI reduction operation; V&V process; bitwise reproducibility; computer simulation; performance efficiency; validation and verification process; Accuracy; Approximation algorithms; Hardware; Optimization; Software; Standards; Topology; MPI; Multicore; Performance; Reduction Operations; Reproducibility; Topology;
fLanguage
English
Publisher
ieee
Conference_Titel
High Performance Computing and Communications & 2013 IEEE International Conference on Embedded and Ubiquitous Computing (HPCC_EUC), 2013 IEEE 10th International Conference on
Conference_Location
Zhangjiajie
Type
conf
DOI
10.1109/HPCC.and.EUC.2013.65
Filename
6831947
Link To Document