<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>http://mw.hh.se/wg211/index.php?action=history&amp;feed=atom&amp;title=WG211%2FM14Fischer</id>
	<title>WG211/M14Fischer - Revision history</title>
	<link rel="self" type="application/atom+xml" href="http://mw.hh.se/wg211/index.php?action=history&amp;feed=atom&amp;title=WG211%2FM14Fischer"/>
	<link rel="alternate" type="text/html" href="http://mw.hh.se/wg211/index.php?title=WG211/M14Fischer&amp;action=history"/>
	<updated>2026-04-05T20:56:53Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.43.5</generator>
	<entry>
		<id>http://mw.hh.se/wg211/index.php?title=WG211/M14Fischer&amp;diff=1171&amp;oldid=prev</id>
		<title>Bernd: Created page with &quot;&#039;&#039; Code generation for distributed applications&#039;&#039; by Bernd Fischer, joint work with Tristan Aubrey-Jones  Distributed memory architectures such as Linux clusters have become comm...&quot;</title>
		<link rel="alternate" type="text/html" href="http://mw.hh.se/wg211/index.php?title=WG211/M14Fischer&amp;diff=1171&amp;oldid=prev"/>
		<updated>2015-01-11T10:44:58Z</updated>

		<summary type="html">&lt;p&gt;Created page with &amp;quot;&amp;#039;&amp;#039; Code generation for distributed applications&amp;#039;&amp;#039; by Bernd Fischer, joint work with Tristan Aubrey-Jones  Distributed memory architectures such as Linux clusters have become comm...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;&amp;#039;&amp;#039; Code generation for distributed applications&amp;#039;&amp;#039; by Bernd Fischer, joint work with Tristan Aubrey-Jones&lt;br /&gt;
&lt;br /&gt;
Distributed memory architectures such as Linux clusters have become common but remain difficult to program manually. We have&lt;br /&gt;
[http://wiki.hh.se/wg211/index.php/WG211/M12Fischer previously] shown how to automatically generate generate data distribution strategies for programs written in a functional core language. We formalized the different data layouts of distributed arrays, maps, and lists as types, which we then used to search (via type inference) for efficient data distribution plans and subsequently to generate the MPI implementations.&lt;br /&gt;
&lt;br /&gt;
Here we present several extensions to this work:&lt;br /&gt;
* generation of efficient MPI implementations in C++ &lt;br /&gt;
* performance-feedback-based data distribution search&lt;br /&gt;
* automatic redistribution insertion&lt;br /&gt;
* extensions to the type system, such as local data layouts and arrays with ghosting&lt;/div&gt;</summary>
		<author><name>Bernd</name></author>
	</entry>
</feed>