3 ms·
A friend recently defended his doctoral thesis on using constraint-based optimization in compiler backends (reg alloc and instr shed).
by ananya_muddu 8y ago
A friend recently defended his doctoral thesis on using constraint-based optimization in compiler backends (reg alloc and instr shed).
- ananya_muddu 8y agoLink to thesis: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-232192 http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-232192
- CalChris 8y agoLazano did the Unison combined RA + scheduler. Cool that he followed through and got his PhD. Register Allocation and Instruction Scheduling in Unison http://llvm.org/devmtg/2017-03//assets/slides/register_allocation_and_instruction_scheduling_in_unison.pdf http://llvm.org/devmtg/2017-03//assets/slides/register_alloc...
- DannyBee 8y agoConstraint based optimization in those areas is not actually that new, i've seen about 50 different approaches in the past 20 years ;P This one is somewhere in the middle, to be honest (no offense meant to your friend). I realize what people writing research papers have to deal with (really!), but the words "scales to 837 instructions" and "practical" should never appear in the same abstract. PBQP and friends can handle larger functions in better time bounds (and give near-optimal or optimal results for the problem they solve). This is one reason PBQP is actually part of LLVM mainline. Unison (the framework your friend uses), will never be part of LLVM (or GCC, or ...) unfortunately.