2010 18th Euromicro Conference on Parallel, Distributed and Network-Based Processing 2010
DOI: 10.1109/pdp.2010.78
|View full text |Cite
|
Sign up to set email alerts
|

Performance Modeling of MPI Applications Using Model Selection Techniques

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
7
0

Year Published

2011
2011
2013
2013

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(7 citation statements)
references
References 20 publications
0
7
0
Order By: Relevance
“…In particular, broadcast algorithms were considered in this paper. A comprehensive and rigorous analysis of these algorithms has been performed, which improves the preliminary results presented in [8].This paper is organized as follows. In Section 2, the theoretical basis of the modeling method is introduced.…”
mentioning
confidence: 89%
See 1 more Smart Citation
“…In particular, broadcast algorithms were considered in this paper. A comprehensive and rigorous analysis of these algorithms has been performed, which improves the preliminary results presented in [8].This paper is organized as follows. In Section 2, the theoretical basis of the modeling method is introduced.…”
mentioning
confidence: 89%
“…This criterion, widely used in the fields of biology and econometrics, is an objective tool that ranks the models according to their suitability for describing the experimental data. In , a preliminary version of this modeling method was introduced, which was loosely integrated on the Tools for Instrumentation and Analysis (TIA) modeling framework . The present work formalizes the description of the method, including new features such as a renewed procedure to interact with the user and its full integration on the TIA framework.…”
Section: Introductionmentioning
confidence: 99%
“…As an example, let's consider a linear implementation of the broadcast collective communication described in a previous work [3]. In this case, the set of candidate models was generated by WL = {n s }{m s }{P, log 2 P , log 2 P }, where n s is the number of segments of a message, m s the size of each segment and P the number of processes.…”
Section: Genetic Algorithm For Model Selectionmentioning
confidence: 99%
“…A model selection method based on the AIC has been implemented in this stage [3]. This method uses a finite set of candidate models which are automatically generated from information provided by the user.…”
Section: Introductionmentioning
confidence: 99%
“…In the second stage (analysis), the models are calculated by analyzing the performance information obtained from multiple executions of the instrumented code. The model selection methodology based on AIC has been implemented in the analysis stage [7], so that the data from the instrumentation stage can be used by the modeling process. This implementation provides the model with the lowest AIC score as the best model for future inferences, but also provides some statistical information to help the user to decide the suitability of the model.…”
Section: The Modeling Frameworkmentioning
confidence: 99%