The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Active Harmony: Towards Automated Performance Tuning
Open accessAbstract
In this paper, we present the Active Harmony automated runtime tuning system. We describe the interface used by programs to make applications tunable. We present the Library Specification Layer which helps program library developers expose multiple variations of the same API using different algorithms.The Library Specification Language helps to select the most appropriate program library to tune the overall performance. We also present the optimization algorithm used to adjust parameters in the application and the libraries. Finally, we present results that show how the system is able to tune several real applications. The automated tuning system is able to tune the application parameers to within a few percent of the best value after evaluating only 11 out of over 1,700 possible configurations.
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
A Simplex Method for Function Minimization
Nelder, J. A., & Mead, R. (1965) · The Computer Journal · doi:10.1093/comjnl/7.4.308 · Cited by 28,905
The Grid 2: Blueprint for a New Computing Infrastructure
Foster, I. T., & Kesselman, C. (1998) · Cited by 7,637
A universal algorithm for sequential data compression
Ziv, J., & Lempel, A. (1977) · IEEE Transactions on Information Theory · doi:10.1109/tit.1977.1055714 · Cited by 5,456
Scheduling from the perspective of the application
Berman, F., & Wolski, R. (1996) · ACM International Symposium on High-Performance Parallel and Distributed Computing (HPDC) · doi:10.1109/hpdc.1996.546178 · Cited by 120
Cited by
OpenTuner: an extensible framework for program autotuning
Ansel, J., Kamil, S., Veeramachaneni, K., Ragan-Kelley, J., Bosboom, J., O'Reilly, U.-M., & Amarasinghe, S. (2014) · Proceedings of the 23rd international conference on Parallel architectures and compilation · doi:10.1145/2628071.2628092 · Cited by 530
Managing performance vs. accuracy trade-offs with loop perforation
Sidiroglou-Douskos, S., Misailovic, S., Hoffmann, H., & Rinard, M. (2011) · Proceedings of the 19th ACM SIGSOFT symposium and the 13th European conference on Foundations of software engineering · doi:10.1145/2025113.2025133 · Cited by 505
Dynamic knobs for responsive power-aware computing
Hoffmann, H., Sidiroglou, S., Carbin, M., Misailovic, S., Agarwal, A., & Rinard, M. (2011) · Proceedings of the sixteenth international conference on Architectural support for programming languages and operating systems · doi:10.1145/1950365.1950390 · Cited by 304
Performance Optimization using Multimodal Modeling and Heterogeneous GNN
Dutta, A., Alcaraz, J., TehraniJamsaz, A., Cesar, E., Sikora, A., & Jannesari, A. (2023) · Proceedings of the 32nd International Symposium on High-Performance Parallel and Distributed Computing · doi:10.1145/3588195.3592984 · Cited by 16
Metadata
- Authors
- Tapus, C., Chung, I.-H., & Hollingsworth, J. K.
- Venue
- ACM/IEEE SC 2002 Conference (SC'02)
- Publisher
- IEEE
- Published
- 2002
- Pages
- 44-44
- ISSN
- 1063-9535 (ISSN-L)
- OpenAlex
- W4247050054
- Cited by
- 286
- References
- 4
- FWCI
- 6.39
- Type
- conference paper
- Language
- en
- Open access
- green
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Active Harmony: Towards Automated Performance Tuning. https://app.cochat.ai/papers/10.1109/sc.2002.10062
- The paper
- Tapus, C., Chung, I.-H., & Hollingsworth, J. K. (2002). Active Harmony: Towards Automated Performance Tuning. ACM/IEEE SC 2002 Conference (SC'02). https://doi.org/10.1109/sc.2002.10062
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.