<?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/75" />

	<title>Tools and Benchmarks for Real-Time Systems</title>
	<subtitle>ECRTS Community Forum</subtitle>
	<link href="http://localhost/index.php" />
	<updated>2016-07-01T16:55:09+01:00</updated>

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

		<entry>
		<author><name><![CDATA[Sophie Quinton]]></name></author>
		<updated>2016-07-01T16:55:09+01:00</updated>

		<published>2016-07-01T16:55:09+01:00</published>
		<id>http://localhost/viewtopic.php?t=75&amp;p=130#p130</id>
		<link href="http://localhost/viewtopic.php?t=75&amp;p=130#p130"/>
		<title type="html"><![CDATA[A Novel Analytical Technique for Timing Analysis of FMTV 2016 Verification Challenge Benchmark]]></title>

		
		<content type="html" xml:base="http://localhost/viewtopic.php?t=75&amp;p=130#p130"><![CDATA[
<strong class="text-strong">Title:</strong> A Novel Analytical Technique for Timing Analysis of FMTV 2016 Verification Challenge Benchmark<br><br><strong class="text-strong">Authors:</strong><br>Junchul Choi, Donghyun Kang, and Soonhoi Ha (Department of Computer Science and Engineering, Seoul National University, Korea)<br><br><strong class="text-strong">Abstract:</strong> In this paper, we present solutions to FMTV 2016 verification challenges, combining the response time analysis and schedule time bound analysis. The worst case response time of a task is computed by the conventional response time analysis while the end-to-end latency of a cause-effect chain is conservatively estimated by considering the schedule time bounds of associated runnables. Three separate challenges are discussed in order. The proposed technique is first explained to address the first challenge that ignores the memory latency. For the second challenge, we estimate the memory access latency by computing the maximum possible arbitration delay with arrival curve analysis. Finally, we propose a heuristic algorithm that determines the mapping of data labels to optimize the end-to-end latency.<br><br><strong class="text-strong">Attached paper:</strong> <div class="inline-attachment"><dl class="file"><dt><span class="imageset icon_topic_attach"></span> <a class="postlink" href="http://localhost/download/file.php?id=48&amp;sid=533701a02e0f9390a209f236b311ded9">FMTV_2016_analytical.pdf</a></dt></dl></div><p>Statistics: Posted by <a href="http://localhost/memberlist.php?mode=viewprofile&amp;u=55">Sophie Quinton</a> — Fri Jul 01, 2016</p><hr />
]]></content>
	</entry>
	</feed>
