Re:ThinLTO: Scalable and Incremental Link-Time Optimization ...
by tmd83 on Thursday June 23, 2016 @12:42PM
(#11962382)
I didn't understand fully what it took to achieve this but simply looking at the numbers it is so clear how impressive the work is. Near or better performance with enormously fast build time, significant improvement in incremental compilation and enormous reduction in memory usage. Its unusual to see an optimization attempt succeed from so many different angle.
[ Parent
| on HN ]
Re:ThinLTO: Scalable and Incremental Link-Time Optimization ...
by aseipp on Thursday June 23, 2016 @01:04PM
(#11962571)
It's been in the works for quite a while (I remember reading some of the initial RFC postings), although I haven't seen people talk much of it until now. To be fair, I believe this work was primarily done by Google, who also have contributed a lot code to LTO/IPO-based systems in GCC before (such as "Lightweight IPO" or LIPO in GCC) as well as obvious, ongoing Clang/LLVM work. So I imagine they probably had a very good idea of what was necessary to achieve all that... But yes, the results are really impressive!
Here are some slides from EuroLLVM last year with some pretty graphs and comparisons to traditional LTO/LIPO: http://llvm.org/devmtg/2015-04/slides/ThinLTO_EuroLLVM2015.p...
Re:ThinLTO: Scalable and Incremental Link-Time Optimization ...
by DannyBee on Thursday June 23, 2016 @04:47PM
(#11964202)
"Its unusual to see an optimization attempt succeed from so many different angle."
David, Teresa, and Mehdi are really amazing engineers.
(also, this is the third or so LTO system some of them have built :P)