NSF Workshop on Research Directions in the Principles of Parallel Computation
Pittsburgh, Pennsylvania, USA
June 28, 2012
This workshop will bring together researchers from academia and
industry to discuss key research challenges in the foundations of
parallel computing, and research directions to possibly address these
challenges. The workshop will address several issues described in
Computing Infrastructure Strategic Plan including, but not limited
to, computational models, programming languages, rethinking the
canonical computing "stack", and new algorithmic paradigms.
The workshop is sponsored by NSF.
The workshop will take place immediately following the
SPAA 2012 (24th ACM Symposium on Parallelism in Algorithms and Architectures).
We will be sharing the same venue on the Carnegie Mellon Campus.
The workshop will be organized as a sequence of relatively short talks
by invited speakers each who have been asked to address the question:
"what are three big research challenges in the principles of parallel
List of confirmed speakers:
The meeting will be held in Gates Hillman Centers room GHC 6115 at Carnegie Mellon.
- The workshop will be held at the Gates
Hillman Centers on the Carnegie Mellon campus. For a map of the
area and for information on travel see the SPAA
Local Information page.
- We have reserved a block of rooms at the Holiday
Inn University Center ($138/night) which is a 10-15 minute walk
from the Gates Hillman Centers.
To get the block rate you need to either:
You need to reserve by June 2 to get the block rate.
If you are attending SPAA and staying at the
dorms, you can include the nights of the 27th and 28th in your SPAA reservation.
Sorry, but dorms are not available for just the workshop. Additional
nearby hotels can be found on this
The workshop offers student travel
grants for PhD students (the deadline has passed).
Guy Blelloch, Carnegie Mellon University
Phil Gibbons, Intel Research
If you have any questions or comments, please send email to either organizer
or to Denny Maurus email@example.com.