[{"citation":{"ieee":"K. Heider, C. Hakert, K.-H. Chen, and J.-J. Chen, “LazyTick: Lazy and Efficient Management of Job Release in Real-Time Operating Systems,” <i>ACM Transactions on Embedded Computing Systems</i>, vol. 24, no. 5s, pp. 1–25, 2025, doi: <a href=\"https://doi.org/10.1145/3762651\">10.1145/3762651</a>.","apa":"Heider, K., Hakert, C., Chen, K.-H., &#38; Chen, J.-J. (2025). LazyTick: Lazy and Efficient Management of Job Release in Real-Time Operating Systems. <i>ACM Transactions on Embedded Computing Systems</i>, <i>24</i>(5s), 1–25. <a href=\"https://doi.org/10.1145/3762651\">https://doi.org/10.1145/3762651</a>","short":"K. Heider, C. Hakert, K.-H. Chen, J.-J. Chen, ACM Transactions on Embedded Computing Systems 24 (2025) 1–25.","chicago":"Heider, Kay, Christian Hakert, Kuan-Hsun Chen, and Jian-Jia Chen. “LazyTick: Lazy and Efficient Management of Job Release in Real-Time Operating Systems.” <i>ACM Transactions on Embedded Computing Systems</i> 24, no. 5s (2025): 1–25. <a href=\"https://doi.org/10.1145/3762651\">https://doi.org/10.1145/3762651</a>.","mla":"Heider, Kay, et al. “LazyTick: Lazy and Efficient Management of Job Release in Real-Time Operating Systems.” <i>ACM Transactions on Embedded Computing Systems</i>, vol. 24, no. 5s, Association for Computing Machinery (ACM), 2025, pp. 1–25, doi:<a href=\"https://doi.org/10.1145/3762651\">10.1145/3762651</a>.","bibtex":"@article{Heider_Hakert_Chen_Chen_2025, title={LazyTick: Lazy and Efficient Management of Job Release in Real-Time Operating Systems}, volume={24}, DOI={<a href=\"https://doi.org/10.1145/3762651\">10.1145/3762651</a>}, number={5s}, journal={ACM Transactions on Embedded Computing Systems}, publisher={Association for Computing Machinery (ACM)}, author={Heider, Kay and Hakert, Christian and Chen, Kuan-Hsun and Chen, Jian-Jia}, year={2025}, pages={1–25} }","ama":"Heider K, Hakert C, Chen K-H, Chen J-J. LazyTick: Lazy and Efficient Management of Job Release in Real-Time Operating Systems. <i>ACM Transactions on Embedded Computing Systems</i>. 2025;24(5s):1-25. doi:<a href=\"https://doi.org/10.1145/3762651\">10.1145/3762651</a>"},"status":"public","page":"1-25","publisher":"Association for Computing Machinery (ACM)","_id":"66150","user_id":"128464","volume":24,"publication":"ACM Transactions on Embedded Computing Systems","issue":"5s","abstract":[{"text":"<jats:p>\n            Releasing jobs and performing scheduling decisions in real-time operating systems (RTOSes) is often realized within tick interrupts. In each tick interrupt, a set of tasks that are waiting to release new jobs, namely, the waiting set, is inspected to determine the jobs that should be released at this tick. Such a waiting set is sorted whenever a job has finished, by which the release process can be efficiently achieved. However, the overhead of sorting can vary vastly depending on the task set, which has to be taken into account in the worst-case timing analysis. Moreover, the tick interrupt in common practices is backed by a single hardware timer that is configured to trigger interrupts, either with a fixed period or reconfigured to the next release time (so-called one-shot timer). Since not necessarily at every interrupt a job will be released, several tick interrupts might be redundant. For the one-shot timers, the reconfiguration during runtime also incurs overheads at a variable interval. To reduce such variability and amount of overhead, in this work, we propose\n            <jats:italic toggle=\"yes\">LazyTick</jats:italic>\n            which partitions the task set and distributes the subsets over multiple timers. Specifically, we propose two job release procedures with constant operations overhead—one for harmonic task sets and one for non-harmonic task sets. We implemented the support for multiple hardware timers in FreeRTOS and conducted intensive experimental evaluations. The evaluation shows that\n            <jats:italic toggle=\"yes\">LazyTick</jats:italic>\n            can reduce the variability in overhead by up to ≈ 5 × in peak and ≈ 3× on average in comparison to the default implementation. Additionally, the combined overhead of the job release process is reduced by up to ≈ 6.1 × in peak and ≈ 3.6× on average.\n          </jats:p>","lang":"eng"}],"date_created":"2026-07-03T21:07:51Z","type":"journal_article","year":"2025","title":"LazyTick: Lazy and Efficient Management of Job Release in Real-Time Operating Systems","author":[{"last_name":"Heider","first_name":"Kay","full_name":"Heider, Kay"},{"first_name":"Christian","last_name":"Hakert","full_name":"Hakert, Christian"},{"first_name":"Kuan-Hsun","last_name":"Chen","full_name":"Chen, Kuan-Hsun"},{"full_name":"Chen, Jian-Jia","first_name":"Jian-Jia","last_name":"Chen"}],"publication_identifier":{"issn":["1539-9087","1558-3465"]},"publication_status":"published","date_updated":"2026-07-05T14:48:51Z","intvolume":"        24","language":[{"iso":"eng"}],"doi":"10.1145/3762651"},{"status":"public","year":"2024","title":"Introduction to Special Issue on In/Near Memory and Storage Computing for Embedded Systems","publication_identifier":{"issn":["1539-9087","1558-3465"]},"author":[{"first_name":"Liang","last_name":"Shi","full_name":"Shi, Liang"},{"full_name":"Shi, Jingtong","last_name":"Shi","first_name":"Jingtong"},{"full_name":"Amrouch, Hussam","first_name":"Hussam","last_name":"Amrouch"},{"first_name":"Kuan-Hsun","last_name":"Chen","full_name":"Chen, Kuan-Hsun"},{"full_name":"Zhao, Mengying","first_name":"Mengying","last_name":"Zhao"},{"last_name":"Liu","first_name":"Weichen","full_name":"Liu, Weichen"}],"publication_status":"published","date_updated":"2026-07-05T14:47:57Z","intvolume":"        23","page":"1-3","_id":"66166","language":[{"iso":"eng"}],"publisher":"Association for Computing Machinery (ACM)","user_id":"128464","doi":"10.1145/3677018","volume":23,"issue":"6","publication":"ACM Transactions on Embedded Computing Systems","citation":{"ama":"Shi L, Shi J, Amrouch H, Chen K-H, Zhao M, Liu W. Introduction to Special Issue on In/Near Memory and Storage Computing for Embedded Systems. <i>ACM Transactions on Embedded Computing Systems</i>. 2024;23(6):1-3. doi:<a href=\"https://doi.org/10.1145/3677018\">10.1145/3677018</a>","bibtex":"@article{Shi_Shi_Amrouch_Chen_Zhao_Liu_2024, title={Introduction to Special Issue on In/Near Memory and Storage Computing for Embedded Systems}, volume={23}, DOI={<a href=\"https://doi.org/10.1145/3677018\">10.1145/3677018</a>}, number={6}, journal={ACM Transactions on Embedded Computing Systems}, publisher={Association for Computing Machinery (ACM)}, author={Shi, Liang and Shi, Jingtong and Amrouch, Hussam and Chen, Kuan-Hsun and Zhao, Mengying and Liu, Weichen}, year={2024}, pages={1–3} }","mla":"Shi, Liang, et al. “Introduction to Special Issue on In/Near Memory and Storage Computing for Embedded Systems.” <i>ACM Transactions on Embedded Computing Systems</i>, vol. 23, no. 6, Association for Computing Machinery (ACM), 2024, pp. 1–3, doi:<a href=\"https://doi.org/10.1145/3677018\">10.1145/3677018</a>.","chicago":"Shi, Liang, Jingtong Shi, Hussam Amrouch, Kuan-Hsun Chen, Mengying Zhao, and Weichen Liu. “Introduction to Special Issue on In/Near Memory and Storage Computing for Embedded Systems.” <i>ACM Transactions on Embedded Computing Systems</i> 23, no. 6 (2024): 1–3. <a href=\"https://doi.org/10.1145/3677018\">https://doi.org/10.1145/3677018</a>.","short":"L. Shi, J. Shi, H. Amrouch, K.-H. Chen, M. Zhao, W. Liu, ACM Transactions on Embedded Computing Systems 23 (2024) 1–3.","apa":"Shi, L., Shi, J., Amrouch, H., Chen, K.-H., Zhao, M., &#38; Liu, W. (2024). Introduction to Special Issue on In/Near Memory and Storage Computing for Embedded Systems. <i>ACM Transactions on Embedded Computing Systems</i>, <i>23</i>(6), 1–3. <a href=\"https://doi.org/10.1145/3677018\">https://doi.org/10.1145/3677018</a>","ieee":"L. Shi, J. Shi, H. Amrouch, K.-H. Chen, M. Zhao, and W. Liu, “Introduction to Special Issue on In/Near Memory and Storage Computing for Embedded Systems,” <i>ACM Transactions on Embedded Computing Systems</i>, vol. 23, no. 6, pp. 1–3, 2024, doi: <a href=\"https://doi.org/10.1145/3677018\">10.1145/3677018</a>."},"date_created":"2026-07-03T21:11:12Z","type":"journal_article"},{"type":"journal_article","date_created":"2026-07-03T21:14:05Z","abstract":[{"lang":"eng","text":"<jats:p>Real-time systems require the formal guarantee of timing constraints, not only for the individual tasks but also for the end-to-end latency of data flows. The data flow among multiple tasks, e.g., from sensors to actuators, is described by a cause-effect chain, independent from the priority order of the tasks. In this article, we provide an end-to-end timing-analysis for cause-effect chains on asynchronized distributed systems with periodic task activations, considering the maximum reaction time (MRT) (i.e., the duration of data processing) and the maximum data age (MDA) (i.e., the worst-case data freshness). We first provide an analysis of the end-to-end latency on one local electronic control unit (ECU) that has to consider only the jobs in a bounded time interval. We extend our analysis to globally asynchronized systems by exploiting a compositional property to combine the local results. Throughout synthesized data based on an automotive benchmark as well as on randomized parameters, we show that our analytical results improve the state-of-the-art.</jats:p>"}],"publication":"ACM Transactions on Embedded Computing Systems","issue":"4","doi":"10.1145/3587036","language":[{"iso":"eng"}],"intvolume":"        22","date_updated":"2026-07-05T14:46:55Z","publication_status":"published","publication_identifier":{"issn":["1539-9087","1558-3465"]},"author":[{"full_name":"Günzel, Mario","last_name":"Günzel","first_name":"Mario"},{"last_name":"Chen","first_name":"Kuan-Hsun","full_name":"Chen, Kuan-Hsun"},{"full_name":"Ueter, Niklas","first_name":"Niklas","last_name":"Ueter"},{"full_name":"Brüggen, Georg von der","last_name":"Brüggen","first_name":"Georg von der"},{"full_name":"Dürr, Marco","first_name":"Marco","last_name":"Dürr"},{"last_name":"Chen","first_name":"Jian-Jia","full_name":"Chen, Jian-Jia"}],"year":"2023","title":"Compositional Timing Analysis of Asynchronized Distributed Cause-effect Chains","citation":{"chicago":"Günzel, Mario, Kuan-Hsun Chen, Niklas Ueter, Georg von der Brüggen, Marco Dürr, and Jian-Jia Chen. “Compositional Timing Analysis of Asynchronized Distributed Cause-Effect Chains.” <i>ACM Transactions on Embedded Computing Systems</i> 22, no. 4 (2023): 1–34. <a href=\"https://doi.org/10.1145/3587036\">https://doi.org/10.1145/3587036</a>.","short":"M. Günzel, K.-H. Chen, N. Ueter, G. von der Brüggen, M. Dürr, J.-J. Chen, ACM Transactions on Embedded Computing Systems 22 (2023) 1–34.","apa":"Günzel, M., Chen, K.-H., Ueter, N., Brüggen, G. von der, Dürr, M., &#38; Chen, J.-J. (2023). Compositional Timing Analysis of Asynchronized Distributed Cause-effect Chains. <i>ACM Transactions on Embedded Computing Systems</i>, <i>22</i>(4), 1–34. <a href=\"https://doi.org/10.1145/3587036\">https://doi.org/10.1145/3587036</a>","ieee":"M. Günzel, K.-H. Chen, N. Ueter, G. von der Brüggen, M. Dürr, and J.-J. Chen, “Compositional Timing Analysis of Asynchronized Distributed Cause-effect Chains,” <i>ACM Transactions on Embedded Computing Systems</i>, vol. 22, no. 4, pp. 1–34, 2023, doi: <a href=\"https://doi.org/10.1145/3587036\">10.1145/3587036</a>.","ama":"Günzel M, Chen K-H, Ueter N, Brüggen G von der, Dürr M, Chen J-J. Compositional Timing Analysis of Asynchronized Distributed Cause-effect Chains. <i>ACM Transactions on Embedded Computing Systems</i>. 2023;22(4):1-34. doi:<a href=\"https://doi.org/10.1145/3587036\">10.1145/3587036</a>","bibtex":"@article{Günzel_Chen_Ueter_Brüggen_Dürr_Chen_2023, title={Compositional Timing Analysis of Asynchronized Distributed Cause-effect Chains}, volume={22}, DOI={<a href=\"https://doi.org/10.1145/3587036\">10.1145/3587036</a>}, number={4}, journal={ACM Transactions on Embedded Computing Systems}, publisher={Association for Computing Machinery (ACM)}, author={Günzel, Mario and Chen, Kuan-Hsun and Ueter, Niklas and Brüggen, Georg von der and Dürr, Marco and Chen, Jian-Jia}, year={2023}, pages={1–34} }","mla":"Günzel, Mario, et al. “Compositional Timing Analysis of Asynchronized Distributed Cause-Effect Chains.” <i>ACM Transactions on Embedded Computing Systems</i>, vol. 22, no. 4, Association for Computing Machinery (ACM), 2023, pp. 1–34, doi:<a href=\"https://doi.org/10.1145/3587036\">10.1145/3587036</a>."},"volume":22,"user_id":"128464","_id":"66182","publisher":"Association for Computing Machinery (ACM)","page":"1-34","status":"public"},{"year":"2023","title":"Probabilistic Reaction Time Analysis","author":[{"first_name":"Mario","last_name":"Günzel","full_name":"Günzel, Mario"},{"first_name":"Niklas","last_name":"Ueter","full_name":"Ueter, Niklas"},{"first_name":"Kuan-Hsun","last_name":"Chen","full_name":"Chen, Kuan-Hsun"},{"last_name":"von der Brüggen","first_name":"Georg","full_name":"von der Brüggen, Georg"},{"full_name":"Chen, Jian-Jia","first_name":"Jian-Jia","last_name":"Chen"}],"publication_identifier":{"issn":["1539-9087","1558-3465"]},"date_updated":"2026-07-05T14:46:59Z","publication_status":"published","intvolume":"        22","language":[{"iso":"eng"}],"doi":"10.1145/3609390","issue":"5s","publication":"ACM Transactions on Embedded Computing Systems","abstract":[{"lang":"eng","text":"<jats:p>In many embedded systems, for instance, in the automotive, avionic, or robotics domain, critical functionalities are implemented via chains of communicating recurrent tasks. To ensure safety and correctness of such systems, guarantees on the reaction time, that is, the delay between a cause (e.g., an external activity or reading of a sensor) and the corresponding effect, must be provided.</jats:p>\n          <jats:p>Current approaches focus on the maximum reaction time, considering the worst-case system behavior. However, in many scenarios, probabilistic guarantees on the reaction time are sufficient. That is, it is sufficient to provide a guarantee that the reaction does not exceed a certain threshold with (at least) a certain probability.</jats:p>\n          <jats:p>This work provides such probabilistic guarantees on the reaction time, considering two types of randomness: response time randomness and failure probabilities. To the best of our knowledge, this is the first work that defines and analyzes probabilistic reaction time for cause-effect chains based on sporadic tasks.</jats:p>"}],"date_created":"2026-07-03T21:14:22Z","type":"journal_article","status":"public","page":"1-22","_id":"66183","publisher":"Association for Computing Machinery (ACM)","user_id":"128464","volume":22,"citation":{"ama":"Günzel M, Ueter N, Chen K-H, von der Brüggen G, Chen J-J. Probabilistic Reaction Time Analysis. <i>ACM Transactions on Embedded Computing Systems</i>. 2023;22(5s):1-22. doi:<a href=\"https://doi.org/10.1145/3609390\">10.1145/3609390</a>","bibtex":"@article{Günzel_Ueter_Chen_von der Brüggen_Chen_2023, title={Probabilistic Reaction Time Analysis}, volume={22}, DOI={<a href=\"https://doi.org/10.1145/3609390\">10.1145/3609390</a>}, number={5s}, journal={ACM Transactions on Embedded Computing Systems}, publisher={Association for Computing Machinery (ACM)}, author={Günzel, Mario and Ueter, Niklas and Chen, Kuan-Hsun and von der Brüggen, Georg and Chen, Jian-Jia}, year={2023}, pages={1–22} }","mla":"Günzel, Mario, et al. “Probabilistic Reaction Time Analysis.” <i>ACM Transactions on Embedded Computing Systems</i>, vol. 22, no. 5s, Association for Computing Machinery (ACM), 2023, pp. 1–22, doi:<a href=\"https://doi.org/10.1145/3609390\">10.1145/3609390</a>.","chicago":"Günzel, Mario, Niklas Ueter, Kuan-Hsun Chen, Georg von der Brüggen, and Jian-Jia Chen. “Probabilistic Reaction Time Analysis.” <i>ACM Transactions on Embedded Computing Systems</i> 22, no. 5s (2023): 1–22. <a href=\"https://doi.org/10.1145/3609390\">https://doi.org/10.1145/3609390</a>.","short":"M. Günzel, N. Ueter, K.-H. Chen, G. von der Brüggen, J.-J. Chen, ACM Transactions on Embedded Computing Systems 22 (2023) 1–22.","apa":"Günzel, M., Ueter, N., Chen, K.-H., von der Brüggen, G., &#38; Chen, J.-J. (2023). Probabilistic Reaction Time Analysis. <i>ACM Transactions on Embedded Computing Systems</i>, <i>22</i>(5s), 1–22. <a href=\"https://doi.org/10.1145/3609390\">https://doi.org/10.1145/3609390</a>","ieee":"M. Günzel, N. Ueter, K.-H. Chen, G. von der Brüggen, and J.-J. Chen, “Probabilistic Reaction Time Analysis,” <i>ACM Transactions on Embedded Computing Systems</i>, vol. 22, no. 5s, pp. 1–22, 2023, doi: <a href=\"https://doi.org/10.1145/3609390\">10.1145/3609390</a>."}},{"citation":{"mla":"Günzel, Mario, et al. “Probabilistic Reaction Time Analysis.” <i>ACM Transactions on Embedded Computing Systems</i>, vol. 22, no. 5s, Association for Computing Machinery (ACM), 2023, pp. 1–22, doi:<a href=\"https://doi.org/10.1145/3609390\">10.1145/3609390</a>.","bibtex":"@article{Günzel_Ueter_Chen_von der Brüggen_Chen_2023, title={Probabilistic Reaction Time Analysis}, volume={22}, DOI={<a href=\"https://doi.org/10.1145/3609390\">10.1145/3609390</a>}, number={5s}, journal={ACM Transactions on Embedded Computing Systems}, publisher={Association for Computing Machinery (ACM)}, author={Günzel, Mario and Ueter, Niklas and Chen, Kuan-Hsun and von der Brüggen, Georg and Chen, Jian-Jia}, year={2023}, pages={1–22} }","ama":"Günzel M, Ueter N, Chen K-H, von der Brüggen G, Chen J-J. Probabilistic Reaction Time Analysis. <i>ACM Transactions on Embedded Computing Systems</i>. 2023;22(5s):1-22. doi:<a href=\"https://doi.org/10.1145/3609390\">10.1145/3609390</a>","ieee":"M. Günzel, N. Ueter, K.-H. Chen, G. von der Brüggen, and J.-J. Chen, “Probabilistic Reaction Time Analysis,” <i>ACM Transactions on Embedded Computing Systems</i>, vol. 22, no. 5s, pp. 1–22, 2023, doi: <a href=\"https://doi.org/10.1145/3609390\">10.1145/3609390</a>.","apa":"Günzel, M., Ueter, N., Chen, K.-H., von der Brüggen, G., &#38; Chen, J.-J. (2023). Probabilistic Reaction Time Analysis. <i>ACM Transactions on Embedded Computing Systems</i>, <i>22</i>(5s), 1–22. <a href=\"https://doi.org/10.1145/3609390\">https://doi.org/10.1145/3609390</a>","short":"M. Günzel, N. Ueter, K.-H. Chen, G. von der Brüggen, J.-J. Chen, ACM Transactions on Embedded Computing Systems 22 (2023) 1–22.","chicago":"Günzel, Mario, Niklas Ueter, Kuan-Hsun Chen, Georg von der Brüggen, and Jian-Jia Chen. “Probabilistic Reaction Time Analysis.” <i>ACM Transactions on Embedded Computing Systems</i> 22, no. 5s (2023): 1–22. <a href=\"https://doi.org/10.1145/3609390\">https://doi.org/10.1145/3609390</a>."},"status":"public","page":"1-22","_id":"66188","publisher":"Association for Computing Machinery (ACM)","user_id":"128464","volume":22,"publication":"ACM Transactions on Embedded Computing Systems","issue":"5s","abstract":[{"lang":"eng","text":"<jats:p>In many embedded systems, for instance, in the automotive, avionic, or robotics domain, critical functionalities are implemented via chains of communicating recurrent tasks. To ensure safety and correctness of such systems, guarantees on the reaction time, that is, the delay between a cause (e.g., an external activity or reading of a sensor) and the corresponding effect, must be provided.</jats:p>\n          <jats:p>Current approaches focus on the maximum reaction time, considering the worst-case system behavior. However, in many scenarios, probabilistic guarantees on the reaction time are sufficient. That is, it is sufficient to provide a guarantee that the reaction does not exceed a certain threshold with (at least) a certain probability.</jats:p>\n          <jats:p>This work provides such probabilistic guarantees on the reaction time, considering two types of randomness: response time randomness and failure probabilities. To the best of our knowledge, this is the first work that defines and analyzes probabilistic reaction time for cause-effect chains based on sporadic tasks.</jats:p>"}],"date_created":"2026-07-03T21:15:09Z","type":"journal_article","title":"Probabilistic Reaction Time Analysis","year":"2023","publication_identifier":{"issn":["1539-9087","1558-3465"]},"author":[{"full_name":"Günzel, Mario","last_name":"Günzel","first_name":"Mario"},{"full_name":"Ueter, Niklas","first_name":"Niklas","last_name":"Ueter"},{"last_name":"Chen","first_name":"Kuan-Hsun","full_name":"Chen, Kuan-Hsun"},{"full_name":"von der Brüggen, Georg","first_name":"Georg","last_name":"von der Brüggen"},{"first_name":"Jian-Jia","last_name":"Chen","full_name":"Chen, Jian-Jia"}],"date_updated":"2026-07-05T14:47:08Z","publication_status":"published","intvolume":"        22","language":[{"iso":"eng"}],"doi":"10.1145/3609390"},{"volume":21,"user_id":"128464","publisher":"Association for Computing Machinery (ACM)","_id":"66203","page":"1-26","status":"public","citation":{"mla":"Chen, Kuan-Hsun, et al. “Efficient Realization of Decision Trees for Real-Time Inference.” <i>ACM Transactions on Embedded Computing Systems</i>, vol. 21, no. 6, Association for Computing Machinery (ACM), 2022, pp. 1–26, doi:<a href=\"https://doi.org/10.1145/3508019\">10.1145/3508019</a>.","ama":"Chen K-H, Su C, Hakert C, et al. Efficient Realization of Decision Trees for Real-Time Inference. <i>ACM Transactions on Embedded Computing Systems</i>. 2022;21(6):1-26. doi:<a href=\"https://doi.org/10.1145/3508019\">10.1145/3508019</a>","bibtex":"@article{Chen_Su_Hakert_Buschjäger_Lee_Lee_Morik_Chen_2022, title={Efficient Realization of Decision Trees for Real-Time Inference}, volume={21}, DOI={<a href=\"https://doi.org/10.1145/3508019\">10.1145/3508019</a>}, number={6}, journal={ACM Transactions on Embedded Computing Systems}, publisher={Association for Computing Machinery (ACM)}, author={Chen, Kuan-Hsun and Su, Chiahui and Hakert, Christian and Buschjäger, Sebastian and Lee, Chao-Lin and Lee, Jenq-Kuen and Morik, Katharina and Chen, Jian-Jia}, year={2022}, pages={1–26} }","apa":"Chen, K.-H., Su, C., Hakert, C., Buschjäger, S., Lee, C.-L., Lee, J.-K., Morik, K., &#38; Chen, J.-J. (2022). Efficient Realization of Decision Trees for Real-Time Inference. <i>ACM Transactions on Embedded Computing Systems</i>, <i>21</i>(6), 1–26. <a href=\"https://doi.org/10.1145/3508019\">https://doi.org/10.1145/3508019</a>","ieee":"K.-H. Chen <i>et al.</i>, “Efficient Realization of Decision Trees for Real-Time Inference,” <i>ACM Transactions on Embedded Computing Systems</i>, vol. 21, no. 6, pp. 1–26, 2022, doi: <a href=\"https://doi.org/10.1145/3508019\">10.1145/3508019</a>.","short":"K.-H. Chen, C. Su, C. Hakert, S. Buschjäger, C.-L. Lee, J.-K. Lee, K. Morik, J.-J. Chen, ACM Transactions on Embedded Computing Systems 21 (2022) 1–26.","chicago":"Chen, Kuan-Hsun, Chiahui Su, Christian Hakert, Sebastian Buschjäger, Chao-Lin Lee, Jenq-Kuen Lee, Katharina Morik, and Jian-Jia Chen. “Efficient Realization of Decision Trees for Real-Time Inference.” <i>ACM Transactions on Embedded Computing Systems</i> 21, no. 6 (2022): 1–26. <a href=\"https://doi.org/10.1145/3508019\">https://doi.org/10.1145/3508019</a>."},"doi":"10.1145/3508019","language":[{"iso":"eng"}],"intvolume":"        21","date_updated":"2026-07-05T14:45:39Z","publication_status":"published","author":[{"full_name":"Chen, Kuan-Hsun","last_name":"Chen","first_name":"Kuan-Hsun"},{"last_name":"Su","first_name":"Chiahui","full_name":"Su, Chiahui"},{"last_name":"Hakert","first_name":"Christian","full_name":"Hakert, Christian"},{"last_name":"Buschjäger","first_name":"Sebastian","full_name":"Buschjäger, Sebastian"},{"last_name":"Lee","first_name":"Chao-Lin","full_name":"Lee, Chao-Lin"},{"full_name":"Lee, Jenq-Kuen","last_name":"Lee","first_name":"Jenq-Kuen"},{"full_name":"Morik, Katharina","first_name":"Katharina","last_name":"Morik"},{"full_name":"Chen, Jian-Jia","first_name":"Jian-Jia","last_name":"Chen"}],"publication_identifier":{"issn":["1539-9087","1558-3465"]},"year":"2022","title":"Efficient Realization of Decision Trees for Real-Time Inference","type":"journal_article","date_created":"2026-07-03T21:17:45Z","abstract":[{"lang":"eng","text":"<jats:p>For timing-sensitive edge applications, the demand for efficient lightweight machine learning solutions has increased recently. Tree ensembles are among the state-of-the-art in many machine learning applications. While single decision trees are comparably small, an ensemble of trees can have a significant memory footprint leading to cache locality issues, which are crucial to performance in terms of execution time. In this work, we analyze memory-locality issues of the two most common realizations of decision trees, i.e., native and if-else trees. We highlight that both realizations demand a more careful memory layout to improve caching behavior and maximize performance. We adopt a probabilistic model of decision tree inference to find the best memory layout for each tree at the application layer. Further, we present an efficient heuristic to take architecture-dependent information into account thereby optimizing the given ensemble for a target computer architecture. Our code-generation framework, which is freely available on an open-source repository, produces optimized code sessions while preserving the structure and accuracy of the trees. With several real-world data sets, we evaluate the elapsed time of various tree realizations on server hardware as well as embedded systems for Intel and ARM processors. Our optimized memory layout achieves a reduction in execution time up to 75 % execution for server-class systems, and up to 70 % for embedded systems, respectively.</jats:p>"}],"issue":"6","publication":"ACM Transactions on Embedded Computing Systems"},{"language":[{"iso":"eng"}],"doi":"10.1145/3508019","author":[{"first_name":"Kuan-Hsun","last_name":"Chen","full_name":"Chen, Kuan-Hsun"},{"first_name":"Chiahui","last_name":"Su","full_name":"Su, Chiahui"},{"first_name":"Christian","last_name":"Hakert","full_name":"Hakert, Christian"},{"full_name":"Buschjäger, Sebastian","first_name":"Sebastian","last_name":"Buschjäger"},{"last_name":"Lee","first_name":"Chao-Lin","full_name":"Lee, Chao-Lin"},{"full_name":"Lee, Jenq-Kuen","first_name":"Jenq-Kuen","last_name":"Lee"},{"full_name":"Morik, Katharina","last_name":"Morik","first_name":"Katharina"},{"full_name":"Chen, Jian-Jia","last_name":"Chen","first_name":"Jian-Jia"}],"publication_identifier":{"issn":["1539-9087","1558-3465"]},"title":"Efficient Realization of Decision Trees for Real-Time Inference","year":"2022","intvolume":"        21","publication_status":"published","date_updated":"2026-07-05T14:45:55Z","date_created":"2026-07-03T21:18:32Z","type":"journal_article","issue":"6","publication":"ACM Transactions on Embedded Computing Systems","abstract":[{"text":"<jats:p>For timing-sensitive edge applications, the demand for efficient lightweight machine learning solutions has increased recently. Tree ensembles are among the state-of-the-art in many machine learning applications. While single decision trees are comparably small, an ensemble of trees can have a significant memory footprint leading to cache locality issues, which are crucial to performance in terms of execution time. In this work, we analyze memory-locality issues of the two most common realizations of decision trees, i.e., native and if-else trees. We highlight that both realizations demand a more careful memory layout to improve caching behavior and maximize performance. We adopt a probabilistic model of decision tree inference to find the best memory layout for each tree at the application layer. Further, we present an efficient heuristic to take architecture-dependent information into account thereby optimizing the given ensemble for a target computer architecture. Our code-generation framework, which is freely available on an open-source repository, produces optimized code sessions while preserving the structure and accuracy of the trees. With several real-world data sets, we evaluate the elapsed time of various tree realizations on server hardware as well as embedded systems for Intel and ARM processors. Our optimized memory layout achieves a reduction in execution time up to 75 % execution for server-class systems, and up to 70 % for embedded systems, respectively.</jats:p>","lang":"eng"}],"publisher":"Association for Computing Machinery (ACM)","_id":"66209","page":"1-26","volume":21,"user_id":"128464","status":"public","citation":{"apa":"Chen, K.-H., Su, C., Hakert, C., Buschjäger, S., Lee, C.-L., Lee, J.-K., Morik, K., &#38; Chen, J.-J. (2022). Efficient Realization of Decision Trees for Real-Time Inference. <i>ACM Transactions on Embedded Computing Systems</i>, <i>21</i>(6), 1–26. <a href=\"https://doi.org/10.1145/3508019\">https://doi.org/10.1145/3508019</a>","ieee":"K.-H. Chen <i>et al.</i>, “Efficient Realization of Decision Trees for Real-Time Inference,” <i>ACM Transactions on Embedded Computing Systems</i>, vol. 21, no. 6, pp. 1–26, 2022, doi: <a href=\"https://doi.org/10.1145/3508019\">10.1145/3508019</a>.","short":"K.-H. Chen, C. Su, C. Hakert, S. Buschjäger, C.-L. Lee, J.-K. Lee, K. Morik, J.-J. Chen, ACM Transactions on Embedded Computing Systems 21 (2022) 1–26.","chicago":"Chen, Kuan-Hsun, Chiahui Su, Christian Hakert, Sebastian Buschjäger, Chao-Lin Lee, Jenq-Kuen Lee, Katharina Morik, and Jian-Jia Chen. “Efficient Realization of Decision Trees for Real-Time Inference.” <i>ACM Transactions on Embedded Computing Systems</i> 21, no. 6 (2022): 1–26. <a href=\"https://doi.org/10.1145/3508019\">https://doi.org/10.1145/3508019</a>.","mla":"Chen, Kuan-Hsun, et al. “Efficient Realization of Decision Trees for Real-Time Inference.” <i>ACM Transactions on Embedded Computing Systems</i>, vol. 21, no. 6, Association for Computing Machinery (ACM), 2022, pp. 1–26, doi:<a href=\"https://doi.org/10.1145/3508019\">10.1145/3508019</a>.","ama":"Chen K-H, Su C, Hakert C, et al. Efficient Realization of Decision Trees for Real-Time Inference. <i>ACM Transactions on Embedded Computing Systems</i>. 2022;21(6):1-26. doi:<a href=\"https://doi.org/10.1145/3508019\">10.1145/3508019</a>","bibtex":"@article{Chen_Su_Hakert_Buschjäger_Lee_Lee_Morik_Chen_2022, title={Efficient Realization of Decision Trees for Real-Time Inference}, volume={21}, DOI={<a href=\"https://doi.org/10.1145/3508019\">10.1145/3508019</a>}, number={6}, journal={ACM Transactions on Embedded Computing Systems}, publisher={Association for Computing Machinery (ACM)}, author={Chen, Kuan-Hsun and Su, Chiahui and Hakert, Christian and Buschjäger, Sebastian and Lee, Chao-Lin and Lee, Jenq-Kuen and Morik, Katharina and Chen, Jian-Jia}, year={2022}, pages={1–26} }"}},{"citation":{"mla":"Hakert, Christian, et al. “Software-Managed Read and Write Wear-Leveling for Non-Volatile Main Memory.” <i>ACM Transactions on Embedded Computing Systems</i>, vol. 21, no. 1, Association for Computing Machinery (ACM), 2022, pp. 1–24, doi:<a href=\"https://doi.org/10.1145/3483839\">10.1145/3483839</a>.","bibtex":"@article{Hakert_Chen_Schirmeier_Bauer_Genssler_von der Brüggen_Amrouch_Henkel_Chen_2022, title={Software-Managed Read and Write Wear-Leveling for Non-Volatile Main Memory}, volume={21}, DOI={<a href=\"https://doi.org/10.1145/3483839\">10.1145/3483839</a>}, number={1}, journal={ACM Transactions on Embedded Computing Systems}, publisher={Association for Computing Machinery (ACM)}, author={Hakert, Christian and Chen, Kuan-Hsun and Schirmeier, Horst and Bauer, Lars and Genssler, Paul R. and von der Brüggen, Georg and Amrouch, Hussam and Henkel, Jörg and Chen, Jian-Jia}, year={2022}, pages={1–24} }","ama":"Hakert C, Chen K-H, Schirmeier H, et al. Software-Managed Read and Write Wear-Leveling for Non-Volatile Main Memory. <i>ACM Transactions on Embedded Computing Systems</i>. 2022;21(1):1-24. doi:<a href=\"https://doi.org/10.1145/3483839\">10.1145/3483839</a>","ieee":"C. Hakert <i>et al.</i>, “Software-Managed Read and Write Wear-Leveling for Non-Volatile Main Memory,” <i>ACM Transactions on Embedded Computing Systems</i>, vol. 21, no. 1, pp. 1–24, 2022, doi: <a href=\"https://doi.org/10.1145/3483839\">10.1145/3483839</a>.","apa":"Hakert, C., Chen, K.-H., Schirmeier, H., Bauer, L., Genssler, P. R., von der Brüggen, G., Amrouch, H., Henkel, J., &#38; Chen, J.-J. (2022). Software-Managed Read and Write Wear-Leveling for Non-Volatile Main Memory. <i>ACM Transactions on Embedded Computing Systems</i>, <i>21</i>(1), 1–24. <a href=\"https://doi.org/10.1145/3483839\">https://doi.org/10.1145/3483839</a>","short":"C. Hakert, K.-H. Chen, H. Schirmeier, L. Bauer, P.R. Genssler, G. von der Brüggen, H. Amrouch, J. Henkel, J.-J. Chen, ACM Transactions on Embedded Computing Systems 21 (2022) 1–24.","chicago":"Hakert, Christian, Kuan-Hsun Chen, Horst Schirmeier, Lars Bauer, Paul R. Genssler, Georg von der Brüggen, Hussam Amrouch, Jörg Henkel, and Jian-Jia Chen. “Software-Managed Read and Write Wear-Leveling for Non-Volatile Main Memory.” <i>ACM Transactions on Embedded Computing Systems</i> 21, no. 1 (2022): 1–24. <a href=\"https://doi.org/10.1145/3483839\">https://doi.org/10.1145/3483839</a>."},"page":"1-24","publisher":"Association for Computing Machinery (ACM)","_id":"66202","user_id":"128464","volume":21,"status":"public","date_created":"2026-07-03T21:17:30Z","type":"journal_article","publication":"ACM Transactions on Embedded Computing Systems","issue":"1","abstract":[{"text":"<jats:p>\n            In-memory wear-leveling has become an important research field for emerging non-volatile main memories over the past years. Many approaches in the literature perform wear-leveling by making use of special hardware. Since most non-volatile memories only wear out from write accesses, the proposed approaches in the literature also usually try to spread write accesses widely over the entire memory space. Some non-volatile memories, however, also wear out from read accesses, because every read causes a consecutive write access. Software-based solutions only operate from the application or kernel level, where read and write accesses are realized with different instructions and semantics. Therefore different mechanisms are required to handle reads and writes on the software level. First, we design a method to approximate read and write accesses to the memory to allow aging aware coarse-grained wear-leveling in the absence of special hardware, providing the age information. Second, we provide specific solutions to resolve\n            <jats:italic>access hot-spots</jats:italic>\n            within the compiled program code (text segment) and on the application stack. In our evaluation, we estimate the cell age by counting the total amount of accesses per cell. The results show that employing all our methods improves the memory lifetime by up to a factor of 955×.\n          </jats:p>","lang":"eng"}],"language":[{"iso":"eng"}],"doi":"10.1145/3483839","title":"Software-Managed Read and Write Wear-Leveling for Non-Volatile Main Memory","year":"2022","author":[{"full_name":"Hakert, Christian","first_name":"Christian","last_name":"Hakert"},{"first_name":"Kuan-Hsun","last_name":"Chen","full_name":"Chen, Kuan-Hsun"},{"last_name":"Schirmeier","first_name":"Horst","full_name":"Schirmeier, Horst"},{"last_name":"Bauer","first_name":"Lars","full_name":"Bauer, Lars"},{"first_name":"Paul R.","last_name":"Genssler","full_name":"Genssler, Paul R."},{"first_name":"Georg","last_name":"von der Brüggen","full_name":"von der Brüggen, Georg"},{"first_name":"Hussam","last_name":"Amrouch","full_name":"Amrouch, Hussam"},{"full_name":"Henkel, Jörg","last_name":"Henkel","first_name":"Jörg"},{"first_name":"Jian-Jia","last_name":"Chen","full_name":"Chen, Jian-Jia"}],"publication_identifier":{"issn":["1539-9087","1558-3465"]},"publication_status":"published","date_updated":"2026-07-05T14:45:36Z","intvolume":"        21"},{"abstract":[{"text":"<jats:p>Dynamic power management (DPM) reduces the power consumption of a computing system when it idles, by switching the system into a low power state for hibernation. When all processors in the system share the same component, e.g., a shared memory, powering off this component during hibernation is only possible when all processors idle at the same time. For a real-time system, the schedulability property has to be guaranteed on every processor, especially if idle intervals are considered to be actively introduced.</jats:p>\n          <jats:p>In this work, we consider real-time systems with hybrid shared-memory architectures, which consist of shared volatile memory (VM) and non-volatile memory (NVM). Energy-efficient execution is achieved by applying DPM to turn off all memories during the hibernation mode. Towards this, we first explore the hybrid memory architectures and suggest a task model, which features configurable hibernation overheads. We propose a multi-processor procrastination algorithm (HEART), based on partitioned earliest-deadline-first (pEDF) scheduling. Our algorithm facilitates reducing the energy consumption by actively enlarging the hibernation time. It enforces all processors to idle simultaneously without violating the schedulability condition, such that the system can enter the hibernation state, where shared memories are turned off. Throughout extensive evaluation of HEART, we demonstrate (1) the increase in potential hibernation time, respectively the decrease in energy consumption, and (2) that our algorithm is not only more general but also has better performance than the state of the art with respect to energy efficiency in most cases.</jats:p>","lang":"eng"}],"publication":"ACM Transactions on Embedded Computing Systems","issue":"5s","type":"journal_article","date_created":"2026-07-03T21:21:20Z","intvolume":"        20","publication_status":"published","date_updated":"2026-07-05T14:44:23Z","publication_identifier":{"issn":["1539-9087","1558-3465"]},"author":[{"last_name":"Günzel","first_name":"Mario","full_name":"Günzel, Mario"},{"full_name":"Hakert, Christian","last_name":"Hakert","first_name":"Christian"},{"first_name":"Kuan-Hsun","last_name":"Chen","full_name":"Chen, Kuan-Hsun"},{"last_name":"Chen","first_name":"Jian-Jia","full_name":"Chen, Jian-Jia"}],"year":"2021","title":"HEART:\n            <u>H</u>\n            ybrid Memory and\n            <u>E</u>\n            nergy-\n            <u>A</u>\n            ware\n            <u>R</u>\n            eal-\n            <u>T</u>\n            ime Scheduling for Multi-Processor Systems","doi":"10.1145/3477019","language":[{"iso":"eng"}],"citation":{"bibtex":"@article{Günzel_Hakert_Chen_Chen_2021, title={HEART:             &#60;u&#62;H&#60;/u&#62;             ybrid Memory and             &#60;u&#62;E&#60;/u&#62;             nergy-             &#60;u&#62;A&#60;/u&#62;             ware             &#60;u&#62;R&#60;/u&#62;             eal-             &#60;u&#62;T&#60;/u&#62;             ime Scheduling for Multi-Processor Systems}, volume={20}, DOI={<a href=\"https://doi.org/10.1145/3477019\">10.1145/3477019</a>}, number={5s}, journal={ACM Transactions on Embedded Computing Systems}, publisher={Association for Computing Machinery (ACM)}, author={Günzel, Mario and Hakert, Christian and Chen, Kuan-Hsun and Chen, Jian-Jia}, year={2021}, pages={1–23} }","ama":"Günzel M, Hakert C, Chen K-H, Chen J-J. HEART:             &#60;u&#62;H&#60;/u&#62;             ybrid Memory and             &#60;u&#62;E&#60;/u&#62;             nergy-             &#60;u&#62;A&#60;/u&#62;             ware             &#60;u&#62;R&#60;/u&#62;             eal-             &#60;u&#62;T&#60;/u&#62;             ime Scheduling for Multi-Processor Systems. <i>ACM Transactions on Embedded Computing Systems</i>. 2021;20(5s):1-23. doi:<a href=\"https://doi.org/10.1145/3477019\">10.1145/3477019</a>","mla":"Günzel, Mario, et al. “HEART:             &#60;u&#62;H&#60;/U&#62;            Ybrid Memory and             &#60;u&#62;E&#60;/U&#62;            Nergy-             &#60;u&#62;A&#60;/U&#62;            Ware            &#60;u&#62;R&#60;/U&#62;            Eal-             &#60;u&#62;T&#60;/U&#62;            Ime Scheduling for Multi-Processor Systems.” <i>ACM Transactions on Embedded Computing Systems</i>, vol. 20, no. 5s, Association for Computing Machinery (ACM), 2021, pp. 1–23, doi:<a href=\"https://doi.org/10.1145/3477019\">10.1145/3477019</a>.","chicago":"Günzel, Mario, Christian Hakert, Kuan-Hsun Chen, and Jian-Jia Chen. “HEART:             &#60;u&#62;H&#60;/U&#62;            Ybrid Memory and             &#60;u&#62;E&#60;/U&#62;            Nergy-             &#60;u&#62;A&#60;/U&#62;            Ware            &#60;u&#62;R&#60;/U&#62;            Eal-             &#60;u&#62;T&#60;/U&#62;            Ime Scheduling for Multi-Processor Systems.” <i>ACM Transactions on Embedded Computing Systems</i> 20, no. 5s (2021): 1–23. <a href=\"https://doi.org/10.1145/3477019\">https://doi.org/10.1145/3477019</a>.","short":"M. Günzel, C. Hakert, K.-H. Chen, J.-J. Chen, ACM Transactions on Embedded Computing Systems 20 (2021) 1–23.","ieee":"M. Günzel, C. Hakert, K.-H. Chen, and J.-J. Chen, “HEART:             &#60;u&#62;H&#60;/u&#62;             ybrid Memory and             &#60;u&#62;E&#60;/u&#62;             nergy-             &#60;u&#62;A&#60;/u&#62;             ware             &#60;u&#62;R&#60;/u&#62;             eal-             &#60;u&#62;T&#60;/u&#62;             ime Scheduling for Multi-Processor Systems,” <i>ACM Transactions on Embedded Computing Systems</i>, vol. 20, no. 5s, pp. 1–23, 2021, doi: <a href=\"https://doi.org/10.1145/3477019\">10.1145/3477019</a>.","apa":"Günzel, M., Hakert, C., Chen, K.-H., &#38; Chen, J.-J. (2021). HEART:             &#60;u&#62;H&#60;/u&#62;             ybrid Memory and             &#60;u&#62;E&#60;/u&#62;             nergy-             &#60;u&#62;A&#60;/u&#62;             ware             &#60;u&#62;R&#60;/u&#62;             eal-             &#60;u&#62;T&#60;/u&#62;             ime Scheduling for Multi-Processor Systems. <i>ACM Transactions on Embedded Computing Systems</i>, <i>20</i>(5s), 1–23. <a href=\"https://doi.org/10.1145/3477019\">https://doi.org/10.1145/3477019</a>"},"status":"public","volume":20,"user_id":"128464","_id":"66222","publisher":"Association for Computing Machinery (ACM)","page":"1-23"},{"abstract":[{"lang":"eng","text":"<jats:p>Dynamic power management (DPM) reduces the power consumption of a computing system when it idles, by switching the system into a low power state for hibernation. When all processors in the system share the same component, e.g., a shared memory, powering off this component during hibernation is only possible when all processors idle at the same time. For a real-time system, the schedulability property has to be guaranteed on every processor, especially if idle intervals are considered to be actively introduced.</jats:p>\n          <jats:p>In this work, we consider real-time systems with hybrid shared-memory architectures, which consist of shared volatile memory (VM) and non-volatile memory (NVM). Energy-efficient execution is achieved by applying DPM to turn off all memories during the hibernation mode. Towards this, we first explore the hybrid memory architectures and suggest a task model, which features configurable hibernation overheads. We propose a multi-processor procrastination algorithm (HEART), based on partitioned earliest-deadline-first (pEDF) scheduling. Our algorithm facilitates reducing the energy consumption by actively enlarging the hibernation time. It enforces all processors to idle simultaneously without violating the schedulability condition, such that the system can enter the hibernation state, where shared memories are turned off. Throughout extensive evaluation of HEART, we demonstrate (1) the increase in potential hibernation time, respectively the decrease in energy consumption, and (2) that our algorithm is not only more general but also has better performance than the state of the art with respect to energy efficiency in most cases.</jats:p>"}],"publication":"ACM Transactions on Embedded Computing Systems","issue":"5s","type":"journal_article","date_created":"2026-07-03T21:20:35Z","intvolume":"        20","date_updated":"2026-07-05T14:45:23Z","publication_status":"published","publication_identifier":{"issn":["1539-9087","1558-3465"]},"author":[{"full_name":"Günzel, Mario","first_name":"Mario","last_name":"Günzel"},{"full_name":"Hakert, Christian","first_name":"Christian","last_name":"Hakert"},{"first_name":"Kuan-Hsun","last_name":"Chen","full_name":"Chen, Kuan-Hsun"},{"full_name":"Chen, Jian-Jia","last_name":"Chen","first_name":"Jian-Jia"}],"title":"HEART:\n            <u>H</u>\n            ybrid Memory and\n            <u>E</u>\n            nergy-\n            <u>A</u>\n            ware\n            <u>R</u>\n            eal-\n            <u>T</u>\n            ime Scheduling for Multi-Processor Systems","year":"2021","doi":"10.1145/3477019","language":[{"iso":"eng"}],"citation":{"mla":"Günzel, Mario, et al. “HEART:             &#60;u&#62;H&#60;/U&#62;            Ybrid Memory and             &#60;u&#62;E&#60;/U&#62;            Nergy-             &#60;u&#62;A&#60;/U&#62;            Ware            &#60;u&#62;R&#60;/U&#62;            Eal-             &#60;u&#62;T&#60;/U&#62;            Ime Scheduling for Multi-Processor Systems.” <i>ACM Transactions on Embedded Computing Systems</i>, vol. 20, no. 5s, Association for Computing Machinery (ACM), 2021, pp. 1–23, doi:<a href=\"https://doi.org/10.1145/3477019\">10.1145/3477019</a>.","bibtex":"@article{Günzel_Hakert_Chen_Chen_2021, title={HEART:             &#60;u&#62;H&#60;/u&#62;             ybrid Memory and             &#60;u&#62;E&#60;/u&#62;             nergy-             &#60;u&#62;A&#60;/u&#62;             ware             &#60;u&#62;R&#60;/u&#62;             eal-             &#60;u&#62;T&#60;/u&#62;             ime Scheduling for Multi-Processor Systems}, volume={20}, DOI={<a href=\"https://doi.org/10.1145/3477019\">10.1145/3477019</a>}, number={5s}, journal={ACM Transactions on Embedded Computing Systems}, publisher={Association for Computing Machinery (ACM)}, author={Günzel, Mario and Hakert, Christian and Chen, Kuan-Hsun and Chen, Jian-Jia}, year={2021}, pages={1–23} }","ama":"Günzel M, Hakert C, Chen K-H, Chen J-J. HEART:             &#60;u&#62;H&#60;/u&#62;             ybrid Memory and             &#60;u&#62;E&#60;/u&#62;             nergy-             &#60;u&#62;A&#60;/u&#62;             ware             &#60;u&#62;R&#60;/u&#62;             eal-             &#60;u&#62;T&#60;/u&#62;             ime Scheduling for Multi-Processor Systems. <i>ACM Transactions on Embedded Computing Systems</i>. 2021;20(5s):1-23. doi:<a href=\"https://doi.org/10.1145/3477019\">10.1145/3477019</a>","ieee":"M. Günzel, C. Hakert, K.-H. Chen, and J.-J. Chen, “HEART:             &#60;u&#62;H&#60;/u&#62;             ybrid Memory and             &#60;u&#62;E&#60;/u&#62;             nergy-             &#60;u&#62;A&#60;/u&#62;             ware             &#60;u&#62;R&#60;/u&#62;             eal-             &#60;u&#62;T&#60;/u&#62;             ime Scheduling for Multi-Processor Systems,” <i>ACM Transactions on Embedded Computing Systems</i>, vol. 20, no. 5s, pp. 1–23, 2021, doi: <a href=\"https://doi.org/10.1145/3477019\">10.1145/3477019</a>.","apa":"Günzel, M., Hakert, C., Chen, K.-H., &#38; Chen, J.-J. (2021). HEART:             &#60;u&#62;H&#60;/u&#62;             ybrid Memory and             &#60;u&#62;E&#60;/u&#62;             nergy-             &#60;u&#62;A&#60;/u&#62;             ware             &#60;u&#62;R&#60;/u&#62;             eal-             &#60;u&#62;T&#60;/u&#62;             ime Scheduling for Multi-Processor Systems. <i>ACM Transactions on Embedded Computing Systems</i>, <i>20</i>(5s), 1–23. <a href=\"https://doi.org/10.1145/3477019\">https://doi.org/10.1145/3477019</a>","short":"M. Günzel, C. Hakert, K.-H. Chen, J.-J. Chen, ACM Transactions on Embedded Computing Systems 20 (2021) 1–23.","chicago":"Günzel, Mario, Christian Hakert, Kuan-Hsun Chen, and Jian-Jia Chen. “HEART:             &#60;u&#62;H&#60;/U&#62;            Ybrid Memory and             &#60;u&#62;E&#60;/U&#62;            Nergy-             &#60;u&#62;A&#60;/U&#62;            Ware            &#60;u&#62;R&#60;/U&#62;            Eal-             &#60;u&#62;T&#60;/U&#62;            Ime Scheduling for Multi-Processor Systems.” <i>ACM Transactions on Embedded Computing Systems</i> 20, no. 5s (2021): 1–23. <a href=\"https://doi.org/10.1145/3477019\">https://doi.org/10.1145/3477019</a>."},"status":"public","volume":20,"user_id":"128464","publisher":"Association for Computing Machinery (ACM)","_id":"66217","page":"1-23"},{"citation":{"ama":"Dürr M, Brüggen GVD, Chen K-H, Chen J-J. End-to-End Timing Analysis of Sporadic Cause-Effect Chains in Distributed Systems. <i>ACM Transactions on Embedded Computing Systems</i>. 2019;18(5s):1-24. doi:<a href=\"https://doi.org/10.1145/3358181\">10.1145/3358181</a>","bibtex":"@article{Dürr_Brüggen_Chen_Chen_2019, title={End-to-End Timing Analysis of Sporadic Cause-Effect Chains in Distributed Systems}, volume={18}, DOI={<a href=\"https://doi.org/10.1145/3358181\">10.1145/3358181</a>}, number={5s}, journal={ACM Transactions on Embedded Computing Systems}, publisher={Association for Computing Machinery (ACM)}, author={Dürr, Marco and Brüggen, Georg Von Der and Chen, Kuan-Hsun and Chen, Jian-Jia}, year={2019}, pages={1–24} }","mla":"Dürr, Marco, et al. “End-to-End Timing Analysis of Sporadic Cause-Effect Chains in Distributed Systems.” <i>ACM Transactions on Embedded Computing Systems</i>, vol. 18, no. 5s, Association for Computing Machinery (ACM), 2019, pp. 1–24, doi:<a href=\"https://doi.org/10.1145/3358181\">10.1145/3358181</a>.","short":"M. Dürr, G.V.D. Brüggen, K.-H. Chen, J.-J. Chen, ACM Transactions on Embedded Computing Systems 18 (2019) 1–24.","chicago":"Dürr, Marco, Georg Von Der Brüggen, Kuan-Hsun Chen, and Jian-Jia Chen. “End-to-End Timing Analysis of Sporadic Cause-Effect Chains in Distributed Systems.” <i>ACM Transactions on Embedded Computing Systems</i> 18, no. 5s (2019): 1–24. <a href=\"https://doi.org/10.1145/3358181\">https://doi.org/10.1145/3358181</a>.","apa":"Dürr, M., Brüggen, G. V. D., Chen, K.-H., &#38; Chen, J.-J. (2019). End-to-End Timing Analysis of Sporadic Cause-Effect Chains in Distributed Systems. <i>ACM Transactions on Embedded Computing Systems</i>, <i>18</i>(5s), 1–24. <a href=\"https://doi.org/10.1145/3358181\">https://doi.org/10.1145/3358181</a>","ieee":"M. Dürr, G. V. D. Brüggen, K.-H. Chen, and J.-J. Chen, “End-to-End Timing Analysis of Sporadic Cause-Effect Chains in Distributed Systems,” <i>ACM Transactions on Embedded Computing Systems</i>, vol. 18, no. 5s, pp. 1–24, 2019, doi: <a href=\"https://doi.org/10.1145/3358181\">10.1145/3358181</a>."},"page":"1-24","publisher":"Association for Computing Machinery (ACM)","_id":"66246","user_id":"128464","volume":18,"status":"public","date_created":"2026-07-05T14:35:33Z","type":"journal_article","publication":"ACM Transactions on Embedded Computing Systems","issue":"5s","abstract":[{"lang":"eng","text":"<jats:p>A cause-effect chain is used to define the logical order of data dependent tasks, which is independent from the execution order of the jobs of the (periodic/sporadic) tasks. Analyzing the worst-case End-to-End timing behavior, associated to a cause-effect chain, is an important problem in embedded control systems. For example, the detailed timing properties of modern automotive systems are specified in the AUTOSAR Timing Extensions.</jats:p>\n          <jats:p>\n            In this paper, we present a formal End-to-End timing analysis for distributed systems. We consider the two most important End-to-End timing semantics, i.e., the button-to-action delay (termed as the\n            <jats:italic>maximum reaction time</jats:italic>\n            ) and the worst-case data freshness (termed as the\n            <jats:italic>maximum data age</jats:italic>\n            ). Our contribution is significant due to the consideration of the sporadic behavior of job activations, whilst the results in the literature have been mostly limited to periodic activations. The proof strategy shows the (previously unexplored) connection between the reaction time (data age, respectively) and immediate forward (backward, respectively) job chains. Our analytical results dominate the state of the art for sporadic task activations in distributed systems and the evaluations show a clear improvement for synthesized task systems as well as for a real world automotive benchmark setting.\n          </jats:p>"}],"language":[{"iso":"eng"}],"doi":"10.1145/3358181","year":"2019","title":"End-to-End Timing Analysis of Sporadic Cause-Effect Chains in Distributed Systems","publication_identifier":{"issn":["1539-9087","1558-3465"]},"author":[{"full_name":"Dürr, Marco","last_name":"Dürr","first_name":"Marco"},{"last_name":"Brüggen","first_name":"Georg Von Der","full_name":"Brüggen, Georg Von Der"},{"full_name":"Chen, Kuan-Hsun","last_name":"Chen","first_name":"Kuan-Hsun"},{"full_name":"Chen, Jian-Jia","last_name":"Chen","first_name":"Jian-Jia"}],"publication_status":"published","date_updated":"2026-07-05T14:43:49Z","intvolume":"        18"},{"user_id":"3118","doi":"10.1145/1596532.1596540","volume":9,"page":"8:1-8:33","language":[{"iso":"eng"}],"_id":"10703","date_updated":"2022-01-06T06:50:50Z","intvolume":"         9","year":"2009","title":"ReconOS: Multithreaded Programming for Reconfigurable Computers","status":"public","author":[{"full_name":"Lübbers, Enno","first_name":"Enno","last_name":"Lübbers"},{"last_name":"Platzner","first_name":"Marco","full_name":"Platzner, Marco","id":"398"}],"publication_identifier":{"issn":["1539-9087"]},"type":"journal_article","keyword":["Reconfigurable computing","multithreading","operating systems"],"department":[{"_id":"78"}],"date_created":"2019-07-10T11:41:17Z","issue":"1","publication":"ACM Transactions on Embedded Computing Systems","citation":{"mla":"Lübbers, Enno, and Marco Platzner. “ReconOS: Multithreaded Programming for Reconfigurable Computers.” <i>ACM Transactions on Embedded Computing Systems</i>, vol. 9, no. 1, 2009, pp. 8:1-8:33, doi:<a href=\"https://doi.org/10.1145/1596532.1596540\">10.1145/1596532.1596540</a>.","bibtex":"@article{Lübbers_Platzner_2009, title={ReconOS: Multithreaded Programming for Reconfigurable Computers}, volume={9}, DOI={<a href=\"https://doi.org/10.1145/1596532.1596540\">10.1145/1596532.1596540</a>}, number={1}, journal={ACM Transactions on Embedded Computing Systems}, author={Lübbers, Enno and Platzner, Marco}, year={2009}, pages={8:1-8:33} }","ama":"Lübbers E, Platzner M. ReconOS: Multithreaded Programming for Reconfigurable Computers. <i>ACM Transactions on Embedded Computing Systems</i>. 2009;9(1):8:1-8:33. doi:<a href=\"https://doi.org/10.1145/1596532.1596540\">10.1145/1596532.1596540</a>","ieee":"E. Lübbers and M. Platzner, “ReconOS: Multithreaded Programming for Reconfigurable Computers,” <i>ACM Transactions on Embedded Computing Systems</i>, vol. 9, no. 1, pp. 8:1-8:33, 2009.","apa":"Lübbers, E., &#38; Platzner, M. (2009). ReconOS: Multithreaded Programming for Reconfigurable Computers. <i>ACM Transactions on Embedded Computing Systems</i>, <i>9</i>(1), 8:1-8:33. <a href=\"https://doi.org/10.1145/1596532.1596540\">https://doi.org/10.1145/1596532.1596540</a>","chicago":"Lübbers, Enno, and Marco Platzner. “ReconOS: Multithreaded Programming for Reconfigurable Computers.” <i>ACM Transactions on Embedded Computing Systems</i> 9, no. 1 (2009): 8:1-8:33. <a href=\"https://doi.org/10.1145/1596532.1596540\">https://doi.org/10.1145/1596532.1596540</a>.","short":"E. Lübbers, M. Platzner, ACM Transactions on Embedded Computing Systems 9 (2009) 8:1-8:33."}}]