DIMACS Workshop on Parallelism: A 2020 Vision
March 14 - 16, 2011
DIMACS Center, CoRE Building, Rutgers University, Piscataway, NJ
- Organizers:
- Phil Gibbons, Intel
- Howard Karloff, AT & T Research, howard at research.att.com
- Sergei Vassilvitskii, Yahoo! Research
Presented under the auspices of the DIMACS Special Focus on Algorithmic Foundations of the Internet.
Workshop Program:
Monday, March 14, 2011
8:15 - 8:50 Breakfast and Registration
8:50 - 9:00 Welcome and Opening Remarks
Rebecca Wright, DIMACS Deputy Director
9:00 - 9:30 Sorting, Searching, and Simulation in the MapReduce Framework
Mike Goodrich, UC Irvine
9:45 - 10:15 MapReduce With Parallelizable Reduce
S. Muthukrishnan, Rutgers University
10:30 - 11:00 Counting Triangles and the Curse of the Last Reducer
Sid Suri, Yahoo! Research
11:00 - 11:30 Break
11:30 - 12:30 Billion-Core Computing
John Gustafson, Intel
12:30 - 1:45 Lunch
1:15 - 2:15 Do Parallel Algorithms and Programs Need to be Parameter Aware?
Leslie Valiant, Harvard
2:30 - 3:00 Resource Oblivious Parallel Computing
Vijaya Ramachandran, University of Texas
3:15 - 3:45 From Asymptotic PRAM Speedups To Easy-To-Obtain Concrete XMT Ones
Uzi Vishkin, University of Maryland
3:45 - 4:15 Break
4:15 - 4:45 13 Years of GPGPU and Many-Core Computing: What have we learned?
Dinesh Manocha, UNC Chapel Hill
5:00 - 5:30 Overcoming Communication Latency Barriers in Massively Parallel Molecular Dynamics Simulations on Anton
Ron Dror, DE SHAW
Tuesday, March 15, 2011
8:30 - 9:00 Breakfast and Registration
9:00 - 9:30 Parallel Coupling in Climate Models
Rob Jacob, Argonne National Laboratory
9:45 - 10:15 Green Flash: Designing An Energy Efficient Climate Supercomputer
Leonid Oliker, Lawrence Berkeley Laboratory
10:30 - 11:00 A Summary of Parallel Learning Efforts
John Langford, Yahoo! Research
11:00 - 11:30 Break
11:30 - 12:00 Taming Heterogeneous Parallelism with Domain Specific Languages
Kunle Olukotun, Stanford
12:15 - 12:45 The Post-Moore Era and Exascale Computing: On the Need for New Foundations
Marc Snir, University of Illinois
12:45 - 1:45 Lunch
1:45 - 2:15 Cluster Computing, Recursion and Datalog
Foto Afrati, National Technical University of Athens
2:30 - 3:00 Programming Parallel Algorithms
Guy Blelloch, Carnegie-Mellon University
3:15 - 3:45 Design Challenges for Scalable Concurrent Data Structures
Philippas Tsigas, Chalmers University, Sweden
3:45 - 4:15 Break
4:15 - 4:45 Fast Incremental PageRank and Collaborative Filtering
Ashish Goel, Stanford
5:00 - 5:30 Locally Limited, but Globally Unbounded: Dealing with Resources in an Explicitly Parallel World
John Kubiatowicz, UC Berkeley
Wednesday, March 16, 2011
8:30 - 9:00 Breakfast and Registration
9:00 - 9:20 Lattice Basis Reduction and Multi-Core
Werner Backes, Stevens Institute
9:30 - 9:50 Distributed Summaries
Graham Cormode, ATT Labs-Research
10:00 - 10:20 A Survey of Parallelism in Solving Numerical Optimization and Operations Research Problems
Jonathan Eckstein, Rutgers University
10:20 - 10:40 Break
10:40 - 11:00 Can PRAM Graph Algorithms Provide Practical Speedups on Many-Core Machines?
James Edwards, University of Maryland
11:10 - 11:30 On Scheduling in Map-Reduce and Flow-Shops
Tamas Sarlos, Yahoo! Research
11:40 - 12:00 Experiences Scaling Use of Google's Sawzall
Jeffrey Oldham, Google
12:00 - 1:00 Lunch
1:00 - 1:20 Theoretical Modeling of Multicore Computation
Alejandro Salinger, University of Waterloo
1:30 - 1:50 Scalable Transactional Memory Scheduling
Gokarna Sharma, Louisiana State University
2:00 - 2:20 Efficient Parallel Approximation Algorithms: What We Learn From Facility Location
Kanat Tangwongsan, Carnegie-Mellon University
2:20 Wrap Up
Break (refreshments at end of workshop)
Previous: Participation
Next: Registration
Workshop Index
DIMACS Homepage
Contacting the Center
Document last modified on March 11, 2011.