CoChat

Stochastic superoptimization

Schkufza, Eric, Sharma, Rahul, Aiken, Alex · 2013 · ACM SIGARCH Computer Architecture News

The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.

Abstract

We formulate the loop-free binary superoptimization task as a stochastic search problem. The competing constraints of transformation correctness and performance improvement are encoded as terms in a cost function, and a Markov Chain Monte Carlo sampler is used to rapidly explore the space of all possible programs to find one that is an optimization of a given target program. Although our method sacrifices completeness, the scope of programs we are able to consider, and the resulting quality of the programs that we produce, far exceed those of existing superoptimizers. Beginning from binaries compiled by llvm -O0 for 64-bit x86, our prototype implementation, STOKE, is able to produce programs which either match or outperform the code produced by gcc -O3, icc -O3, and in some cases, expert handwritten assembly.

Overview

Integrity signals

Registry

Crossref · 10.1145/2490301.2451150

Cites

15 of 15 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Citations

Cites

Research works printed but not linked: 5

  1. Cadar C., 2008, OSDI, 209
  2. Ganesh V., 2007, CAV, 519
  3. Gilks W. R., 1999, Chapman and Hall/CRC
  4. Liang P., 2010, ICML, 639
  5. Warren H. S., 2002, Inc.

Cited by

See all 104

Metadata

Authors
Schkufza, E., Sharma, R., & Aiken, A.
Affiliations
Stanford University (US)
Venue
ACM SIGARCH Computer Architecture News
Published
2013-03-16
Volume
41
Issue
1
Pages
305-316
ISSN
0163-5964 (ISSN-L)
OpenAlex
W4299968636
Cited by
57
References
15
Citations by year
2026: 5 · 2025: 7 · 2024: 4 · 2023: 8 · 2022: 6 · 2021: 10 · 2020: 5 · 2019: 2 · 2018: 1 · 2017: 3 · 2016: 2 · 2015: 2 · 2014: 2
FWCI
3.75
Type
journal article
Language
en
Open access
closed
Locations
ACM SIGARCH Computer Architecture News (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Hardware and Architecture › Parallel Computing and Optimization Techniques
  • Physical Sciences › Computer Science › Software › Logic, programming, and type systems
  • Physical Sciences › Computer Science › Hardware and Architecture › Embedded Systems Design Techniques
Keywords
stochastic search, Markov chain Monte Carlo, program transformation, program optimization, Stokes, x86 assembly

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.