https://arxiv.org/abs/2405.06127

Skip to main content
Cornell University
We gratefully acknowledge support from the Simons Foundation, member
institutions, and all contributors. Donate
 
arxiv logo > cs > arXiv:2405.06127
[                    ]

Help | Advanced Search

[All fields        ]
Search
arXiv logo
Cornell University Logo
[                    ] GO
quick links

  * Login
  * Help Pages
  * About

Computer Science > Logic in Computer Science

arXiv:2405.06127 (cs)
[Submitted on 9 May 2024]

Title:Efficiently Synthesizing Lowest Cost Rewrite Rules for
Instruction Selection

Authors:Ross Daly, Caleb Donovick, Caleb Terrill, Jackson Melchert,
Priyanka Raina, Clark Barrett, Pat Hanrahan
View a PDF of the paper titled Efficiently Synthesizing Lowest Cost
Rewrite Rules for Instruction Selection, by Ross Daly and 6 other
authors
View PDF HTML (experimental)

    Abstract:Compiling programs to an instruction set architecture
    (ISA) requires a set of rewrite rules that map patterns
    consisting of compiler instructions to patterns consisting of ISA
    instructions. We synthesize such rules by constructing SMT
    queries, where solutions represent two functionally equivalent
    programs. These two programs are interpreted as an instruction
    selection rewrite rule. Furthermore, we address existing work's
    limitations by developing a set of optimizations that prevent
    synthesis of duplicate rules, composite rules, and higher-cost
    rules. We evaluate our algorithm on multiple ISAs. Without our
    optimizations, the majority of synthesized rewrite rules are
    either duplicates or higher cost. With our optimizations, we only
    synthesize unique and lowest-cost rules, resulting in total
    speedups of up to 212x.

Subjects: Logic in Computer Science (cs.LO); Hardware Architecture
          (cs.AR)
Cite as:  arXiv:2405.06127 [cs.LO]
          (or arXiv:2405.06127v1 [cs.LO] for this version)
          https://doi.org/10.48550/arXiv.2405.06127
          Focus to learn more
          arXiv-issued DOI via DataCite

Submission history

From: Ross Daly [view email]
[v1] Thu, 9 May 2024 22:11:26 UTC (226 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled Efficiently Synthesizing Lowest
    Cost Rewrite Rules for Instruction Selection, by Ross Daly and 6
    other authors
  * View PDF
  * HTML (experimental)
  * TeX Source
  * Other Formats

license icon view license
Current browse context:
cs.LO
< prev   |   next >
new | recent | 2405
Change to browse by:
cs
cs.AR

References & Citations

  * NASA ADS
  * Google Scholar
  * Semantic Scholar

a export BibTeX citation Loading...

BibTeX formatted citation

x
[loading...          ]
Data provided by:

Bookmark

BibSonomy logo Reddit logo
(*) Bibliographic Tools

Bibliographic and Citation Tools

[ ] Bibliographic Explorer Toggle
Bibliographic Explorer (What is the Explorer?)
[ ] Litmaps Toggle
Litmaps (What is Litmaps?)
[ ] scite.ai Toggle
scite Smart Citations (What are Smart Citations?)
( ) Code, Data, Media

Code, Data and Media Associated with this Article

[ ] Links to Code Toggle
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
[ ] DagsHub Toggle
DagsHub (What is DagsHub?)
[ ] GotitPub Toggle
Gotit.pub (What is GotitPub?)
[ ] Links to Code Toggle
Papers with Code (What is Papers with Code?)
[ ] ScienceCast Toggle
ScienceCast (What is ScienceCast?)
( ) Demos

Demos

[ ] Replicate Toggle
Replicate (What is Replicate?)
[ ] Spaces Toggle
Hugging Face Spaces (What is Spaces?)
[ ] Spaces Toggle
TXYZ.AI (What is TXYZ.AI?)
( ) Related Papers

Recommenders and Search Tools

[ ] Link to Influence Flower
Influence Flower (What are Influence Flowers?)
[ ] Connected Papers Toggle
Connected Papers (What is Connected Papers?)
[ ] Core recommender toggle
CORE Recommender (What is CORE?)

  * Author
  * Venue
  * Institution
  * Topic

( ) About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and
share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have
embraced and accepted our values of openness, community, excellence,
and user data privacy. arXiv is committed to these values and only
works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community?
Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is
MathJax?)

  * About
  * Help

  * Click here to contact arXiv Contact
  * Click here to subscribe Subscribe

  * Copyright
  * Privacy Policy

  * Web Accessibility Assistance
  * arXiv Operational Status
    Get status notifications via email or slack