Superoptimizer – A Look at the Smallest Program (1987) [pdf]
1–10 of 10 posts
Re: Superoptimizer – A Look at the Smallest Program (1987) [pdf]
#2Re: Superoptimizer – A Look at the Smallest Program (1987) [pdf]
#3Re: Superoptimizer – A Look at the Smallest Program (1987) [pdf]
#4Re: Superoptimizer – A Look at the Smallest Program (1987) [pdf]
#5Same author did the synthesis kernel with Carl Pu, I think? The Synthesis kernel was genius, but relied on self modifying code, so can't work with modern chips well.
update: oh, I just remembered why it _is_ an issue for modern processors, Massalin leaned very heavily on the general purpose double compare-and-swap that was present on some generations of the 68k architecture, and x86-64 only has double contiguous compare and swap
Re: Superoptimizer – A Look at the Smallest Program (1987) [pdf]
#6It constantly trys to do the most things with the least things. Take all the shortcuts to achieve the same outcome, often misconstrued with laziness, quality deficiency, or hard to understand.
For example, something as simple as timing may superoptimize and minimize instruction sets. Using one resource to do all the things needed at once versus calling the resource multiple times at different times shrinks the overall program a lot.
Re: Superoptimizer – A Look at the Smallest Program (1987) [pdf]
#7Re: Superoptimizer – A Look at the Smallest Program (1987) [pdf]
#8Same author did the synthesis kernel with Carl Pu, I think? The Synthesis kernel was genius, but relied on self modifying code, so can't work with modern chips well.
yes. Calton Pu. is that really such a problem? JITs seem to work pretty well, I'm pretty sure synthesis was more about creating custom paths than being strictly self-modifying, but it's been a long time. update: oh, I just remembered why it _is_ an issue for modern processors, Massalin leaned very heavily on the general purpose double compare-and-swap that was present on some generations of the 68k architecture, and…
Re: Superoptimizer – A Look at the Smallest Program (1987) [pdf]
#9(1987)
Re: Superoptimizer – A Look at the Smallest Program (1987) [pdf]
#10These are nifty data structures that can quickly search the space of equivalent programs.