<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
		<id>https://www.scipedia.com/wd/index.php?action=history&amp;feed=atom&amp;title=Kruse_Grosser_2018a</id>
		<title>Kruse Grosser 2018a - Revision history</title>
		<link rel="self" type="application/atom+xml" href="https://www.scipedia.com/wd/index.php?action=history&amp;feed=atom&amp;title=Kruse_Grosser_2018a"/>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Kruse_Grosser_2018a&amp;action=history"/>
		<updated>2026-05-06T21:07:24Z</updated>
		<subtitle>Revision history for this page on the wiki</subtitle>
		<generator>MediaWiki 1.27.0-wmf.10</generator>

	<entry>
		<id>https://www.scipedia.com/wd/index.php?title=Kruse_Grosser_2018a&amp;diff=198710&amp;oldid=prev</id>
		<title>Scipediacontent: Scipediacontent moved page Draft Content 536094998 to Kruse Grosser 2018a</title>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Kruse_Grosser_2018a&amp;diff=198710&amp;oldid=prev"/>
				<updated>2021-02-01T22:12:50Z</updated>
		
		<summary type="html">&lt;p&gt;Scipediacontent moved page &lt;a href=&quot;/public/Draft_Content_536094998&quot; class=&quot;mw-redirect&quot; title=&quot;Draft Content 536094998&quot;&gt;Draft Content 536094998&lt;/a&gt; to &lt;a href=&quot;/public/Kruse_Grosser_2018a&quot; title=&quot;Kruse Grosser 2018a&quot;&gt;Kruse Grosser 2018a&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 22:12, 1 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>https://www.scipedia.com/wd/index.php?title=Kruse_Grosser_2018a&amp;diff=198709&amp;oldid=prev</id>
		<title>Scipediacontent: Created page with &quot; == Abstract ==  International audience; Increasing data movement costs motivate the integration of polyhedral loop optimizers in the standard flow (-O3) of production compile...&quot;</title>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Kruse_Grosser_2018a&amp;diff=198709&amp;oldid=prev"/>
				<updated>2021-02-01T22:12:46Z</updated>
		
		<summary type="html">&lt;p&gt;Created page with &amp;quot; == Abstract ==  International audience; Increasing data movement costs motivate the integration of polyhedral loop optimizers in the standard flow (-O3) of production compile...&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; Increasing data movement costs motivate the integration of polyhedral loop optimizers in the standard flow (-O3) of production compilers. While polyhedral optimizers have been shown to be effective when applied as source-to-source transformation, the single static assignment form used in modern compiler mid-ends makes such optimizers less effective. Scalar dependencies (dependencies carried over a single memory location) are the main obstacle preventing effective optimization. We present DeLICM, a set of transformations which, backed by a polyhedral value analysis, eliminate problematic scalar dependences by 1) relocating scalar memory references to unused array locations and by 2) forwarding computations that otherwise cause scalar dependences. Our experiments show that DeLICM effectively eliminates dependencies introduced by compiler-internal canonicalization passes, human programmers, optimizing code generators, or inlining – without the need for any additional memory allocation. As a result, polyhedral loop optimizations can be better integrated into compiler pass pipelines which is essential for metaprogramming optimization.&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.inria.fr/hal-01814183/file/delicm-sigplan.pdf https://hal.inria.fr/hal-01814183/file/delicm-sigplan.pdf]&lt;br /&gt;
&lt;br /&gt;
* [http://dl.acm.org/ft_gateway.cfm?id=3168815&amp;amp;ftid=1945727&amp;amp;dwn=1 http://dl.acm.org/ft_gateway.cfm?id=3168815&amp;amp;ftid=1945727&amp;amp;dwn=1],&lt;br /&gt;
: [http://dx.doi.org/10.1145/3168815 http://dx.doi.org/10.1145/3168815] under the license http://www.acm.org/publications/policies/copyright_policy#Background&lt;br /&gt;
&lt;br /&gt;
* [http://dl.acm.org/ft_gateway.cfm?id=3168815&amp;amp;ftid=1945727&amp;amp;dwn=1 http://dl.acm.org/ft_gateway.cfm?id=3168815&amp;amp;ftid=1945727&amp;amp;dwn=1],&lt;br /&gt;
: [http://dx.doi.org/10.1145/3179541.3168815 http://dx.doi.org/10.1145/3179541.3168815] under the license http://www.acm.org/publications/policies/copyright_policy#Background&lt;br /&gt;
&lt;br /&gt;
* [https://dblp.uni-trier.de/db/conf/cgo/cgo2018.html#KruseG18 https://dblp.uni-trier.de/db/conf/cgo/cgo2018.html#KruseG18],&lt;br /&gt;
: [https://doi.acm.org/10.1145/3168815 https://doi.acm.org/10.1145/3168815],&lt;br /&gt;
: [https://dl.acm.org/citation.cfm?id=3168815 https://dl.acm.org/citation.cfm?id=3168815],&lt;br /&gt;
: [https://academic.microsoft.com/#/detail/2793376792 https://academic.microsoft.com/#/detail/2793376792]&lt;br /&gt;
&lt;br /&gt;
* [https://hal.inria.fr/hal-01814183 https://hal.inria.fr/hal-01814183],&lt;br /&gt;
: [https://hal.inria.fr/hal-01814183/document https://hal.inria.fr/hal-01814183/document],&lt;br /&gt;
: [https://hal.inria.fr/hal-01814183/file/delicm-sigplan.pdf https://hal.inria.fr/hal-01814183/file/delicm-sigplan.pdf]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
DOIS: 10.1145/3168815 10.1145/3179541.3168815&lt;/div&gt;</summary>
		<author><name>Scipediacontent</name></author>	</entry>

	</feed>