[ecoop-info] 2nd CFP: LaME'12 Languages for the Multi-core Era (ECOOP workshop)

[Jonathan Aldrich]

[Updated with detailed calls for position papers and challenge problem 
solutions.  Note that as space may be limited, priority for attendance 
at the workshop will be given to authors/presenters of regular papers, 
position papers, and challenge problem solutions.]


                  LaME'12 Second Call for Contributions

    2012 International Workshop on Languages for the Multi-core Era
            http://lame.dei.uc.pt/index.php?title=Main_Page
               June 13 2012, at ECOOP 2012, Beijing China
                     http://ecoop12.cs.purdue.edu/
              (also colocated with PLDI, ISMM, and LCTES)

LaME is an interactive venue for exposing, evaluating, and developing
programming language support for concurrency. This workshop provides a
forum for the proposal and discussion of creative ideas that spur the
development of innovative or improved concurrency models, languages,
run-time systems, libraries and tools for multicore programming.

Space at the workshop is limited.  We can ensure admission only to
those submitting accepted position papers, programming challenge
solutions, or other presentations.

We still solicit contributions of the following two forms, by May 20,
2012, at https://www.easychair.org/conferences/?conf=lame12
(The full paper deadline is now past.)

1. Position papers (of up to 2 pages) describing ongoing work of
attendees.  Position papers will be reviewed for scope and relevance,
and distributed to all attendees before the workshop.  Attendees
submitting position papers relevant to the workshop sessions on open
issues in LaME may be invited to present brief (two-slide) synopses of
their ideas and work on the following. (Authors should indicate which
if any session their position papers address.)

  * Type Systems
    including those for isolation, state, and effects
  * Intermediate program representations
    including those supporting optimizations across tasks, memory locality
  * Extensible Libraries
    including DSL support, coordination frameworks
  * Asynchronous programming
    including IO, events, reactive programing
  * Heterogeneous systems
    including integrated GPU and FPGA support, NUMA-awareness

2. Solutions to the LaME'12 programming challenge. A session at the
workshop will be devoted to brief presentations of solutions and their
implications for the design and implementation of programming
languages and parallel program development.

We solicit solutions to all or part of the following challenge,
designed to showcase the expressiveness of different parallel language
abstractions.  The challenge is in two parts, one algorithmic and one
engineering parallelism into a real-world context.  Solutions may
target either or both parts.

Solutions should include source code (ideally complete, but this is
not required) as well as a short paper discussing the benefits and
drawbacks of the approach.  Comparisons to alternative approaches are
welcome.

While the primary focus of this challenge is on expressiveness of the
language, library or other abstractions used in the solution,
evaluations showing the scalability and performance of the proposed
approach are encouraged to show the performance that can be achieved
with the approach.

The paper should be at most 4 pages.  Code and papers will not be
formally published, but will be archived on the LaME website.
Solutions to the challenge problem will be presented and discussed at
a workshop session.

PART A: PARALLEL ALGORITHMS

The first challenge involves expressing algorithms cleanly.
Prospective solutions will implement one or more of the benchmarks
from the Problem Based Benchmark Suite.  This open source suite
describes a number of common real-world problems in terms of the
function they implement and not the particular algorithm or code they
use, and are thus a useful way to compare different programming
languages, methodologies, and algorithm designs.

A description of the problems in the benchmark suite, together with
sample implementations and sample inputs, is available at:

http://www.cs.cmu.edu/~guyb/pbbs/


PART B: PARALLELISM IN CONTEXT

The second challenge involves putting parallelism into a real-world
context.  While expressing the core of an algorithm is important,
equally important is getting the data from the world, into an
algorithm, and back out into the world.  Desirable characteristics
include code that is short, clear, and efficient.

Prospective solutions will show how to get parallel data from some
public source, process it in parallel, and display the output in some
meaningful way.  The processing itself may be a solution to Part A or
it may be any other parallel algorithm.  Data sources to consider
include Tim Bray's Wide Finder and Wide Finder 2 benchmarks:

http://www.tbray.org/ongoing/When/200x/2008/05/01/Wide-Finder-2

or one of the research-quality data sets described here:

https://bitly.com/bundles/hmason/1

However, any public data source may be used.


ORGANIZING COMMITTEE

* Jonathan Aldrich (Carnegie Mellon University) 
http://www.cs.cmu.edu/~aldrich/
* Paulo Marques (University of Coimbra) http://pmarques.dei.uc.pt/
* Bruno Cabral (University of Coimbra) http://eden.dei.uc.pt/~bcabral/
* Néstor Catañho (University of Madeira) 
http://dme.uma.pt/pt/people/faculty/Nestor.Catano.html
* Doug Lea (State University of New York at Oswego) 
http://gee.cs.oswego.edu/

Program Chair
* Doug Lea (State University of New York at Oswego) 
http://gee.cs.oswego.edu/

Program Committee
* Robert Bocchino (Carnegie Mellon University) 
http://www.cs.cmu.edu/~rbocchin/Home.html
* Brian Goetz (Oracle) http://www.briangoetz.com/
* Philipp Haller (TypeSafe and EPFL) http://lampwww.epfl.ch/~phaller/
* Mark Miller (Google) http://research.google.com/pubs/author35958.html
* Simon Peyton-Jones (Microsoft) 
http://research.microsoft.com/en-us/people/simonpj/
* Vivek Sarkar (Rice University) 
http://www.cs.rice.edu/~vs3/home/Vivek_Sarkar.html
* Steve Vinoski (Basho) http://steve.vinoski.net/blog/