Fast-path loop unrolling of non-counted loops to enable subsequent compiler optimizations
2018pp. 1–13
Citations Over Time
David Leopoldseder, Roland Schatz, Lukas Stadler, Manuel Rigger, Thomas Würthinger, Hanspeter Mössenböck
Abstract
Java programs can contain non-counted loops, that is, loops for which the iteration count can neither be determined at compile time nor at run time. State-of-the-art compilers do not aggressively optimize them, since unrolling non-counted loops often involves duplicating also a loop's exit condition, which thus only improves run-time performance if subsequent compiler optimizations can optimize the unrolled code.
Related Papers
- → The use of compiler optimizations for embedded systems software(2008)7 cited
- Cassyopia: compiler assisted system optimization(2003)
- Application Performance Evaluation on Different Compiler Optimizations(2013)
- Statistical compiler tuning(2006)
- → Code Transformation Impact on Compiler-based Optimization: A Case Study in the CMSSW(2021)