Please use this identifier to cite or link to this item:
https://doi.org/10.15480/882.2230

Publisher DOI: | 10.1145/3323439.3323976 | Title: | Compiler-based code compression for hard real-time systems | Language: | English | Authors: | Muts, Kateryna Luppold, Arno ![]() Falk, Heiko ![]() |
Keywords: | compiler;compression;run-time decompression;real-time systems;integer-linear programming | Issue Date: | May-2019 | Source: | Proceedings of the 22nd International Workshop on Software and Compilers for Embedded Systems (SCOPES ’19), May 27–28, 2019, Sankt Goar, Germany. ACM, New York, NY, ISBN 978-1-4503-6762-2 | Abstract (english): | Real-Time Systems often come with additional requirements apart from being functionally correct and adhering to their timing constraints. Another common additional optimization goal is to meet code size requirements. Code compression techniques might be utilized to meet code size constraints in embedded systems. We show how to extend a compiler targeting hard real-time systems by an asymmetric compiler-based code compression/decompression, where the compression is performed at the compilation time and the decompression takes place at the execution time. Moreover, experimental results show the impact of the decompression algorithm on the estimated Worst-Case Execution Time that is one of the key properties of hard real-time systems. | Conference: | 22nd International Workshop on Software and Compilers for Embedded Systems, (SCOPES ’19) | URI: | http://hdl.handle.net/11420/2549 | DOI: | 10.15480/882.2230 | Institute: | Eingebettete Systeme E-13 | Type: | ResearchPaper | Funded by: | Deutsche Forschungsgemeinschaft | Project: | FA 1017/3-1 |
Appears in Collections: | Publications with fulltext |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
201905-scopes-muts.pdf | 1,84 MB | Adobe PDF | ![]() View/Open |
Page view(s)
141
Last Week
2
2
Last month
8
8
checked on Dec 10, 2019
Download(s)
93
checked on Dec 10, 2019
Google ScholarTM
Check
Export
Items in TORE are protected by copyright, with all rights reserved, unless otherwise indicated.