<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
		<id>http://www.colloquiam.com/wd/index.php?action=history&amp;feed=atom&amp;title=Reynaud_et_al_2015a</id>
		<title>Reynaud et al 2015a - Revision history</title>
		<link rel="self" type="application/atom+xml" href="http://www.colloquiam.com/wd/index.php?action=history&amp;feed=atom&amp;title=Reynaud_et_al_2015a"/>
		<link rel="alternate" type="text/html" href="http://www.colloquiam.com/wd/index.php?title=Reynaud_et_al_2015a&amp;action=history"/>
		<updated>2026-05-11T10:47:09Z</updated>
		<subtitle>Revision history for this page on the wiki</subtitle>
		<generator>MediaWiki 1.27.0-wmf.10</generator>

	<entry>
		<id>http://www.colloquiam.com/wd/index.php?title=Reynaud_et_al_2015a&amp;diff=201010&amp;oldid=prev</id>
		<title>Scipediacontent: Scipediacontent moved page Draft Content 361376386 to Reynaud et al 2015a</title>
		<link rel="alternate" type="text/html" href="http://www.colloquiam.com/wd/index.php?title=Reynaud_et_al_2015a&amp;diff=201010&amp;oldid=prev"/>
				<updated>2021-02-02T02:42:33Z</updated>
		
		<summary type="html">&lt;p&gt;Scipediacontent moved page &lt;a href=&quot;/public/Draft_Content_361376386&quot; class=&quot;mw-redirect&quot; title=&quot;Draft Content 361376386&quot;&gt;Draft Content 361376386&lt;/a&gt; to &lt;a href=&quot;/public/Reynaud_et_al_2015a&quot; title=&quot;Reynaud et al 2015a&quot;&gt;Reynaud et al 2015a&lt;/a&gt;&lt;/p&gt;
&lt;table class=&quot;diff diff-contentalign-left&quot; data-mw=&quot;interface&quot;&gt;
				&lt;tr style='vertical-align: top;' lang='en'&gt;
				&lt;td colspan='1' style=&quot;background-color: white; color:black; text-align: center;&quot;&gt;← Older revision&lt;/td&gt;
				&lt;td colspan='1' style=&quot;background-color: white; color:black; text-align: center;&quot;&gt;Revision as of 02:42, 2 February 2021&lt;/td&gt;
				&lt;/tr&gt;&lt;tr&gt;&lt;td colspan='2' style='text-align: center;' lang='en'&gt;&lt;div class=&quot;mw-diff-empty&quot;&gt;(No difference)&lt;/div&gt;
&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;</summary>
		<author><name>Scipediacontent</name></author>	</entry>

	<entry>
		<id>http://www.colloquiam.com/wd/index.php?title=Reynaud_et_al_2015a&amp;diff=201009&amp;oldid=prev</id>
		<title>Scipediacontent: Created page with &quot; == Abstract ==  International audience; ADAS (Advanced Driver Assistance Systems) algorithms increasingly use heavy image processing operations. To embed this type of algorit...&quot;</title>
		<link rel="alternate" type="text/html" href="http://www.colloquiam.com/wd/index.php?title=Reynaud_et_al_2015a&amp;diff=201009&amp;oldid=prev"/>
				<updated>2021-02-02T02:42:29Z</updated>
		
		<summary type="html">&lt;p&gt;Created page with &amp;quot; == Abstract ==  International audience; ADAS (Advanced Driver Assistance Systems) algorithms increasingly use heavy image processing operations. To embed this type of algorit...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;&lt;br /&gt;
== Abstract ==&lt;br /&gt;
&lt;br /&gt;
International audience; ADAS (Advanced Driver Assistance Systems) algorithms increasingly use heavy image processing operations. To embed this type of algorithms, semiconductor companies offer many heterogeneous architectures. These SoCs (System on Chip) are composed of different processing units, with different capabilities, and often with massively parallel computing unit. Due to the complexity of these SoCs, predicting if a given algorithm can be executed in real time on a given architecture is not trivial. In fact it is not a simple task for automotive industry actors to choose the most suited heterogeneous SoC for a given application. Moreover, embedding complex algorithms on these systems remains a difficult task due to heterogeneity, it is not easy to decide how to allocate parts of a given algorithm on the different computing units of a given SoC. In order to help automotive industry in embedding algorithms on heterogeneous architectures, we propose a novel approach to predict performances of image processing algorithms applicable on different types of computing units. Our methodology is able to predict a more or less wide interval of execution time with a degree of confidence using only high level description of algorithms, and a few characteristics of computing units.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Original document ==&lt;br /&gt;
&lt;br /&gt;
The different versions of the original document can be found in:&lt;br /&gt;
&lt;br /&gt;
* [https://hal.archives-ouvertes.fr/hal-01240121/file/RSaussard_HPCC2015.pdf https://hal.archives-ouvertes.fr/hal-01240121/file/RSaussard_HPCC2015.pdf]&lt;br /&gt;
&lt;br /&gt;
* [http://xplorestaging.ieee.org/ielx7/7335977/7336120/07336166.pdf?arnumber=7336166 http://xplorestaging.ieee.org/ielx7/7335977/7336120/07336166.pdf?arnumber=7336166],&lt;br /&gt;
: [http://dx.doi.org/10.1109/hpcc-css-icess.2015.95 http://dx.doi.org/10.1109/hpcc-css-icess.2015.95]&lt;br /&gt;
&lt;br /&gt;
* [https://dblp.uni-trier.de/db/conf/hpcc/hpcc2015.html#SaussardBVR15 https://dblp.uni-trier.de/db/conf/hpcc/hpcc2015.html#SaussardBVR15],&lt;br /&gt;
: [https://ieeexplore.ieee.org/document/7336166 https://ieeexplore.ieee.org/document/7336166],&lt;br /&gt;
: [https://dl.acm.org/citation.cfm?id=2860713.2861790 https://dl.acm.org/citation.cfm?id=2860713.2861790],&lt;br /&gt;
: [https://doi.org/10.1109/HPCC-CSS-ICESS.2015.95 https://doi.org/10.1109/HPCC-CSS-ICESS.2015.95],&lt;br /&gt;
: [https://academic.microsoft.com/#/detail/2174408454 https://academic.microsoft.com/#/detail/2174408454]&lt;br /&gt;
&lt;br /&gt;
* [https://hal.archives-ouvertes.fr/hal-01240121 https://hal.archives-ouvertes.fr/hal-01240121],&lt;br /&gt;
: [https://hal.archives-ouvertes.fr/hal-01240121/document https://hal.archives-ouvertes.fr/hal-01240121/document],&lt;br /&gt;
: [https://hal.archives-ouvertes.fr/hal-01240121/file/RSaussard_HPCC2015.pdf https://hal.archives-ouvertes.fr/hal-01240121/file/RSaussard_HPCC2015.pdf]&lt;/div&gt;</summary>
		<author><name>Scipediacontent</name></author>	</entry>

	</feed>