<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en-gb">
	<link rel="self" type="application/atom+xml" href="http://localhost/app.php/feed/topic/5" />

	<title>Tools and Benchmarks for Real-Time Systems</title>
	<subtitle>ECRTS Community Forum</subtitle>
	<link href="http://localhost/index.php" />
	<updated>2015-06-23T14:03:12+01:00</updated>

	<author><name><![CDATA[Tools and Benchmarks for Real-Time Systems]]></name></author>
	<id>http://localhost/app.php/feed/topic/5</id>

		<entry>
		<author><name><![CDATA[jschlatow]]></name></author>
		<updated>2015-06-23T14:03:12+01:00</updated>

		<published>2015-06-23T14:03:12+01:00</published>
		<id>http://localhost/viewtopic.php?t=5&amp;p=5#p5</id>
		<link href="http://localhost/viewtopic.php?t=5&amp;p=5#p5"/>
		<title type="html"><![CDATA[pyCPA: a pragmatic Python implementation of Compositional Performance Analysis]]></title>

		
		<content type="html" xml:base="http://localhost/viewtopic.php?t=5&amp;p=5#p5"><![CDATA[
<strong class="text-strong">Description of the tool</strong><br>Given, you have a (distributed) real-time system and you want to know about worst-case (end-to-end) timing behavior, then you can use pyCPA to obtain these bounds.<br><br>You provide your architecture in the form of resources such as busses and CPUs and the corresponding scheduling policies. In a second step, you define your task-graph which is a specification of task-communication (precedence relations) and tasks' properties (best/worst-case execution times, activation patterns).<br><br>pyCPA will then calculate the following metrics:<br><ul><li> worst-case response times (wcrt) of tasks</li><li> end-to-end timing of task chains</li><li> backlog of task activations (maximum buffer sizes)</li><li> output event models of dependent tasks</li></ul><strong class="text-strong">Usage scope</strong><br>pyCPA is a pragmatic Python implementation of Compositional Performance Analysis (aka the SymTA/S approach provided by Symtavision) used for research in worst-case timing analysis. Unlike the commercial SymTA/S tool, pyCPA is not intended for commercial-grade use and does not guarantee correctness of the implementation.<br><br>The aim of pyCPA is also to provide an analysis core that can be easily extended (e.g. schedulers, activation patterns, etc.).<br><br><strong class="text-strong">People</strong><br>- Philip Axer (TU Braunschweig, NXP)<br>- Jonas Diemer (TU Braunschweig, Symtavision)<br>- Daniel Thiele (TU Braunschweig)<br>- Johannes Schlatow (TU Braunschweig)<br><br><strong class="text-strong">Links</strong><br>- Website: <a href="http://pycpa.readthedocs.org" class="postlink">http://pycpa.readthedocs.org</a><br>- Code: <a href="https://bitbucket.org/pycpa/pycpa/overview" class="postlink">bitbucket repository</a><br><br><strong class="text-strong">Release history</strong><br>Continuous release and improvement of the core.<p>Statistics: Posted by <a href="http://localhost/memberlist.php?mode=viewprofile&amp;u=78">jschlatow</a> — Tue Jun 23, 2015</p><hr />
]]></content>
	</entry>
	</feed>
