4 ms·
It's been done: http://theory.stanford.edu/~aiken/publications/papers/asplos06.pdf http://theory.stanford.edu/~aiken/publications/papers/asplos... They had to
by cwzwarich 11y ago
It's been done:
http://theory.stanford.edu/~aiken/publications/papers/asplos06.pdf http://theory.stanford.edu/~aiken/publications/papers/asplos...
They had to restrict themselves to instruction sequences of length 3 due to limited resources, and say that to go beyond instruction sequences of length 4 they would need a better approach.
- fulafel 11y agoThis has been done in '87 by Massalin: https://www.cs.arizona.edu/~collberg/Teaching/553/2011/Resources/superoptimizer-massalin.pdf https://www.cs.arizona.edu/~collberg/Teaching/553/2011/Resou... (both are brute force though, not solver-based)
- cwzwarich 11y agoMassalin's superoptimizer required humans to check the correctness of optimizations. It also didn't generate parameterized peephole optimizations; it directly optimized concrete instruction sequences.