Taking a Closer Look: An Outlier-Driven Approach to Compilation-Time Optimization
No abstract available.
Related papers
- A cost-driven compilation framework for speculative parallelization of sequential programs PLDI 2004
- Automated Algorithmic Error Resilience for Structured Grid Problems Based on Outlier Detection CGO 2014
- An Optimization-Driven Incremental Inline Substitution Algorithm for Just-in-Time Compilers CGO 2019
- Peep: an architectural description driven peephole optimizer PLDI 1984
- Clairvoyance: look-ahead compile-time scheduling CGO 2017
- "Look Ma, No Hashing, And No Arrays Neither" POPL 1991
- A Fresh Look at Optimizing Array Bound Checking PLDI 1990
- Intrepydd: performance, productivity, and portability for data science application kernels Onward! 2020