Check out the new USENIX Web site.
HotPar '11 Banner


WORKSHOP PROGRAM

THURSDAY | FRIDAY

The workshop will take place on the Clark Kerr Campus at the University of California, Berkeley. All sessions will be held in the Joseph Wood Krutch Theatre unless otherwise noted.

THURSDAY, MAY 26, 2011
7:30 a.m.–8:30 a.m.    Breakfast, Dining Hall
8:30 a.m.–10:00 a.m.

Considerations When Evaluating Microprocessor Platforms
Michael Anderson, Bryan Catanzaro, Jike Chong, Ekaterina Gonina, Kurt Keutzer, Chao-Yue Lai, Mark Murphy, David Sheffield, Bor-Yiing Su, and Narayanan Sundaram, University of California, Berkeley

Read the Abstract | Full paper

RADBench: A Concurrency Bug Benchmark Suite
Nicholas Jalbert, University of California, Berkeley; Cristiano Pereira and Gilles Pokam, Intel; Koushik Sen, University of California, Berkeley

Read the Abstract | Full paper

10:00 a.m.–10:30 a.m.    Break
10:30 a.m.–noon

How to Miscompile Programs with "Benign" Data Races
Hans-J. Boehm, HP Laboratories

Read the Abstract | Full paper

Deterministic OpenMP for Race-Free Parallelism
Amittai Aviram and Bryan Ford, Yale University

Read the Abstract | Full paper

Noon–1:30 p.m.    Workshop Luncheon with Discussion Topic Tables, Dining Hall
1:30 p.m.–3:00 p.m.

Parkour: Parallel Speedup Estimates for Serial Programs
Donghwan Jeon, Saturnino Garcia, Chris Louie, and Michael Bedford Taylor, University of California, San Diego

Read the Abstract | Full paper

Enabling Multiple Accelerator Acceleration for Java/OpenMP
Ronald Veldema, Thorsten Blass, and Michael Philippsen, University of Erlangen-Nuremberg

Read the Abstract | Full paper

3:00 p.m.–3:30 p.m.    Break
3:30 p.m.–5:00 p.m.

CUDA-level Performance with Python-level Productivity for Gaussian Mixture Model Applications
H. Cook, E. Gonina, and S. Kamil, University of California, Berkeley; G. Friedland, International Computer Science Institute; D. Patterson and A. Fox, University of California, Berkeley

Read the Abstract | Full paper

Pervasive Parallelism for Managed Runtimes
Albert Noll and Thomas R. Gross, ETH Zurich

Read the Abstract | Full paper

5:00 p.m.–5:30 p.m.    Break
5:30 p.m.–6:00 p.m.

Poster Previews

6:00 p.m.–8:30 p.m.

Poster Session and Reception
Garden Room

The Poster Session will include all the talks in the program, as well as the papers listed here.

8:30 p.m.–10:00 p.m.

Informal Discussions/Birds-of-a-Feather Sessions (BoFs)
Rooms 102 and 104

FRIDAY, MAY 27, 2011
7:30 a.m.–8:30 a.m.    Breakfast, Dining Hall
8:30 a.m.–10:00 a.m.

Balance Principles for Algorithm-Architecture Co-Design
Kent Czechowski, Casey Battaglino, Chris McClanahan, Aparna Chandramowlishwaran, and Richard Vuduc, Georgia Institute of Technology

Read the Abstract | Full paper

Crunching Large Graphs with Commodity Processors
Jacob Nelson, Brandon Myers, A.H. Hunter, Preston Briggs, Luis Ceze, Carl Ebeling, and Dan Grossman, University of Washington; Simon Kahan, University of Washington and Pacific Northwest National Laboratory; Mark Oskin, University of Washington

Read the Abstract | Full paper

10:00 a.m.–10:30 a.m.    Break
10:30 a.m.–noon

Multicore Performance Optimization Using Partner Cores
Eric Lau and Jason E Miller, MIT Computer Science and Artificial Intelligence Laboratory; Inseok Choi and Donald Yeung, University of Maryland; Saman Amarasinghe and Anant Agarwal, MIT Computer Science and Artificial Intelligence Laboratory

Read the Abstract | Full paper

Parallel Pattern Detection for Architectural Improvements
Jason A. Poovey, Brian P. Railing, and Thomas M. Conte, Georgia Institute of Technology

Read the Abstract | Full paper

Noon–1:30 p.m.    Workshop Luncheon with Discussion Topic Tables, Dining Hall
1:30 p.m.–3:00 p.m.

Parallel Programming of General-Purpose Programs Using Task-Based Programming Models
Hans Vandierendonck, Ghent University; Polyvios Pratikakis and Dimitrios S. Nikolopoulos, Foundation for Research and Technology - Hellas (FORTH)

Read the Abstract | Full paper

Parallel Programming with Inductive Synthesis
Shaon Barman, Rastislav Bodik, Sagar Jain, Yewen Pu, Saurabh Srivastava, and Nicholas Tung, University of California, Berkeley

Read the Abstract | Full paper

3:00 p.m.–3:30 p.m.    Break
3:30 p.m.–5:00 p.m.

A Relativistic Enhancement to Software Transactional Memory
Philip W. Howard and Jonathan Walpole, Portland State University

Read the Abstract | Full paper

Quarantine: Fault Tolerance for Concurrent Servers with Data-Driven Selective Isolation
Thanumalayan Sankaranarayana Pillai, Andrea C. Arpaci-Dusseau, and Remzi H. Arpaci-Dusseau, University of Wisconsin, Madison

Read the Abstract | Full paper

5:00 p.m.–5:10 p.m.

Wrap-Up

footer
? Need help? Use our Contacts page.

Last changed: 27 May 2011 jp