Skip to Content.
Sympa Menu

charm - [charm] (no subject)

charm AT lists.cs.illinois.edu

Subject: Charm++ parallel programming system

List archive

[charm] (no subject)


Chronological Thread 
  • From: Philip Miller <mille121 AT illinois.edu>
  • To: charm AT cs.uiuc.edu
  • Subject: [charm] (no subject)
  • Date: Mon, 29 Mar 2010 15:31:53 -0500
  • List-archive: <http://lists.cs.uiuc.edu/pipermail/charm>
  • List-id: CHARM parallel programming system <charm.cs.uiuc.edu>

2010 Parallel Programming Workshop
From: Phil Miller
<mille121 AT illinois.edu>
Subject: Invitation: 2010 Parallel Programming Workshop / 8th Annual Workshop
on Charm++ and its Applications, 4/28-30

8th Annual Workshop on Charm++ and its Applications
20th Anniversary of the Parallel Programming Lab

http://charm.cs.uiuc.edu/charmWorkshop

April 28-30, 2010

Hosted by the Parallel Programming Laboratory
Department of Computer Science
University of Illinois at Urbana-Champaign

Parallel applications tend to be complex and hard to debug.
Programmers need good programming models, compilers, and other
tools to ease their burden. For the new generation of multi-physics
and multi-scale applications, developers would like to concurrently
compose multiple modules, possibly written in a range of languages and
paradigms. Charm++ and AMPI address these issues, supporting a
programming approach that enhances programmer productivity while
achieving good performance. An adaptive runtime system automates
such necessities as load balancing, fault tolerance, check pointing,
dynamic job resizing, and performance instrumentation. The
message-driven approach supports concurrent composition of modules,
while higher level notations support commonly used communication
patterns with high productivity.

Join us for a discussion of emerging techniques and technologies for
parallel programming.

Please forward this invitation to local distribution lists and other
interested parties.




  • [charm] (no subject), Philip Miller, 03/29/2010

Archive powered by MHonArc 2.6.16.

Top of Page