Finding a ‘Kneedle’ in a Haystack

Satopaa, V., Albrecht, J., Irwin, D., & Raghavan, B. (2011). Finding a ‘Kneedle’ in a Haystack: Detecting Knee Points in System Behavior. 2011 31st International Conference on Distributed Computing Systems Workshops, 166-171.

Type

Conference paper

Intellectual base

Primary research

Year

2011

Pages

166-171

DOI

10.1109/icdcsw.2011.20

DOI registrant

Institute of Electrical and Electronics Engineers

Link

https://doi.org/10.1109/ICDCSW.2011.20

Cited by

1 citation across 1 artifact.

Each citation links to the sentence it supports in the citing article.

Mechanisms

• Knee Point Analysis
  • They plot sustained throughput against cost across cluster sizes and look for the knee

    This sourcePresents Kneedle as a general method for detecting knee points where additional cost ceases to justify the corresponding performance benefit.

Verification

Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.

Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Registry ID ref:eee41304d434 · see in the full table