Puschner 2013a - Revision history

Scipediacontent at 15:10, 21 January 2021

2021-01-21T15:10:03Z

Scipediacontent: Scipediacontent moved page Draft Content 760710093 to Puschner 2013a

2020-10-14T13:53:17Z

Scipediacontent moved page Draft Content 760710093 to Puschner 2013a

Scipediacontent: Created page with " == 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 path..."

2020-10-14T13:53:13Z

Created page with " == 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 path..."

New page

== 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.

Document type: Part of book or chapter of book

== Full document ==
<pdf>Media:Draft_Content_760710093-beopen887-6089-document.pdf</pdf>

== Original document ==

The different versions of the original document can be found in:

* [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]

← Older revision		Revision as of 15:10, 21 January 2021
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.
−
−	~~Document type: Part of book or chapter of book~~
−
−	~~== Full document ==~~
−	~~<pdf>Media:Draft_Content_760710093-beopen887-6089-document.pdf</pdf>~~


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]

← Older revision	Revision as of 13:53, 14 October 2020
(No difference)