The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Finding a "Kneedle" in a Haystack: Detecting Knee Points in System Behavior
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 on line and off line knee detection that is applicable to a wide range of systems. We define a knee formally for continuous functions using the mathematical concept of curvature and compare our definition against alternatives. We then evaluate Kneedle's accuracy against existing algorithms on both synthetic and real data sets, and evaluate its performance in two different applications.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(1996) · Cited by 20,179
MapReduce: simplified data processing on large clusters
Dean, J., & Ghemawat, S. (2008) · Communications of the ACM · doi:10.1145/1327452.1327492 · Cited by 18,476
Detection of Abrupt Changes: Theory and Application
Riedel, K. S. (1994) · Technometrics · doi:10.1080/00401706.1994.10485821 · Cited by 3,518
Equation-based congestion control for unicast applications
Floyd, S., Handley, M., Padhye, J., & Widmer, J. (2000) · ACM SIGCOMM Computer Communication Review · doi:10.1145/347057.347397 · Cited by 1,414
Making gnutella-like P2P systems scalable
Chawathe, Y., Ratnasamy, S., Breslau, L., Lanham, N., & Shenker, S. (2003) · Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/863955.864000 · Cited by 1,082
A robust and scalable clustering algorithm for mixed type attributes in large database environment
Chiu, T., Fang, D., Chen, J., Wang, Y., & Jeris, C. (2001) · Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/502512.502549 · Cited by 724
Determining the number of clusters/segments in hierarchical clustering/segmentation algorithms
Salvador, S., & Chan, P. (2005) · 16th IEEE International Conference on Tools with Artificial Intelligence · doi:10.1109/ictai.2004.50 · Cited by 683
Equation-based congestion control for unicast applications
Floyd, S., Handley, M., Padhye, J., & Widmer, J. (2000) · Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication · doi:10.1145/347059.347397 · Cited by 587
Congestion control in computer networks: issues and trends
Jain, R. (1990) · IEEE Network · doi:10.1109/65.56532 · Cited by 237
(2001) · Medical Entomology and Zoology · Cited by 223
Experiences building PlanetLab
Peterson, L., Bavier, A. C., Fiuczynski, M. E., & Muir, S. (2006) · doi:10.5555/1298455.1298489 · Cited by 210
Improving Web Availability for Clients with MONET
Andersen, D. G., Balakrishnan, H., Kaashoek, M. F., & Rao, R. N. (2018) · doi:10.1184/r1/6606416 · Cited by 69
A parameterless method for efficiently discovering clusters of arbitrary shape in large datasets
Foss, A., & Zai͏̈ane, O. R. (2003) · Proceedings · doi:10.1109/icdm.2002.1183901 · Cited by 43
Cited by
Snorkel: rapid training data creation with weak supervision
Ratner, A., Bach, S. H., Ehrenberg, H., Fries, J., Wu, S., & Ré, C. (2017) · Proceedings of the VLDB Endowment · doi:10.14778/3157794.3157797 · Cited by 777
A structural biology community assessment of AlphaFold2 applications
Akdel, M., Pires, D. E. V., Pardo, E. P., Jänes, J., Zalevsky, A. O., Mészáros, B., Bryant, P., Good, L. L., Laskowski, R. A., Pozzati, G., et al. (2022) · Nature Structural & Molecular Biology · doi:10.1038/s41594-022-00849-w · Cited by 675
Review—“Knees” in Lithium-Ion Battery Aging Trajectories
Attia, P. M., Bills, A., Brosa Planella, F., Dechent, P., dos Reis, G., Dubarry, M., Gasper, P., Gilchrist, R., Greenbank, S., Howey, D., et al. (2022) · Journal of The Electrochemical Society · doi:10.1149/1945-7111/ac6d13 · Cited by 488
Performance-limiting nanoscale trap clusters at grain junctions in halide perovskites
Doherty, T. A. S., Winchester, A. J., Macpherson, S., Johnstone, D. N., Pareek, V., Tennyson, E. M., Kosar, S., Kosasih, F. U., Anaya, M., Abdi-Jalebi, M., et al. (2020) · Nature · doi:10.1038/s41586-020-2184-1 · Cited by 369
Fermín-Cueto, P., McTurk, E., Allerhand, M., Medina-Lopez, E., Anjos, M. F., Sylvester, J., & dos Reis, G. (2020) · Energy and AI · doi:10.1016/j.egyai.2020.100006 · Cited by 279
Metadata
- Authors
- Satopaa, V., Albrecht, J., Irwin, D., & Raghavan, B.
- Venue
- 2011 31st International Conference on Distributed Computing Systems Workshops
- Publisher
- IEEE
- Published
- 2011-06
- Pages
- 166-171
- OpenAlex
- W2097749765
- Cited by
- 1,274
- References
- 13
- FWCI
- 3.43
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.