Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Winston: Revisiting iterative compilation for WCET minimization

Autor: Pasquale, Valentin, Puaut, Isabelle

Publikováno v: RTNS 2022-30th International Conference on Real-Time Networks and Systems
RTNS 2022-30th International Conference on Real-Time Networks and Systems, Jun 2022, Paris, France. pp.1-11, ⟨10.1145/3534879.3534899⟩

International audience; Static Worst-Case Execution Time (WCET) estimation techniques take as input the binary code of a program and output a conservative estimate of its execution time. While compilers, and iterative compilation, usually optimize fo

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::efaf5893db6a6ef1b03f61118a2778a1
https://inria.hal.science/hal-03673668

Iterative Compilation Optimization Based on Metric Learning and Collaborative Filtering

Autor: Hongzhi Liu, Jie Luo, Ying Li, Zhonghai Wu

Publikováno v: ACM Transactions on Architecture and Code Optimization. 19:1-25

Pass selection and phase ordering are two critical compiler auto-tuning problems. Traditional heuristic methods cannot effectively address these NP-hard problems especially given the increasing number of compiler passes and diverse hardware architect

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::e44b1474696b6bb0c76d7ed148576269
https://doi.org/10.1145/3480250

Reconciling Compiler Optimizations and WCET Estimation Using Iterative Compilation

Autor: Mickaël Dardaillon, Stefanos Skalistis, Steven Derrien, Isabelle Puaut

Publikováno v: RTSS 2019-40th IEEE Real-Time Systems Symposium
RTSS 2019-40th IEEE Real-Time Systems Symposium, Dec 2019, Hong Kong, China. pp.1-13
HAL
RTSS

Static Worst-Case Execution Time (WCET) estimation techniques operate upon the binary code of a program in order to provide the necessary input for schedulability analysis techniques. Compilers used to generate this binary code include tens of optimi

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ec2dcc8eb4a37c9f9e4915fab88362f3
https://hal.science/hal-02286164

Minimizing the cost of iterative compilation with active learning

Autor: William F. Ogilvie, Pavlos Petoumenos, Zheng Wang, Hugh Leather

Publikováno v: Ogilvie, W, Petoumenos, P, Wang, Z & Leather, H 2017, Minimizing the cost of iterative compilation with active learning . in 2017 IEEE/ACM International Symposium on Code Generation and Optimization (CGO) . Institute of Electrical and Electronics Engineers (IEEE), pp. 245-256, International Symposium on Code Generation and Optimization (CGO) 2017, Austin, Texas, United States, 4/02/17 . https://doi.org/10.1109/CGO.2017.7863744
Ogilvie, W F, Petoumenos, P, Wang, Z & Leather, H 2017, Minimizing the cost of iterative compilation with active learning . in V J Reddi, A Smith & L Tang (eds), CGO 2017-Proceedings of the 2017 International Symposium on Code Generation and Optimization ., 7863744, CGO 2017-Proceedings of the 2017 International Symposium on Code Generation and Optimization, IEEE, pp. 245-256, 2017 International Symposium on Code Generation and Optimization, Austin, United States, 4/02/17 . https://doi.org/10.1109/CGO.2017.7863744

Since performance is not portable between platforms, engineers must fine-tune heuristics for each processor in turn. This is such a laborious task that high-profile compilers, supporting many architectures, cannot keep up with hardware innovation and

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::94b957478dab3fd3dd0cc83aaf62fd68
https://www.pure.ed.ac.uk/ws/files/29478243/paper.pdf