2007
DOI: 10.1007/978-3-540-74742-0_81
|View full text |Cite
|
Sign up to set email alerts
|

A Network Performance Sensitivity Metric for Parallel Applications

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2009
2009
2011
2011

Publication Types

Select...
3
1

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 10 publications
0
2
0
Order By: Relevance
“…Assume T idle has exponential distribution (based on the assumption that job submission is a Poisson process). The energy saving can then be written as (6), where 位 is the job arrival rate in arrivals per minute. Figure 3 shows the relation between power saving of one cluster node and the product of job arrival rate and the fixed timeout threshold based on the values presented in Table 1.…”
Section: Fixed Timeout Dpm Policymentioning
confidence: 99%
See 1 more Smart Citation
“…Assume T idle has exponential distribution (based on the assumption that job submission is a Poisson process). The energy saving can then be written as (6), where 位 is the job arrival rate in arrivals per minute. Figure 3 shows the relation between power saving of one cluster node and the product of job arrival rate and the fixed timeout threshold based on the values presented in Table 1.…”
Section: Fixed Timeout Dpm Policymentioning
confidence: 99%
“…While seemingly negligible, any additional levels of traffic between compute nodes can negatively affect the run time of parallel applications, as identified by tools developed in [5] and parallel application run time sensitivity metrics identified in [6]. The tools demonstrate that it is not difficult to render the run time of some parallel applications unpredictable, as the mean run time can be affected by over a factor of two, while the statistical variation of run time can be as high as a factor of 10.…”
Section: Introductionmentioning
confidence: 99%