m (Scipediacontent moved page Draft Content 760710093 to Puschner 2013a) |
|||
| Line 3: | Line 3: | ||
Traditional Worst-Case Execution-Time (WCET) analysis is very complex. It has to deal with path analysis, to identify and describe the possible execution paths through the code to be analyzed, and it has to model the worst-case timing of the possible paths on the target hardware. The latter is again nontrivial due to interference of modern hardware features like instruction pipelines, caches, and parallel instruction-execution units on the processor. | Traditional Worst-Case Execution-Time (WCET) analysis is very complex. It has to deal with path analysis, to identify and describe the possible execution paths through the code to be analyzed, and it has to model the worst-case timing of the possible paths on the target hardware. The latter is again nontrivial due to interference of modern hardware features like instruction pipelines, caches, and parallel instruction-execution units on the processor. | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| Line 15: | Line 10: | ||
* [https://link.springer.com/content/pdf/10.1007%2F978-0-387-35599-3_17.pdf https://link.springer.com/content/pdf/10.1007%2F978-0-387-35599-3_17.pdf] | * [https://link.springer.com/content/pdf/10.1007%2F978-0-387-35599-3_17.pdf https://link.springer.com/content/pdf/10.1007%2F978-0-387-35599-3_17.pdf] | ||
| + | |||
| + | * [http://link.springer.com/content/pdf/10.1007/978-0-387-35599-3_17 http://link.springer.com/content/pdf/10.1007/978-0-387-35599-3_17], | ||
| + | : [http://dx.doi.org/10.1007/978-0-387-35599-3_17 http://dx.doi.org/10.1007/978-0-387-35599-3_17] under the license http://www.springer.com/tdm | ||
| + | |||
| + | * [https://link.springer.com/chapter/10.1007/978-0-387-35599-3_17 https://link.springer.com/chapter/10.1007/978-0-387-35599-3_17], | ||
| + | : [https://dblp.uni-trier.de/db/conf/ifip10-3/dipes2002.html#Puschner02 https://dblp.uni-trier.de/db/conf/ifip10-3/dipes2002.html#Puschner02], | ||
| + | : [https://www.scipedia.com/public/Puschner_2013a https://www.scipedia.com/public/Puschner_2013a], | ||
| + | : [https://dl.acm.org/citation.cfm?id=714530 https://dl.acm.org/citation.cfm?id=714530], | ||
| + | : [https://core.ac.uk/display/101285784 https://core.ac.uk/display/101285784], | ||
| + | : [https://academic.microsoft.com/#/detail/1585031979 https://academic.microsoft.com/#/detail/1585031979] | ||
Latest revision as of 17:10, 21 January 2021
Abstract
Traditional Worst-Case Execution-Time (WCET) analysis is very complex. It has to deal with path analysis, to identify and describe the possible execution paths through the code to be analyzed, and it has to model the worst-case timing of the possible paths on the target hardware. The latter is again nontrivial due to interference of modern hardware features like instruction pipelines, caches, and parallel instruction-execution units on the processor.
Original document
The different versions of the original document can be found in:
- http://dx.doi.org/10.1007/978-0-387-35599-3_17 under the license http://www.springer.com/tdm
Back to Top
Document information
Published on 01/01/2013
Volume 2013, 2013
DOI: 10.1007/978-0-387-35599-3_17
Licence: CC BY-NC-SA license
Share this document
Keywords
claim authorship
Are you one of the authors of this document?