{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:16:44Z","timestamp":1750220204380,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,6,7]],"date-time":"2022-06-07T00:00:00Z","timestamp":1654560000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"European Union's Horizon 2020 Research and Innovation Programme","award":["779882"],"award-info":[{"award-number":["779882"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,6,7]]},"DOI":"10.1145\/3534879.3534889","type":"proceedings-article","created":{"date-parts":[[2022,6,6]],"date-time":"2022-06-06T16:12:47Z","timestamp":1654531967000},"page":"162-172","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Approximating WCET and Energy Consumption for Fast Multi-Objective Memory Allocation"],"prefix":"10.1145","author":[{"given":"Shashank","family":"Jadhav","sequence":"first","affiliation":[{"name":"Institute of Embedded Systems, Hamburg University of Technology (TUHH), Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Heiko","family":"Falk","sequence":"additional","affiliation":[{"name":"Institute of Embedded Systems, Hamburg University of Technology (TUHH), Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,6,7]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"AbsInt Angewandte Informatik GmbH. 2021. aiT Worst-Case Execution Time Analyzers.  AbsInt Angewandte Informatik GmbH. 2021. aiT Worst-Case Execution Time Analyzers."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSNS.2015.7292406"},{"key":"e_1_3_2_1_3_1","volume-title":"17th International Workshop on Worst-Case Execution Time Analysis (WCET","author":"Bonenfant Armelle","year":"2017","unstructured":"Armelle Bonenfant , Denis Claraz , Marianne De\u00a0Michiel , and Pascal Sotin . 2017 . Early WCET prediction using machine learning . In 17th International Workshop on Worst-Case Execution Time Analysis (WCET 2017). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. Armelle Bonenfant, Denis Claraz, Marianne De\u00a0Michiel, and Pascal Sotin. 2017. Early WCET prediction using machine learning. In 17th International Workshop on Worst-Case Execution Time Analysis (WCET 2017). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik."},{"key":"e_1_3_2_1_4_1","volume-title":"16th International Workshop on Worst-Case Execution Time Analysis (WCET","author":"Falk Heiko","year":"2016","unstructured":"Heiko Falk , Sebastian Altmeyer , Peter Hellinckx , Bj\u00f6rn Lisper , Wolfgang Puffitsch , Christine Rochange , Martin Schoeberl , Rasmus\u00a0Bo S\u00f8rensen , Peter W\u00e4gemann , and Simon Wegener . 2016 . TACLeBench: A benchmark collection to support worst-case execution time research . In 16th International Workshop on Worst-Case Execution Time Analysis (WCET 2016). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik. Heiko Falk, Sebastian Altmeyer, Peter Hellinckx, Bj\u00f6rn Lisper, Wolfgang Puffitsch, Christine Rochange, Martin Schoeberl, Rasmus\u00a0Bo S\u00f8rensen, Peter W\u00e4gemann, and Simon Wegener. 2016. TACLeBench: A benchmark collection to support worst-case execution time research. In 16th International Workshop on Worst-Case Execution Time Analysis (WCET 2016). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1629911.1630101"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11241-010-9101-x"},{"key":"e_1_3_2_1_7_1","volume-title":"Compile-Time Decided Instruction Cache Locking Using Worst-Case Execution Paths. In International Conference on Hardware\/Software Codesign and System Synthesis (CODES+ISSS). 143\u2013148","author":"Falk Heiko","year":"2007","unstructured":"Heiko Falk , Sascha Plazar , and Henrik Theiling . 2007 . Compile-Time Decided Instruction Cache Locking Using Worst-Case Execution Paths. In International Conference on Hardware\/Software Codesign and System Synthesis (CODES+ISSS). 143\u2013148 . DOI 10.1145\/1289816.1289853. Heiko Falk, Sascha Plazar, and Henrik Theiling. 2007. Compile-Time Decided Instruction Cache Locking Using Worst-Case Execution Paths. In International Conference on Hardware\/Software Codesign and System Synthesis (CODES+ISSS). 143\u2013148. DOI 10.1145\/1289816.1289853."},{"key":"e_1_3_2_1_8_1","volume-title":"10th International Workshop on Worst-Case Execution Time Analysis (WCET","author":"Gustafsson Jan","year":"2010","unstructured":"Jan Gustafsson , Adam Betts , Andreas Ermedahl , and Bj\u00f6rn Lisper . 2010 . The M\u00e4lardalen WCET benchmarks: Past, present and future . In 10th International Workshop on Worst-Case Execution Time Analysis (WCET 2010). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. Jan Gustafsson, Adam Betts, Andreas Ermedahl, and Bj\u00f6rn Lisper. 2010. The M\u00e4lardalen WCET benchmarks: Past, present and future. In 10th International Workshop on Worst-Case Execution Time Analysis (WCET 2010). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1356058.1356080"},{"key":"e_1_3_2_1_10_1","volume-title":"18th International Workshop on Worst-Case Execution Time Analysis (WCET","author":"Huybrechts Thomas","year":"2018","unstructured":"Thomas Huybrechts , Siegfried Mercelis , and Peter Hellinckx . 2018 . A new hybrid approach on WCET analysis for real-time systems using machine learning . In 18th International Workshop on Worst-Case Execution Time Analysis (WCET 2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. Thomas Huybrechts, Siegfried Mercelis, and Peter Hellinckx. 2018. A new hybrid approach on WCET analysis for real-time systems using machine learning. In 18th International Workshop on Worst-Case Execution Time Analysis (WCET 2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ESTMED.2007.4375794"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3323439.3323977"},{"key":"e_1_3_2_1_13_1","volume-title":"Asia and South Pacific Design Automation Conference (ASP-DAC). 612\u2013617","author":"Janapsatya Andhi","year":"2006","unstructured":"Andhi Janapsatya , Aleksandar Ignjatovi\u0107 , and Sri Parameswaran . 2006 . A novel instruction scratchpad memory optimization method based on concomitance metric . In Asia and South Pacific Design Automation Conference (ASP-DAC). 612\u2013617 . Andhi Janapsatya, Aleksandar Ignjatovi\u0107, and Sri Parameswaran. 2006. A novel instruction scratchpad memory optimization method based on concomitance metric. In Asia and South Pacific Design Automation Conference (ASP-DAC). 612\u2013617."},{"volume-title":"Complexity of computer computations","author":"Karp M","key":"e_1_3_2_1_14_1","unstructured":"Richard\u00a0 M Karp . 1972. Reducibility among combinatorial problems . In Complexity of computer computations . Springer , 85\u2013103. Richard\u00a0M Karp. 1972. Reducibility among combinatorial problems. In Complexity of computer computations. Springer, 85\u2013103."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.1079"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.23919\/DATE.2017.7927149"},{"key":"e_1_3_2_1_17_1","volume-title":"Multi-Criteria Compiler-Based Optimizations of Hard Real-Time Systems. In In Proc. of SCOPES","author":"Muts Kateryna","year":"2018","unstructured":"Kateryna Muts , Arno Luppold , and Heiko Falk . 2018 . Multi-Criteria Compiler-Based Optimizations of Hard Real-Time Systems. In In Proc. of SCOPES ( Sankt Goar, Germany). ACM. Kateryna Muts, Arno Luppold, and Heiko Falk. 2018. Multi-Criteria Compiler-Based Optimizations of Hard Real-Time Systems. In In Proc. of SCOPES (Sankt Goar, Germany). ACM."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2906363.2906371"},{"key":"e_1_3_2_1_19_1","volume-title":"Proceedings of the 29th Euromicro Conference on Real-Time Systems (ECRTS). Dubrovnik \/ Croatia.","author":"Oehlert Dominic","year":"2017","unstructured":"Dominic Oehlert , Arno Luppold , and Heiko Falk . 2017 . Bus-aware Static Instruction SPM Allocation for Multicore Hard Real-Time Systems . In Proceedings of the 29th Euromicro Conference on Real-Time Systems (ECRTS). Dubrovnik \/ Croatia. Dominic Oehlert, Arno Luppold, and Heiko Falk. 2017. Bus-aware Static Instruction SPM Allocation for Multicore Hard Real-Time Systems. In Proceedings of the 29th Euromicro Conference on Real-Time Systems (ECRTS). Dubrovnik \/ Croatia."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcp.2007.06.008"},{"volume-title":"Recent advances in swarm intelligence and evolutionary computation","author":"Rodrigues Douglas","key":"e_1_3_2_1_21_1","unstructured":"Douglas Rodrigues , Xin-She Yang , Andr\u00e9\u00a0Nunes De\u00a0Souza , and Jo\u00e3o\u00a0Paulo Papa . 2015. Binary flower pollination algorithm and its application to feature selection . In Recent advances in swarm intelligence and evolutionary computation . Springer , 85\u2013100. Douglas Rodrigues, Xin-She Yang, Andr\u00e9\u00a0Nunes De\u00a0Souza, and Jo\u00e3o\u00a0Paulo Papa. 2015. Binary flower pollination algorithm and its application to feature selection. In Recent advances in swarm intelligence and evolutionary computation. Springer, 85\u2013100."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysarc.2021.102116"},{"volume-title":"The compiler design handbook: optimizations and machine code generation","author":"Srikant YN","key":"e_1_3_2_1_23_1","unstructured":"YN Srikant and Priti Shankar . 2018. The compiler design handbook: optimizations and machine code generation . CRC Press . YN Srikant and Priti Shankar. 2018. The compiler design handbook: optimizations and machine code generation. CRC Press."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/DATE.2002.998306"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTSS.2005.45"},{"key":"e_1_3_2_1_26_1","unstructured":"TeamPlay Consortium. 2020. Deliverable D4.5 - Report on Energy Usage Analysis and on Prototype - Version 1.0.  TeamPlay Consortium. 2020. Deliverable D4.5 - Report on Energy Usage Analysis and on Prototype - Version 1.0."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1080\/0305215X.2013.832237"},{"key":"e_1_3_2_1_28_1","unstructured":"Eckart Zitzler. 1999. Evolutionary algorithms for multiobjective optimization: Methods and applications. Vol.\u00a063. Citeseer.  Eckart Zitzler. 1999. Evolutionary algorithms for multiobjective optimization: Methods and applications. Vol.\u00a063. Citeseer."},{"key":"e_1_3_2_1_29_1","volume-title":"Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach","author":"Zitzler Eckart","year":"1999","unstructured":"Eckart Zitzler and Lothar Thiele . 1999. Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach . IEEE transactions on Evolutionary Computation 3, 4( 1999 ), 257\u2013271. Eckart Zitzler and Lothar Thiele. 1999. Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE transactions on Evolutionary Computation 3, 4(1999), 257\u2013271."}],"event":{"name":"RTNS 2022: The 30th International Conference on Real-Time Networks and Systems","acronym":"RTNS 2022","location":"Paris France"},"container-title":["Proceedings of the 30th International Conference on Real-Time Networks and Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3534879.3534889","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3534879.3534889","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:53Z","timestamp":1750186973000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3534879.3534889"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,7]]},"references-count":29,"alternative-id":["10.1145\/3534879.3534889","10.1145\/3534879"],"URL":"https:\/\/doi.org\/10.1145\/3534879.3534889","relation":{},"subject":[],"published":{"date-parts":[[2022,6,7]]},"assertion":[{"value":"2022-06-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}