New Techniques for Adaptive Program OptimizationLiving organisms are adapted to their environment. Modern compilers and runtime systems for computer software are no different: as part of a continuous optimization process, they can adapt the execution cycle of a program to the workload it operates on. This thesis brings novel ideas to the software optimization domain. It illustrates methodological and practical contributions that advance the state of the art for performance profiling techniques and adaptive runtime designs, backed by promising experimental results on industrial-strength benchmarks. Part of the results has been presented in flagship programming language venues. |
Cosa dicono le persone - Scrivi una recensione
Nessuna recensione trovata nei soliti posti.
Parole e frasi comuni
adaptive algorithm analysis applications approach average Ball-Larus benchmarks block bursting calling contexts collected compensation code compiler Computer Conference construction contains continuation counter data structure debugging defined Definition Design discuss dynamic edge effective efficient entry evaluate example execution experimental experiments Figure follows forest frequency function given graph HCCT implementation insert instructions ISBN iterations k-SF language live LLVM locations loop memory method nodes observe operations optimization optimized code original OSR mapping OSR points OSR transition overhead passes path profiling performance possible present problem Proceedings Programming Language reconstruct replacement reported represented routine running runtime sequence space static stream structure Systems techniques tion trace transformations tree typically values variables virtual York
Informazioni bibliografiche
| Titolo | New Techniques for Adaptive Program Optimization Volume 88 di Studi e Ricerche |
| Autore | Daniele Cono D’Elia |
| Editore | Sapienza Università Editrice, 2020 |
| ISBN | 8893771438, 9788893771436 |
| Lunghezza | 204 pagine |
| Esporta citazione | BiBTeX EndNote RefMan |