On Friday October 17, this site was moved to a new server, https://mw.hh.se. The original address will continue to work. Whithin a week or two this site will return to the original address. /Peo HH IT-dep

WG211/M14Fischer: Difference between revisions

From WG 2.11
Jump to navigationJump to search
Bernd (talk | contribs)
Created page with "'' Code generation for distributed applications'' by Bernd Fischer, joint work with Tristan Aubrey-Jones Distributed memory architectures such as Linux clusters have become comm..."
 
(No difference)

Latest revision as of 12:44, 11 January 2015

Code generation for distributed applications by Bernd Fischer, joint work with Tristan Aubrey-Jones

Distributed memory architectures such as Linux clusters have become common but remain difficult to program manually. We have 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.

Here we present several extensions to this work:

  • generation of efficient MPI implementations in C++
  • performance-feedback-based data distribution search
  • automatic redistribution insertion
  • extensions to the type system, such as local data layouts and arrays with ghosting