Measurement-based cache representativeness on multipath programs
Cita com:
hdl:2117/119284
Document typeConference lecture
Defense date2018-06
PublisherAssociation for Computing Machinery (ACM)
Rights accessOpen Access
All rights reserved. This work is protected by the corresponding intellectual and industrial
property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public
communication or transformation of this work are prohibited without permission of the copyright holder
ProjectCOMPUTACION DE ALTAS PRESTACIONES VII (MINECO-TIN2015-65316-P)
RYC-2013-14717 (MINECO-RYC-2013-14717)
RYC-2013-14717 (MINECO-RYC-2013-14717)
Abstract
Autonomous vehicles in embedded real-time systems increase critical-software size and complexity whose performance needs are covered with high-performance hardware features like caches, which however hampers obtaining WCET estimates that hold valid for all program execution paths. This requires assessing that all cache layouts have been properly factored in the WCET process. For measurement-based timing analysis, the most common analysis method, we provide a solution to achieve cache representativeness and full path coverage: we create a modified program for analysis purposes where cache impact is upper-bounded across any path, and derive the minimum number of runs required to capture in the test campaign cache layouts resulting in high execution times.
CitationMilutinovic, S. [et al.]. Measurement-based cache representativeness on multipath programs. A: "DAC '18 Proceedings of the 55th Annual Design Automation Conference". Association for Computing Machinery (ACM), 2018.
ISBN978-1-4503-5700-5
Publisher versionhttps://dl.acm.org/citation.cfm?id=3196075
Files | Description | Size | Format | View |
---|---|---|---|---|
Measurement-Based Cache Representativeness.pdf | 771,5Kb | View/Open |