Declarative Aspects and Applications of Multicore Programming
Philadelphia, PA, USA
Saturday, January 28, 2012
To be held in conjunction with POPL 2012
Thanks to the generous support of Intel Corporation, our registration fees this year are very affordable. We are also able to provide you with lunch at the conference hotel, allowing for more interaction during lunch time.
Looking forward to seeing you in Philadelphia.
Full (long) papers will appear at the ACM site. Link to available short papers are provided below.
Session I: Invited Talk
Abstract: Guy Blelloch's showed us how to transform a nested data-parallel program (the one we want to write) into a flat data-parallel program (the one we want to run). But there's a problem: if done naively, you risk duplicating so much data that the asymptotic complexity of the algorithm gets worse, which pretty much defeats the object of the exercise. This is the "replicate problem."
We bumped into the replicate problem when implementing Data Parallel Haskell. There are known solutions for first-order programs, but that doesn't work for us, because Haskell is higher order. (Indeed, moving to higher order already requires a pervasive change to the original flattening transformation.) In this talk I'll describe the flattening transformation, explain what the replicate problem is, and how we solve it.
Session III: Invited Talk
Short papers: Not exceeding 4 pages in ACM SIGPLAN
format, short papers can present work-in-progress, describe
applications of existing systems, can articulate a position, or
present proposals for discussion at the workshop. We hope that
short papers will enables researcher to obtain feedback on their
Long papers: Not exceeding 10 pages in ACM SIGPLAN
format, these papers should present previously unpublished, original
Applications and Failures: We encourage papers on
applications. Somewhat unconventionally, we invite all researchers to
consider submitting papers not just on their successful results, but
also on their failed attempts at solving a problem. Such papers
should discuss reasons for failure and the lessons deduced and they
can be submitted in the short or long paper formats.
The advent of multicore architectures has profoundly increased the importance of research in parallel computing. Multicore architectures, now commonplace, introduce several new dimensions of variability in both performance guarantees and architectural contracts, such as the memory model, while making it highly attractive and even necessary to develop novel programming languages, models, and paradigms for taking advantage of the benefits of parallelism.
Programs written in declarative languages, which control the use of side effects, can greatly simplify development of parallel programs by eliminating or limiting data races. Such languages include purely functional languages, (constraint-) logic programming languages, many data-driven or reactive languages, and other domain specific languages (e.g., MapReduce).
DAMP 2012 is the seventh in a series of one-day workshops seeking to explore ideas in declarative programming language design that will greatly simplify programming for multicore architectures, and more generally for tightly coupled parallel architectures. Starting this year, we welcome papers on a diverse set of topics ranging from language design to applications and practical experience. To foster discussion and enable exchange of ideas between different communities, we will accept both short and long papers. Short papers aim to provide an opportunity to receive feedback on incomplete, ongoing, or even failed work. We welcome reports of successes as well as failures.
Specific topics include, but are not limited to:
We welcome both short and long communications. Long papers should not exceed 10 pages in ACM SIGPLAN conference format. Short papers should not exceed 4 pages, and may present work-in-progress, position statements on the state of the art, describe applications of existing systems, or just present proposals for discussion at the workshop. Somewhat unconventionally, we would like to welcome all researchers to consider submitting papers not just on their successful results, but also on their failed attempts with an emphasis on the reasons for failure and what lessons can be learned from them.
Both long and short communications will be refereed. Long communications will be published in the ACM Digital Library. Short communications will be made available informally at the DAMP web site but will not be published.
Papers to be published in the ACM Digital Library must adhere to the SIGPLAN Republication Policy. Concurrent submissions to other conferences, workshops, journals, or similar forums of publication are not allowed.
|Submission deadline||October 22, 2011, 18:00 your local time extended to October 29, 2011, 18:00|
|Extended deadline||October 29, 2011, 18:00 your local time|
|Notification||November 12, 2011|
|Final versions due||November 22, 2011 (Monday)|
|Workshop||January 28, 2012 (Saturday)|
Vitor Santos Costa
|DAMP 2011||Austin, Texas, USA, January 23, 2011|
|DAMP 2010||Madrid, Spain, January 19th, 2010|
|DAMP 2009||Savannah, GA, January 20th, 2009|
|DAMP 2008||San Francisco, CA, January 9th, 2008|
|DAMP 2007||Nice, France, January 16th, 2007|
|DAMP 2006||Charleston, SC, January 15th, 2006|