A Note on Exhaustive State Space Search for Efficient Code Generation

06/24/2021
by   Aart J. C. Bik, et al.
0

This note explores state space search to find efficient instruction sequences that perform particular data manipulations. Once found, the instruction sequences are hard-wired in the code generator that needs these data manipulations. Since state space is only searched while developing the compiler, search time is not at a premium, which allows exhaustively searching for the best possible instruction sequences.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/22/2023

Further Decimating the Inductive Programming Search Space with Instruction Digrams

Overlapping instruction subsets derived from human originated code have ...
research
05/14/2019

Parallel and Memory-limited Algorithms for Optimal Task Scheduling Using a Duplicate-Free State-Space

The problem of task scheduling with communication delays is strongly NP-...
research
10/19/2012

An Axiomatic Approach to Robustness in Search Problems with Multiple Scenarios

This paper is devoted to the search of robust solutions in state space g...
research
10/18/2021

State-Space Constraints Improve the Generalization of the Differentiable Neural Computer in some Algorithmic Tasks

Memory-augmented neural networks (MANNs) can solve algorithmic tasks lik...
research
01/25/2019

Program algebra for Turing-machine programs

This note presents an algebraic theory of instruction sequences with ins...
research
07/18/2021

A note on the article "On Exploiting Spectral Properties for Solving MDP with Large State Space"

We improve a theoretical result of the article "On Exploiting Spectral P...

Please sign up or login with your details

Forgot password? Click here to reset