Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 206,118,424 papers from all fields of science
Search
Sign In
Create Free Account
Run-time algorithm specialisation
Known as:
Run-time algorithm specialization
, Specialising compiler
, Specializing compiler
In computer science, run-time algorithm specialization is a methodology for creating efficient algorithms for costly computation tasks of certain…
Expand
Wikipedia
Create Alert
Alert
Related topics
Related topics
9 relations
Abstract machine
Automated theorem proving
Computer science
Multi-stage programming
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Improving OpenCL Performance by Specializing Compiler Phase Selection and Ordering
Ricardo Nobre
,
Luís Reis
,
João MP Cardoso
ArXiv
2018
Corpus ID: 53086035
Automatic compiler phase selection/ordering has traditionally been focused on CPUs and, to a lesser extent, FPGAs. We present…
Expand
2014
2014
Singe: leveraging warp specialization for high performance on GPUs
Michael Bauer
,
Sean Treichler
,
A. Aiken
PPoPP '14
2014
Corpus ID: 18414110
We present Singe, a Domain Specific Language (DSL) compiler for combustion chemistry that leverages warp specialization to…
Expand
2004
2004
Efficient Checking of Term Ordering Constraints
A. Riazanov
,
A. Voronkov
IJCAR
2004
Corpus ID: 32115044
Simplification orderings on terms play a crucial role in reducing the search space in paramodulation-based theorem proving. Such…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
,
Terms of Service
, and
Dataset License
ACCEPT & CONTINUE