If you're interested in what's going on with Haskell and multicores (and you should be!), please come participate in DAMP. We have several talks about Haskell work in the program this year, and I think all of the talks should be of interest to the Haskell community. <br>
<br>Cheers,<br>Leaf Petersen (General Chair)<br><br> DAMP 2010: Workshop on<br> Declarative Aspects of Multicore Programming<br> Madrid, SPAIN<br> (colocated with POPL 2010)<br>
January 19, 2010<br> <a href="http://damp10.cs.nmsu.edu">damp10.cs.nmsu.edu</a><br><br>The advent of multicore architectures has profoundly increased the <br>importance of research in parallel computing. Modern platforms are <br>
becoming more complex and heterogenous and novel solutions are needed<br>to account for their peculiarities.<br>Multicore architectures will differ in significant ways from their<br>multisocket predecessors. For example, the communication to compute<br>
bandwidth ratio is likely to be higher, which will positively impact<br>performance. More generally, multicore architectures introduce several<br>new dimensions of variability in both performance guarantees and<br>
architectural contracts, such as the memory model, that may not<br>stabilize for several generations of product.<br><br>Programs written in functional or (constraint-)logic programming<br>languages, or in other highly declarative languages with a controlled <br>
use of side effects, can greatly simplify parallel programming. Such <br>declarative programming allows for a deterministic semantics even <br>when the underlying implementation might be highly non-deterministic. <br>
In addition to simplifying programming this can simplify debugging and<br>analyzing correctness.<br><br>DAMP 2010 is the fifth in a series of one-day workshops seeking to <br>explore ideas in declarative programming language design that will <br>
greatly simplify programming for multicore architectures, and more <br>generally for tightly coupled parallel architectures. DAMP seeks to <br>gather together researchers in declarative approaches to parallel <br>
programming and to foster cross fertilization across different <br>approaches.<br><br>Preliminary Program:<br>====================<br>Tuesday January 19th, 2010:<br><br>Invited Talk [9:00-10:00]<br> * Parallelizing Constraint Programs.<br>
Laurent Michel (University of Connecticut)<br><br>Coffee Break [10:00-10:30]<br><br>Session 1 [10:30-11:30]<br> * PASTHA - Parallelizing Stencil Calculations in Haskell<br> Michael Lesniak<br> * Ypnos: Declarative Parallel Structured Grid Programming<br>
Dominic Orchard, Alan Mycroft, Max Bolingbroke<br><br>Coffee Break [11:30-12:00]<br><br>Session 2 [12:00-13:00]<br> * SequenceL: Transparency and Multi-core Parallelism<br> Brad Nemanich, Daniel Cooke, Nelson Rushton<br>
* Efficient Parallel Programming in Poly/ML and Isabelle/ML<br> David Matthews, Makarius Wenzel<br><br>Lunch (PROVIDED by the Conference) [13:00-14:30]<br><br>Session 3 [14:30-15:30]<br> * S-Net for Multi-Memory Multicores<br>
Clemens Grelck, Jukka Julku, Frank Penczek<br> * Compress-and-Conquer for Optimal Multicore Computing<br> Z. George Mou, Hai Liu, Paul Hudak<br><br>Coffee Break [15:30-16:00]<br><br>Sesssion 4 [16:00-17:00]<br>
* Lightweight Ansynchrony using Parasitic Threads<br> KC Sivaramakrishnan, Lukasz Ziarek, Raghavendra Prasad, <br> Suresh Jagannathan<br> * A Parallel ASP Instantiator Based on DLV<br> Simona Perri, Francesco Ricca, Marco Sirianni<br>
<br>Invited Talk [17:00-18:00]<br> * Declarative Data-Parallel Programming with the Accellerator <br> System<br> Satnam Singh (Microsoft Research)<br><br>URL:<br>====<br><br> <a href="http://damp10.cs.nmsu.edu">http://damp10.cs.nmsu.edu</a><br>
<br><br>