1990
DOI: 10.1109/71.80155
|View full text |Cite
|
Sign up to set email alerts
|

Predicting performance of parallel computations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
45
0
8

Year Published

1996
1996
2017
2017

Publication Types

Select...
6
2
2

Relationship

0
10

Authors

Journals

citations
Cited by 97 publications
(53 citation statements)
references
References 13 publications
0
45
0
8
Order By: Relevance
“…Hence, the performance metrics of such networks must be computed by considering the Markov Chain underlying the QN, which represents the possible states of the system [24]. However, such approaches are not fit for Hadoop systems, since the state space grows exponentially with the number of tasks [13,27], in the order of thousands in realistic MapReduce jobs. For this reason, a number of approximation methods have been proposed.…”
Section: Modeling Hadoop 2x Applications Performancementioning
confidence: 99%
“…Hence, the performance metrics of such networks must be computed by considering the Markov Chain underlying the QN, which represents the possible states of the system [24]. However, such approaches are not fit for Hadoop systems, since the state space grows exponentially with the number of tasks [13,27], in the order of thousands in realistic MapReduce jobs. For this reason, a number of approximation methods have been proposed.…”
Section: Modeling Hadoop 2x Applications Performancementioning
confidence: 99%
“…That said, it is possible to mitigate the issue by using a special kind of structure, as shown in [16] which considers the Markov Chain underlying the QN representing the possible states of the system. Unfortunately, as noted in [9,19], the state space grows exponentially when the tasks number corresponds to realistic MapReduce jobs-in the order of thousands-thus making the above approaches unsuitable.…”
Section: Related Workmentioning
confidence: 99%
“…Also, [24] reports the use of a hierarchical approach that combines Markov models and TGs. In [14], this combination is applied to the performance prediction of TGs executing in shared-memory multiprocessor environments. Stochastic Petri Nets (SPN) are also used to represent parallel programs.…”
Section: Preliminaries Overflow [3]mentioning
confidence: 99%