Worst‐case execution time analysis for a Java processor
Saved in:
| Title: | Worst‐case execution time analysis for a Java processor |
|---|---|
| Authors: | Schoeberl, Martin, Puffitsch, Wolfgang, Pedersen, Rasmus Ulslev, Huber, Benedikt |
| Source: | Software: Practice and Experience ; volume 40, issue 6, page 507-542 ; ISSN 0038-0644 1097-024X |
| Publisher Information: | Wiley |
| Publication Year: | 2010 |
| Collection: | Wiley Online Library (Open Access Articles via Crossref) |
| Description: | In this paper, we propose a solution for a worst‐case execution time (WCET) analyzable Java system: a combination of a time‐predictable Java processor and a tool that performs WCET analysis at Java bytecode level. We present a Java processor, called JOP, designed for time‐predictable execution of real‐time tasks. The execution time of bytecodes, the instructions of the Java virtual machine, is known to cycle accuracy for JOP. Therefore, JOP simplifies the low‐level WCET analysis. A method cache, which fills whole Java methods into the cache, simplifies cache analysis. The WCET analysis tool is based on integer linear programming. The tool performs the low‐level analysis at the bytecode level and integrates the method cache analysis. An integrated data‐flow analysis performs receiver‐type analysis for dynamic method dispatches and loop‐bound analysis. Furthermore, a model checking approach to WCET analysis is presented where the method cache can be exactly simulated. The combination of the time‐predictable Java processor and the WCET analysis tool is evaluated with standard WCET benchmarks and three real‐time applications. The WCET friendly architecture of JOP and the integrated method cache analysis yield tight WCET bounds. Comparing the exact, but expensive, model checking‐based analysis of the method cache with the static approach demonstrates that the static approximation of the method cache is sufficiently tight for practical purposes. Copyright © 2010 John Wiley & Sons, Ltd. |
| Document Type: | article in journal/newspaper |
| Language: | English |
| DOI: | 10.1002/spe.968 |
| Availability: | https://doi.org/10.1002/spe.968 https://api.wiley.com/onlinelibrary/tdm/v1/articles/10.1002%2Fspe.968 https://onlinelibrary.wiley.com/doi/pdf/10.1002/spe.968 |
| Rights: | http://onlinelibrary.wiley.com/termsAndConditions#vor |
| Accession Number: | edsbas.EDFC0F77 |
| Database: | BASE |
Nájsť tento článok vo Web of Science | Abstract: | In this paper, we propose a solution for a worst‐case execution time (WCET) analyzable Java system: a combination of a time‐predictable Java processor and a tool that performs WCET analysis at Java bytecode level. We present a Java processor, called JOP, designed for time‐predictable execution of real‐time tasks. The execution time of bytecodes, the instructions of the Java virtual machine, is known to cycle accuracy for JOP. Therefore, JOP simplifies the low‐level WCET analysis. A method cache, which fills whole Java methods into the cache, simplifies cache analysis. The WCET analysis tool is based on integer linear programming. The tool performs the low‐level analysis at the bytecode level and integrates the method cache analysis. An integrated data‐flow analysis performs receiver‐type analysis for dynamic method dispatches and loop‐bound analysis. Furthermore, a model checking approach to WCET analysis is presented where the method cache can be exactly simulated. The combination of the time‐predictable Java processor and the WCET analysis tool is evaluated with standard WCET benchmarks and three real‐time applications. The WCET friendly architecture of JOP and the integrated method cache analysis yield tight WCET bounds. Comparing the exact, but expensive, model checking‐based analysis of the method cache with the static approach demonstrates that the static approximation of the method cache is sufficiently tight for practical purposes. Copyright © 2010 John Wiley & Sons, Ltd. |
|---|---|
| DOI: | 10.1002/spe.968 |