The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Managing performance vs. accuracy trade-offs with loop perforation
Open accessAbstract
Many modern computations (such as video and audio encoders, Monte Carlo simulations, and machine learning algorithms) are designed to trade off accuracy in return for increased performance. To date, such computations typically use ad-hoc, domain-specific techniques developed specifically for the computation at hand. Loop perforation provides a general technique to trade accuracy for performance by transforming loops to execute a subset of their iterations. A criticality testing phase filters out critical loops (whose perforation produces unacceptable behavior) to identify tunable loops (whose perforation produces more efficient and still acceptably accurate computations). A perforation space exploration algorithm perforates combinations of tunable loops to find Pareto-optimal perforation policies. Our results indicate that, for a range of applications, this approach typically delivers performance increases of over a factor of two (and up to a factor of seven) while changing the result that the application produces by less than 10%.
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
UCI Machine Learning Repository
Asuncion, A. (2007) · Medical Entomology and Zoology · Cited by 25,410
Algorithm AS 136: A K-Means Clustering Algorithm
Hartigan, J. A., & Wong, M. A. (1979) · Applied Statistics · doi:10.2307/2346830 · Cited by 14,523
The PARSEC benchmark suite: characterization and architectural implications
Bienia, C., Kumar, S., Singh, J. P., & Li, K. (2008) · Proceedings of the 17th international conference on Parallel architectures and compilation techniques · doi:10.1145/1454115.1454128 · Cited by 3,444
The JPEG still picture compression standard
Wallace, G. K. (1992) · IEEE Transactions on Consumer Electronics · doi:10.1109/30.125072 · Cited by 2,851
FFTW: an adaptive software architecture for the FFT
Frigo, M., & Johnson, S. G. (2002) · Proceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '98 (Cat. No.98CH36181) · doi:10.1109/icassp.1998.681704 · Cited by 1,801
Kalos, M. H., & Whitlock, P. A. (1986) · Wiley eBooks · doi:10.1002/9783527617395 · Cited by 1,546
Real-time dynamic voltage scaling for low-power embedded operating systems
Pillai, P., & Shin, K. G. (2001) · Proceedings of the eighteenth ACM symposium on Operating systems principles · doi:10.1145/502034.502044 · Cited by 1,138
Automatically Tuned Linear Algebra Software
Whaley, R. C., & Dongarra, J. J. (1998) · Conference on High Performance Computing (Supercomputing) · doi:10.5555/509058.509096 · Cited by 854
A comparison of extrinsic clustering evaluation metrics based on formal constraints
Amigó, E., Gonzalo, J., Artiles, J., & Verdejo, F. (2009) · Information Retrieval · doi:10.1007/s10791-008-9066-8 · Cited by 831
Energy-aware adaptation for mobile applications
Flinn, J., & Satyanarayanan, M. (1999) · Proceedings of the seventeenth ACM symposium on Operating systems principles · doi:10.1145/319151.319155 · Cited by 596
Green: a framework for supporting energy-conscious programming using controlled approximation
Baek, W., & Chilimbi, T. M. (2010) · Proceedings of the 31st ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/1806596.1806620 · Cited by 440
Articulated Body Motion Capture by Stochastic Search
Deutscher, J., & Reid, I. (2005) · International Journal of Computer Vision · doi:10.1023/b:visi.0000043757.18370.9c · Cited by 412
PetaBricks: a language and compiler for algorithmic choice
Ansel, J., Chan, C., Wong, Y. L., Olszewski, M., Zhao, Q., Edelman, A., & Amarasinghe, S. (2009) · Proceedings of the 30th ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/1542476.1542481 · Cited by 355
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
Self-citationActive Harmony: Towards Automated Performance Tuning
Tapus, C., Chung, I.-H., & Hollingsworth, J. K. (2002) · ACM/IEEE SC 2002 Conference (SC'02) · doi:10.1109/sc.2002.10062 · Cited by 286
Misailovic, S., Sidiroglou, S., Hoffmann, H., & Rinard, M. (2010) · Proceedings of the 32nd ACM/IEEE International Conference on Software Engineering - Volume 1 · doi:10.1145/1806799.1806808 · Cited by 224
Self-citationSPL: a language and compiler for DSP algorithms
Xiong, J., Johnson, J., Johnson, R., & Padua, D. (2001) · Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation · doi:10.1145/378795.378860 · Cited by 191
Probabilistic accuracy bounds for fault-tolerant computations that discard tasks
Rinard, M. (2006) · Proceedings of the 20th annual international conference on Supercomputing · doi:10.1145/1183401.1183447 · Cited by 183
Self-citationChaudhuri, S., Gulwani, S., Lublinerman, R., & Navidpour, S. M. (2011) · ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering (ESEC/FSE) · doi:10.1145/2025113.2025131 · Cited by 136
Using Code Perforation to Improve Performance, Reduce Energy Consumption, and Respond to Failures
Agarwal, A., Rinard, M., Sidiroglou, S., Misailovíc, S., & Hoffmann, H. (2009) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 133
Self-citationContinuity analysis of programs
Chaudhuri, S., Gulwani, S., & Lublinerman, R. (2010) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/1706299.1706308 · Cited by 110
Parallelizing Sequential Programs with Statistical Accuracy Tests
Misailovíc, S., Kim, D., & Rinard, M. (2013) · ACM Transactions on Embedded Computing Systems · doi:10.1145/2465787.2465790 · Cited by 104
Self-citationBest-effort parallel execution framework for Recognition and mining applications
Meng, J., Chakradhar, S., & Raghunathan, A. (2009) · IEEE International Parallel and Distributed Processing Symposium (IPDPS) · doi:10.1109/ipdps.2009.5160991 · Cited by 101
Using early phase termination to eliminate load imbalances at barrier synchronization points
Rinard, M. (2007) · ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA) · doi:10.1145/1297027.1297055 · Cited by 90
Self-citationProbabilistically Accurate Program Transformations
Misailovíc, S., Roy, D. M., & Rinard, M. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-23702-7_24 · Cited by 87
Self-citationExploiting the forgiving nature of applications for scalable parallel execution
Mengte, J., Raghunathan, A., Chakradhar, S., & Byna, S. (2010) · IEEE International Parallel and Distributed Processing Symposium (IPDPS) · doi:10.1109/ipdps.2010.5470469 · Cited by 55
Patterns and statistical analysis for understanding reduced resource computing
Rinard, M., Hoffmann, H., Misailovíc, S., & Sidiroglou, S. (2010) · Conference on Object-Oriented Programming Systems, Languages, and Applications · doi:10.1145/1869459.1869525 · Cited by 45
Self-citationAutomatic Parallelization With Statistical Accuracy Bounds
Kim, D., Misailovíc, S., & Rinard, M. (2010) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 7
Self-citation
Cited by
A Survey of Techniques for Approximate Computing
Mittal, S. (2016) · ACM Computing Surveys · doi:10.1145/2893356 · Cited by 1,058
Neural Acceleration for General-Purpose Approximate Programs
Esmaeilzadeh, H., Sampson, A., Ceze, L., & Burger, D. (2012) · 2012 45th Annual IEEE/ACM International Symposium on Microarchitecture · doi:10.1109/micro.2012.48 · Cited by 626
Analysis and characterization of inherent application resilience for approximate computing
Chippa, V. K., Chakradhar, S. T., Roy, K., & Raghunathan, A. (2013) · Proceedings of the 50th Annual Design Automation Conference · doi:10.1145/2463209.2488873 · Cited by 546
Automatic Software Repair: A Bibliography
Monperrus, M. (2019) · ACM Computing Surveys · doi:10.1145/3105906 · Cited by 321
A survey of data partitioning and sampling methods to support big data analysis
Mahmud, M. S., Huang, J. Z., Salloum, S., Emara, T. Z., & Sadatdiynov, K. (2020) · Big Data Mining and Analytics · doi:10.26599/bdma.2019.9020015 · Cited by 282
Metadata
- Authors
- Sidiroglou-Douskos, S., Misailovic, S., Hoffmann, H., & Rinard, M.
- Venue
- Proceedings of the 19th ACM SIGSOFT symposium and the 13th European conference on Foundations of software engineering
- Publisher
- ACM
- Published
- 2011-09-09
- Pages
- 124-134
- OpenAlex
- W2142883190
- Cited by
- 505
- References
- 28
- FWCI
- 13.85
- 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
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.