2011 31st International Conference on Distributed Computing Systems Workshops 2011
DOI: 10.1109/icdcsw.2011.20
|View full text |Cite
|
Sign up to set email alerts
|

Finding a "Kneedle" in a Haystack: Detecting Knee Points in System Behavior

Abstract: Abstract-Computer systems often reach a point at which the relative cost to increase some tunable parameter is no longer worth the corresponding performance benefit. These "knees" typically represent beneficial points that system designers have long selected to best balance inherent trade-offs. While prior work largely uses ad hoc, system-specific approaches to detect knees, we present Kneedle, a general approach to online and offline knee detection that is applicable to a wide range of systems. We define a kn… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
593
0

Year Published

2012
2012
2023
2023

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 819 publications
(672 citation statements)
references
References 12 publications
0
593
0
Order By: Relevance
“…The number of clusters (k) was chosen based on how average correlation coefficients of expression values of genes in the same clusters changed with cluster numbers or the average size of clusters (i.e., number of genes). The knee [17] in the plot of the correlation coefficient versus the average size, which represents the most drastic change of the balance between the two factors, was used to determine the number of clusters. In our experiment, the genes were initially clustered into 100 clusters (see Additional file 1: Figures S1 and S2).…”
Section: Methodsmentioning
confidence: 99%
“…The number of clusters (k) was chosen based on how average correlation coefficients of expression values of genes in the same clusters changed with cluster numbers or the average size of clusters (i.e., number of genes). The knee [17] in the plot of the correlation coefficient versus the average size, which represents the most drastic change of the balance between the two factors, was used to determine the number of clusters. In our experiment, the genes were initially clustered into 100 clusters (see Additional file 1: Figures S1 and S2).…”
Section: Methodsmentioning
confidence: 99%
“…As the number of submovements increases, the cost decreases. The optimal number of submovements was determined using an algorithm that detects the point of maximum curvature in the cost-per-submovements curve [17], selecting the minimum number of submovements required for near-asymptotic performance.…”
Section: Methodsmentioning
confidence: 99%
“…Alternately, the threshold can be obtained systematically (e.g., using knee detection schemes [39]) or learnt during boot-up phase of an application in the data-center, given application traffic typically ramps up slowly before production workloads are handled. Since the initial threshold can change (e.g., due to changes in request mix), Dealer dynamically updates the threshold using Algorithm 2.…”
Section: Estimating Capacity Of Componentsmentioning
confidence: 99%